Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 162 for “"Quantum Algorithm"”.

  1. A VARIATIONAL QUANTUM ALGORITHM FOR SOLVING PARTIAL DIFFERENTIAL EQUATIONS

    Variational Quantum Algorithms(VQAs) are a class of algorithm that uses a hybrid approach to solve optimization problems. VQAs use a quantum computer to compute expectation values of circuits that are encoded using classical data and then use a classical optimizer to adjust the parameters of these …

    cornell Repository record for A VARIATIONAL QUANTUM ALGORITHM FOR SOLVING PARTIAL DIFFERENTIAL EQUATIONS (opens in a new tab)

  2. Quantum algorithm for linear systems of equations for the multi-dimensional Black-Scholes equation

    … focus of this thesis is the investigation of the quantum algorithm for linear systems of equations (HHL) for the valuation of multi-asset options, a particular type of financial instrument. Quantum computing has the possibility to revolutionize many fields that are computationally intensive, such …

    maynooth Download PDF for Quantum algorithm for linear systems of equations for the multi-dimensional Black-Scholes equation (opens in a new tab)

  3. Motional Dynamics in Trapped Ions and Rydberg Atoms, and Hybrid Quantum Algorithm for Classical Optimization

    Quantum information science has emerged as one of the most promising fields in contemporary research, relying on both software and hardware innovations. This thesis looks for both algorithms with quantum features that provide advantages over classical algorithms, and better hardware platforms for …

    rice Repository record for Motional Dynamics in Trapped Ions and Rydberg Atoms, and Hybrid Quantum Algorithm for Classical Optimization (opens in a new tab)

  4. Quantum Graph Parameters

    … some of the advantages, and limits, of applying quantum computing to solve two important graph problems. The first is estimating a graph's quantum chromatic number. The quantum chromatic number is the minimum number of colors necessary in a two-player game where the players cannot communicate but …

    ucf Repository record for Quantum Graph Parameters (opens in a new tab)

  5. Implementing Dijkstra's pathfind using quantum algorithms

    This thesis explores using Grover's Search (a quantum algorithm) to implement Dijkstra's algorithm. Contains source code.

    csusb Repository record for Implementing Dijkstra's pathfind using quantum algorithms (opens in a new tab)

  6. Implementing Dijkstra's pathfind using quantum algorithms

    This thesis explores using Grover's Search (a quantum algorithm) to implement Dijkstra's algorithm. Contains source code.

    csusb-retro Repository record for Implementing Dijkstra's pathfind using quantum algorithms (opens in a new tab)

  7. Optimization of Quantum Algorithms for Applications

    I aim to design and evaluate quantum algorithms that perform optimally with respect to metrics that make or break the applicability of these algorithms. Specifically, I analyze two applications: Bitcoin mining and estimating expectation values from a system of linear equations. For the former I …

    calgary Repository record for Optimization of Quantum Algorithms for Applications (opens in a new tab)

  8. Novel Quantum Chemistry Algorithms Based on the Variational Quantum Eigensolver

    The variational quantum eigensolver (VQE) approach is currently one of the most promising strategies for simulating chemical systems on quantum hardware. In this work, I will describe a new quantum algorithm and a new set of classical algorithms based on VQE. The quantum algorithm, ADAPT-VQE, shows …

    vt Repository record for Novel Quantum Chemistry Algorithms Based on the Variational Quantum Eigensolver (opens in a new tab)

  9. Sampling Using Controlled Quantum Walks

    We give a new quantum algorithm to sample from probability distributions over graph vertices quadratically faster than the optimal classical algorithm, which uses random walks with stopping rules. Efficient sampling is an important computational task used in simulations based on stochastic …

    calgary Repository record for Sampling Using Controlled Quantum Walks (opens in a new tab)

  10. Efficient algorithms in quantum query complexity

    … we provide new upper and lower bounds on the quantum query complexity of a diverse set of problems. Specifically, we study quantum algorithms for Hamiltonian simulation, matrix multiplication, oracle identification, and graph-property recognition. For the Hamiltonian simulation problem, we …

    waterloo Repository record for Efficient algorithms in quantum query complexity (opens in a new tab)

  11. Quantum walk on two-dimensional torus and grid

    … vertex, such that χ(m) = 1. Random walk is an algorithm for finding such a vertex. The measure of complexity for random walk is hitting time. There is a quantum algorithm that finds a marked vertex, and runs in the square root of the extended hitting time. For some configurations of marked …

    calgary Repository record for Quantum walk on two-dimensional torus and grid (opens in a new tab)

  12. The hidden subgroup problem for generalized quaternions

    … hidden subgroup problem is a pivotal problem in quantum computation since it reflects the structure of tasks for which quantum algorithms significantly outperform classical algorithms. In this dissertation, a quantum algorithm that solves the hidden subgroup problem over the generalized …

    alabama Repository record for The hidden subgroup problem for generalized quaternions (opens in a new tab)

  13. Quantum algorithms and the power of forgetting

    … that can be solved exponentially faster by a quantum walk than by any classical algorithm (https://arxiv.org/pdf/quant-ph/0209131.pdf). Given the name of a special ENTRANCE vertex, a quantum walk can find another distinguished EXIT vertex using polynomially many queries, though without finding …

    maryland Repository record for Quantum algorithms and the power of forgetting (opens in a new tab)

  14. Digital Quantum Computing for Many-Body Simulations

    Abstract Iris The power of quantum computing lies in its ability to perform certain calculations and solve complex problems exponentially faster than classical computers. This potential has profound implications for a wide range of fields, including particle physics. This thesis lays a fundamental …

    trento Repository record for Digital Quantum Computing for Many-Body Simulations (opens in a new tab)

  15. Lee-Yang Tensors in Quantum Information and Algorithms for Local Hamiltonian Problems

    Local Hamiltonian problems are central to both quantum complexity theory and quantum many-body physics: ground state problems are the natural quantum constraint satisfaction problems, and computing the partition function reveals thermal equilibrium properties. A turning point in the theory of local …

    waterloo Repository record for Lee-Yang Tensors in Quantum Information and Algorithms for Local Hamiltonian Problems (opens in a new tab)

  16. Design and Analysis of Quantum Algorithms for Quantum Computing and Communications

    The quantum communication, from a conceptual point of view, is a technology that uses the information transmission of quantum media to communicate. It mainly includes technologies such as quantum key distribution (QKD) and quantum teleportation. This thesis proposes a potential application of QKD …

    lancaster Download PDF for Design and Analysis of Quantum Algorithms for Quantum Computing and Communications (opens in a new tab)

  17. Methods for quantum circuit design and simulation

    The goal of quantum computing is to harness the unique properties of quantum mechanics to perform computations that are beyond the capabilities of traditional, classical circuits based on transistors. A quantum circuit is an established way of expressing a quantum algorithm. This thesis will …

    nps Repository record for Methods for quantum circuit design and simulation (opens in a new tab)

Page 1 of 9