Adiabatic quantum state generation and statistical zero knowledge
From MaRDI portal
Abstract: The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quantum state generation'. This approach provides intriguing links between many different areas: quantum computation, adiabatic evolution, analysis of spectral gaps and groundstates of Hamiltonians, rapidly mixing Markov chains, the complexity class statistical zero knowledge, quantum random walks, and more. We first show that many natural candidates for quantum algorithms can be cast as a state generation problem. We define a paradigm for state generation, called 'adiabatic state generation' and develop tools for adiabatic state generation which include methods for implementing very general Hamiltonians and ways to guarantee non negligible spectral gaps. We use our tools to prove that adiabatic state generation is equivalent to state generation in the standard quantum computing model, and finally we show how to apply our techniques to generate interesting superpositions related to Markov chains.
Recommendations
Cited in
(52)- Quantum algorithm for linear differential equations with exponentially improved dependence on precision
- Quantum algorithm design: techniques and applications
- Efficient quantum algorithm for similarity measures for molecules
- Quantum walks: a comprehensive review
- Image classification based on quantum K-nearest-neighbor algorithm
- Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems
- A survey on HHL algorithm: from theory to application in quantum machine learning
- Quantum science and quantum technology
- Simple digital quantum algorithm for symmetric first-order linear hyperbolic systems
- Approximating ground and excited state energies on a quantum computer
- Complexity of quantum impurity problems
- Quantum computation and quantum information
- Quantum algorithm for preparing the ground state of a physical system through multi-step quantum resonant transitions
- Duality quantum computer and the efficient quantum simulations
- Efficient quantum circuits for continuous-time quantum walks on composite graphs
- scientific article; zbMATH DE number 5989818 (Why is no real title available?)
- A Trotter-Suzuki approximation for Lie groups with applications to Hamiltonian simulation
- On the efficiency of quantum algorithms for Hamiltonian simulation
- Efficient quantum algorithms for state measurement and linear algebra applications
- Multiple network alignment on quantum computers
- Bounding the costs of quantum simulation of many-body physics in real space
- A complete characterization of unitary quantum space
- Quantum walk sampling by growing seed sets
- The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation
- Quantum lower bounds for approximate counting via Laurent polynomials
- A Quantum Implementation Model for Artificial Neural Networks
- Quantum algorithm for simulating real time evolution of lattice Hamiltonians
- Optimization of quantum Hamiltonian evolution: from two projection operators to local Hamiltonians
- Product formulas for exponentials of commutators
- Adiabatic Quantum State Generation
- Exponentially more precise quantum simulation of fermions in second quantization
- Mathematical etudes on quantum computation
- Improvement of quantum walks search algorithm in single-marked vertex graph
- An efficient quantum algorithm for spectral estimation
- Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians
- On the relationship between continuous- and discrete-time quantum walk
- A study of heuristic guesses for adiabatic quantum computation
- Quantum computation: algorithms and applications
- Mind the gap: achieving a super-Grover quantum speedup by jumping to the end
- Divide and conquer approach to quantum Hamiltonian simulation
- Quantum algorithms for multiscale partial differential equations
- Existence and uniqueness of solutions of the Koopman-von Neumann equation on bounded domains
- An introduction to quantum computing for statisticians and data scientists
- A quantum walk-assisted approximate algorithm for bounded NP optimisation problems
- QuTiP 5: The quantum toolbox in Python
- Selection and improvement of product formulae for best performance of quantum simulation
- Unbounded quantum-classical separation in sample complexity for sphere center finding
- Quantum lower bounds by sample-to-query lifting
- Noncontextual Pauli Hamiltonians
- An enhanced hybrid HHL algorithm
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Statistical zero knowledge and quantum one-way functions
This page was built for publication: Adiabatic quantum state generation and statistical zero knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581286)
