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 16 of 16 for “"Quantum Phase Estimation"”.
-
Quantum Algorithms For: Quantum Phase Estimation, Approximation Of The Tutte Polynomial And Black-box Structures
… three different problems in the field of Quantum computation. First, we discuss the quantum complexity of evaluating the Tutte polynomial of a planar graph. Furthermore, we devise a new quantum algorithm for approximating the phase of a unitary matrix. Finally, we provide quantum tools …
-
The Power Of Quantum Walk Insights, Implementation, And Applications
In this thesis, I investigate quantum walks in quantum computing from three aspects: the insights, the implementation, and the applications. Quantum walks are the quantum analogue of classical random walks. For the insights of quantum walks, I list and explain the required components for quantizing …
-
Řešení sudoku pomocí kvantového počítání
… this thesis, Sudoku is solved by the well-known quantum algorithms. The algorithms used are Grover’s algorithm and quantum counting that uses quantum phase estimation. The grid size of the Sudoku is varied to study the impact on the quantum hardware such as Qiskit while performing quantum …
-
Resource Estimation for Quantum Simulation Algorithms
A major application of quantum computers is simulating other quantum systems that are intractable to simulate classically. The broad family of algorithms for this problem go by the name of quantum simulation. Product formulas provide resource efficient and practical methods to simulate Hamiltonian …
-
INTERPLAY OF CHAOS AND INTEGRABILITY: FROM SHOR’S ALGORITHM TO SOLITONS
… this problem in polynomial time on a scalable quantum computer. Shor’s algorithm is an application of quantum phase estimation where one factorizes a number by finding the periodicity of the modular multiplication operator. Quantum modular multiplication is related to classical Bernoulli map …
-
Quantum Algorithms for Simulation, Optimization, and Estimation
Quantum algorithms hold the promise of fundamentally changing the way we approach problems in physics, chemistry, computer science, and engineering. This thesis explores new provably efficient quantum algorithms for three fundamental directions in quantum computing: simulation, optimization, and …
-
Design and synthesis of efficient circuits for quantum computers
… in the field of experimental construction of quantum computers with increased fidelity components shows that large-scale machines based on the principles of quantum physics are likely to be realized in the near future. As the size of the future quantum computers will be increased, efficient …
-
Algebraic Tools for Quantum Simulations of Electronic Structure
… strongly correlated systems. For this reason, quantum algorithms have been developed as a promising alternative. In this work, we develop algebraic tools to improve the efficiency of three quantum algorithms for the electronic structure problem, addressing key bottlenecks for both near-term and …
-
Lambda-enhanced grey molasses with EIT-offset lock for quantum sensing
… thesis works towards a low-noise platform for quantum phase estimation using neutral rubidium atoms, aiming to enhance interferometric sensitivity for gravitational wave detection, medical imaging, and fundamental physics applications. Here, we lay the groundwork for a quantum sensing method …
-
Path integral and qubit encoding techniques for quantum simulations of discrete planar rotor lattices
… are used for benchmarking throughout. Near term quantum devices have recently garnered significant interest as promising candidates for investigating difficult-to-probe regimes in many-body physics. To this end, various qubit encoding schemes targeting second quantized Hamiltonians have been …
-
Quantum Computing for Chemistry: From Quantum Computing with Molecules to Algorithmic Design
… materials is one of the premier applications of quantum computing. A major question in the thesis is: how might we use long- and near-term quantum computers to solve problems of chemical interest? First, we give an overview of the standard model in electronic structure theory. Electronic …
-
New Approaches on Source Coding for Quantum Stochastic Sources and Implementation of Quantum Fanout Gate
The accurate computation of advanced quantum algorithms like Shor’s integer factorization, quantum phase estimation (QPE), and the quantum Fourier transform (QFT) requires quantum circuits of considerable size and depth. It is difficult to achieve reliable computation with deep quantum circuits due …
-
On Algorithms, Separability and Cellular Automata in Quantum Computing
… Part I of this thesis, we present a new model of quantum cellular automata (QCA) based on local unitary operations. We will describe a set of desirable properties for any QCA model, and show that all of these properties are satisfied by the new model, while previous models of QCA do not. We will …
-
Entanglement-Enhanced Metrology With Superconducting Circuits
Circuit quantum electrodynamics provides a unique platform for investigating fundamental physics and practical quantum applications. In this thesis, I introduce the superconducting circuit platform from a foundational perspective. Drawing inspiration from quantum electrodynamics and utilizing the …
-
Quantum error mitigation for error-resilient quantum computation
Quantum computers have the potential of providing unprecedented computational power for solving problems that are known to be difficult for classical computers, including integer factoring, database searching, molecular simulation and combinatorial optimization. At the time of writing, the largest …