Quantum Adiabatic Evolution Algorithms with Different Paths
arXiv:quant-ph/0208135
Abstract
In quantum adiabatic evolution algorithms, the quantum computer follows the ground state of a slowly varying Hamiltonian. The ground state of the initial Hamiltonian is easy to construct; the ground state of the final Hamiltonian encodes the solution of the computational problem. These algorithms have generally been studied in the case where the "straight line" path from initial to final Hamiltonian is taken. But there is no reason not to try paths involving terms that are not linear combinations of the initial and final Hamiltonians. We give several proposals for randomly generating new paths. Using one of these proposals, we convert an algorithmic failure into a success.
9 pp., 2 eps figures, using LaTeX and BoxedEPS macros; email correspondence to [email protected]
References in corpus (1)
Cited by in corpus (34)
- Adiabatic Quantum Computing
- Towards Quantum Chemistry on a Quantum Computer
- Quantum computing for finance: overview and prospects
- Non-perturbative k-body to two-body commuting conversion Hamiltonians and embedding problem instances into Ising spins
- Training A Quantum Optimizer
- Different Strategies for Optimization Using the Quantum Adiabatic Algorithm
- Shortcuts to adiabaticity for quantum annealing
- Role of Non-stoquastic Catalysts in Quantum Adiabatic Optimization
- Low depth mechanisms for quantum optimization
- Adiabatic Quantum Algorithms for the NP-Complete Maximum-Weight Independent Set, Exact Cover and 3SAT Problems
- Adiabatic optimization versus diffusion Monte Carlo
- From quantum circuits to adiabatic algorithms
- Experimental implementation of local adiabatic evolution algorithms by an NMR quantum information processor
- Variationally Scheduled Quantum Simulation
- Local Hamiltonians in Quantum Computation
- A Random Matrix Model of Adiabatic Quantum Computing
- Quantum Register Physics
- Adiabatic quantum optimization in presence of discrete noise: Reducing the problem dimensionality
- Quantum Adiabatic Algorithm and Large Spin Tunnelling
- Irreconcilable Difference Between Quantum Walks and Adiabatic Quantum Computing
- On models of nonlinear evolution paths in adiabatic quantum algorithms
- Theoretical survey of unconventional quantum annealing methods applied to adifficult trial problem
- Why adiabatic quantum annealing is unlikely to yield speed-up
- Avoid First Order Quantum Phase Transition by Changing Problem Hamiltonians
- Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation
- Bifurcation-based quantum annealing with nested spins
- The performance of the quantum adiabatic algorithm on spike Hamiltonians
- Quantum Zeno approach for molecular energies with maximum commuting initialHamiltonians
- Quantum Adiabatic Computation and the Travelling Salesman Problem
- Quantum Annealing with chaotic driver Hamiltonians
- Ab initio nuclear structure via quantum adiabatic algorithm
- Total suppression of a large spin tunneling barrier in quantum adiabatic computation
- Accuracy of the quantum adiabatic theorem in its original form
- Multi-step quantum algorithm for solving the 3-bit exact cover problem