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 23 for “"Hamiltonian simulation"”.

  1. Quantum Algorithms for Clustering and Covert Factoring

    … and a scheme to hide Shor’s algorithm in Hamiltonian Simulation and Ground State Estimation circuits. Clustering algorithms are at the basis of several technological applications, and are fueling the development of rapidly evolving fields such as machine learning. In the recent past, …

    waterloo Repository record for Quantum Algorithms for Clustering and Covert Factoring (opens in a new tab)

  2. quantum simulation with waveguide photons: theory and experiment

    … have emerged as a versatile platform for the simulation quantum dynamics. So far, the majority of works in this field have been limited to the non-interacting regime, and intriguing nonlinear and interactive quantum many-body phenomena such as Bose-Hubbard or fractional quantum Hall (FQH) …

    maryland Repository record for quantum simulation with waveguide photons: theory and experiment (opens in a new tab)

  3. QUANTUM ALGORITHMS FOR DIFFERENTIAL EQUATIONS

    This thesis describes quantum algorithms for Hamiltonian simulation, ordinary differential equations (ODEs), and partial differential equations (PDEs). Product formulas are used to simulate Hamiltonians which can be expressed as a sum of terms which can each be simulated individually. By simulating …

    maryland Repository record for QUANTUM ALGORITHMS FOR DIFFERENTIAL EQUATIONS (opens in a new tab)

  4. Efficient algorithms in quantum query complexity

    … Specifically, we study quantum algorithms for Hamiltonian simulation, matrix multiplication, oracle identification, and graph-property recognition. For the Hamiltonian simulation problem, we provide a quantum algorithm with query complexity sublogarithmic in the inverse error, an exponential …

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

  5. Quantum Algorithms for Nonconvex Optimization: Theory and Implementation

    … fully understood. This thesis focuses on Quantum Hamiltonian Descent (QHD), a quantum algorithm for continuous optimization problems. A systematic study of Quantum Hamiltonian Descent is presented, including theoretical results concerning nonconvex optimization and efficient implementation …

    maryland Repository record for Quantum Algorithms for Nonconvex Optimization: Theory and Implementation (opens in a new tab)

  6. Quantum Control Protocols for Robust Quantum Computing

    … analog quantum algorithms to perform high-order Hamiltonian simulation and learning unknown quantum states.

    unm Repository record for Quantum Control Protocols for Robust Quantum Computing (opens in a new tab)

  7. INITIAL STATE PREPARATION FOR SIMULATION OF QUANTUM FIELD THEORIES ON A QUANTUM COMPUTER

    … we begin by reviewing some of the most important Hamiltonian simulation algorithms that are applied in simulation of quantum field theories. Then we focus on state preparation which has been the slowest subroutine in previously known algorithms. We present two distinct methods that improve upon …

    maryland Repository record for INITIAL STATE PREPARATION FOR SIMULATION OF QUANTUM FIELD THEORIES ON A QUANTUM COMPUTER (opens in a new tab)

  8. Theoretical Developments in Lattice Gauge Theory for Applications in Double-beta Decay Processes and Quantum Simulation

    … and real-time quantities are concerned. Hamiltonian simulation of QCD is another non-perturbative method of solving QCD that, by its nature, does not suffer from those limitations. With the advent of novel computational tools, like tensor network methods and quantum simulation, …

    maryland Repository record for Theoretical Developments in Lattice Gauge Theory for Applications in Double-beta Decay Processes and Quantum Simulation (opens in a new tab)

  9. Efficient simulation of Hamiltonians

    … in this thesis is the following: We are given a Hamiltonian H and time t, and our goal is to approximately implement the unitary operator e^{-iHt} with an efficient quantum algorithm. We present an efficient algorithm for simulating sparse Hamiltonians. In terms of the maximum degree d and …

    waterloo Repository record for Efficient simulation of Hamiltonians (opens in a new tab)

  10. Novel Computational Paradigms in Chemistry: Software, Algorithms, Policy.

    … algorithmic development, with a focus on Hamiltonian simulation via variational quantum algorithms (VQA's) such as the Variational Quantum Eigensolver (VQE). To aid in the interoperability of different quantum computing architectures, we present methods for the quantum simulation of …

    toronto-retro Repository record for Novel Computational Paradigms in Chemistry: Software, Algorithms, Policy. (opens in a new tab)

  11. Control and calibration strategies for quantum simulation

    … effects. An alternative route is through quantum simulation, where a programmable quantum device is used to emulate the phenomena of an otherwise distinct physical system. Unfortunately, there are a number of challenges preventing the widespread application of quantum simulation arising from the …

    utk-theses Repository record for Control and calibration strategies for quantum simulation (opens in a new tab)

  12. SPARSITY AND WEAK SUPERVISION IN QUANTUM MACHINE LEARNING

    … uses recent advances in quantum sample-based Hamiltonian simulation to extend the existing Quantum LS-SVM algorithm to handle the semi-supervised term in the loss while maintaining the same quantum speedup as the Quantum LS-SVM.

    vcu Repository record for SPARSITY AND WEAK SUPERVISION IN QUANTUM MACHINE LEARNING (opens in a new tab)

  13. Quantum Algorithmic Techniques for Fault-Tolerant Quantum Computers

    … quantization. Second, I review the progress of Hamiltonian simulations and give a new algorithm for simulating time-dependent Hamiltonians. This algorithm scales polylogarithmic in the inverse error, and the query complexity does not depend on the derivatives of the Hamiltonian. A time-dependent …

    waterloo Repository record for Quantum Algorithmic Techniques for Fault-Tolerant Quantum Computers (opens in a new tab)

  14. Improved Quantum Algorithms for Simulating Many-Body Systems

    … One of the most promising applications is the simulation of many-body systems such as complex molecules or materials. In this thesis, we present several quantum algorithms for simulating many-body systems that can provide considerably better scaling than prior approaches. First, we describe a …

    toronto-retro Repository record for Improved Quantum Algorithms for Simulating Many-Body Systems (opens in a new tab)

  15. Hybrid quantum-classical algorithms and error mitigation

    … for example, the search of the ground state, and simulation of the dynamics of quan- tum systems. In addition, near-term quantum devices are expected to be quite noisy, impairing the precision of computation seriously and removing any potential advantages with quantum computers. Therefore, it is …

    oxford Repository record for Hybrid quantum-classical algorithms and error mitigation (opens in a new tab)

  16. THEORETICAL AND PRACTICAL HIGH-ASSURANCE SOFTWARE TOOLS FOR QUANTUM APPLICATIONS

    … problems like factorization and quantum system simulation. Harnessing the power of quantum computers in real life cannot happen without a supportive software stack. This thesis studies the fundamental problems appearing in the software for quantum computing to shed light on shaping software that …

    maryland Repository record for THEORETICAL AND PRACTICAL HIGH-ASSURANCE SOFTWARE TOOLS FOR QUANTUM APPLICATIONS (opens in a new tab)

  17. Fundamental Physics at the Frontier of Noisy Quantum Computation}

    … several advancements in the use of quantum simulation and quantum information to probe fundamental physics. The first is in the use of quantum computers to simulate collisions in quantum field theories. Central to these simulations are new wavepacket preparation and time evolution techniques …

    washington Repository record for Fundamental Physics at the Frontier of Noisy Quantum Computation} (opens in a new tab)

  18. Synthetic data generation on noisy quantum computers

    … dissertation studies SDG algorithms in noiseless simulations. Most of these algorithms rely on an implicit design choice that has not previously been examined: the binary encoding that maps bitstring samples generated by a quantum circuit to real-valued data points. We show that the training …

    freiburg-diss Repository record for Synthetic data generation on noisy quantum computers (opens in a new tab)

  19. Quantum Simulation Algorithms with Applications to Quantum Error Correction and Topological Data Analysis

    … presents three results of relevance to the simulation of quantum dynamics on quantum computers. The first is the development of hybridized methods of quantum simulation with Alessandro Roggero and Nathan Wiebe. Conventional methods of quantum simulation, such as qDRIFT, Trotterization, and …

    washington Repository record for Quantum Simulation Algorithms with Applications to Quantum Error Correction and Topological Data Analysis (opens in a new tab)

Page 1 of 2