Searched for: subject%3A%22Quantum%255C%2Balgorithms%22
(1 - 20 of 25)

Pages

document
Driebergen, Tim (author)
The minimum vertex cover problem (MinVertexCover) is an important optimization problem in graph theory, with applications in numerous fields outside of mathematics. As MinVertexCover is an NP-hard problem, there currently exists no efficient algorithm to find an optimal solution on arbitrary graphs. We consider quantum optimization algorithms,...
master thesis 2023
document
Verduyn, Thomas (author)
The need of computational power for engineering applications has been ever increasing and with classical computers approaching their physical limits, new ways of improvement have to be investigated. One of the promising solutions is quantum computing. Most engineering problems require solving a system of linear equations of higher dimensions and...
master thesis 2022
document
Sarkar, A. (author)
Efforts to realize a sufficiently large controllable quantum processor are actively being pursued globally. These quantum devices are programmed by specifying the manipulation of quantum information via quantum algorithms. This doctoral research provides an application perspective to the design requirements of a quantum accelerator architecture....
doctoral thesis 2022
document
Tosti Balducci, G.B.L. (author), Chen, B. Y. (author), Möller, M. (author), Gerritsma, M.I. (author), De Breuker, R. (author)
Structural mechanics is commonly modeled by (systems of) partial differential equations (PDEs). Except for very simple cases where analytical solutions exist, the use of numerical methods is required to find approximate solutions. However, for many problems of practical interest, the computational cost of classical numerical solvers running on...
review 2022
document
Steinberg, M.A. (author), Feld, S. (author), Almudever, Carmen G. (author), Marthaler, Michael (author), Reiner, Jan Michael (author)
The qubit-mapping problem aims to assign and route qubits of a quantum circuit onto an noisy intermediate-scale quantum (NISQ) device in an optimized fashion, with respect to some cost function. Finding an optimal solution to this problem is known to scale exponentially in computational complexity; as such, it is imperative to investigate...
journal article 2022
document
Patra, B (author)
Quantum computers can provide exponential speedup in solving certain computational problems pertaining to drug discovery, cybersecurity, weather forecasting, etc. Although a quantum computer with just 50-qubits has been shown to surpass the computing power of the best supercomputers in specific applications, millions of qubits would be required...
doctoral thesis 2021
document
van der Linde, Stan (author)
Recent developments in quantum annealing have shown promising results in logistics, life sciences, machine learning and more. However, in the field of geophysical sciences the applications have been limited. A quantum annealing application was developed for residual statics estimation. Residual statics estimation is a highly non-linear problem...
master thesis 2021
document
Cappanera, Enrico (author)
This research investigates the possibility of solving one dimensional Poisson's equation on quantum computers using the Variational Quantum Linear Solver (VQLS) as a simplified test case for fluid dynamics applications. In this work, Poisson's equation is discretized with the finite element method and the resulting matrix is decomposed as a...
master thesis 2021
document
Oudejans, Benjamin (author)
As quantum computers are developing, they are beginning to become useful for practical applications, for example in the field of quantum metrology. In this work, a variational quantum algorithm is used to find an optimal probe state for measuring parameters in a noisy environment. This is achieved by optimizing a cost on a quantum computer,...
bachelor thesis 2021
document
van der Meer, Tim (author)
The rapid progress quantum devices have made in recent years has led to the need for systems that bridge the gap between quantum algorithms and quantum hardware. To this purpose different full-stack quantum programming platforms have been developed, providing high level languages for expressing quantum algorithms and providing compilers for...
master thesis 2021
document
Sigurđsson, Sigurdsson (author)
In this thesis, I make a comparison of two quantum algorithms for solving systems of linear equations. The two approaches are tested using both simulations of quantum processes and simulations of noisy intermediary-scale quantum computers, i.e., NISQ. Both methods are tested on the same problems to compare sensitivity and runtime efficiency,...
master thesis 2021
document
Sarkar, A. (author), Al-Ars, Z. (author), Almudever, Carmen G. (author), Bertels, K.L.M. (author)
With small-scale quantum processors transitioning from experimental physics labs to industrial products, these processors in a few years are expected to scale up and be more robust for efficiently computing important algorithms in various fields. In this paper, we propose a quantum algorithm to address the challenging field of data processing...
journal article 2021
document
Sarkar, A. (author), Al-Ars, Z. (author), Bertels, K.L.M. (author)
Inferring algorithmic structure in data is essential for discovering causal generative models. In this research, we present a quantum computing framework using the circuit model, for estimating algorithmic information metrics. The canonical computation model of the Turing machine is restricted in time and space resources, to make the target...
journal article 2021
document
Bus, J.C.P. (author)
The Quantum Approximate Optimization Algorithm (QAOA) is one of the promising near-term algorithms designed to find approximate solutions for combinatorial optimization problems. The algorithm prepares a parametrized state that is aimed to maximize the expectation value of the objective function of the problem. The circuit for QAOA consists of p...
bachelor thesis 2020
document
Krol, Anneriet (author)
Unitary Decomposition is an algorithm for translating a unitary matrix into many small unitary matrices, which correspond to a circuit that can be executed on a quantum computer. It is implemented in the quantum programming framework of the QCA-group at TU Delft: OpenQL, a library for Python and C++. Unitary Decomposition is a necessary part in...
master thesis 2019
document
Ubbens, Otmar (author)
With the rapid development of Quantum Computers (QC) and QC Simulators, there will be an increased demand for functioning Quantum Algorithms in the near future. Some of the most ubiquitously useful algorithms are solvers for linear systems of equations. Since the conception of the Quantum Linear Solver Algorithm (QLSA) by Harrow, Hassidim and...
bachelor thesis 2019
document
Driebergen, Tim (author)
Currently there are no efficient quantum algorithms for the addition of real-valued numbers. In classical computers addition is performed by using barrel shifters, a concept proven to be very inefficient as a quantum circuit due to its many garbage outputs when the barrel shifter is made reversible. This thesis aims to design a quantum algorithm...
bachelor thesis 2019
document
Steudtner, M. (author), Wehner, S.D.C. (author)
Quantum simulation of fermionic systems is a promising application of quantum computers, but to program them, we need to map fermionic states and operators to qubit states and quantum gates. While quantum processors may be built as two-dimensional qubit networks with couplings between nearest neighbors, standard fermion-To-qubit mappings do...
journal article 2019
document
Möller, M. (author), Vuik, Cornelis (author)
The development of practical quantum computers that can be used to solve real-world problems is in full swing driven by the ambitious expectation that quantum supremacy will be able to outperform classical super-computers. Like with any emerging compute technology, it needs early adopters in the scientific computing community to identify...
journal article 2019
document
O'Brien, T.E. (author), Tarasinski, B.M. (author), Terhal, B.M. (author)
Quantum phase estimation (QPE) is the workhorse behind any quantum algorithm and a promising method for determining ground state energies of strongly correlated quantum systems. Low-cost QPE techniques make use of circuits which only use a single ancilla qubit, requiring classical post-processing to extract eigenvalue details of the system....
journal article 2019
Searched for: subject%3A%22Quantum%255C%2Balgorithms%22
(1 - 20 of 25)

Pages