Schedule path optimization for quantum annealing and adiabatic quantum computing
arXiv:1505.00209 · doi:10.1088/1751-8113/49/16/165305
Abstract
Adiabatic quantum computing and optimization have garnered much attention recently as possible models for achieving a quantum advantage over classical approaches to optimization and other special purpose computations. Both techniques are probabilistic in nature and the minimum gap between the ground state and first excited state of the system during evolution is a major factor in determining the success probability. In this work we investigate a strategy for increasing the minimum gap and success probability by introducing intermediate Hamiltonians that modify the evolution path between initial and final Hamiltonians. We focus on an optimization problem relevant to recent hardware implementations and present numerical evidence for the existence of a purely local intermediate Hamiltonian that achieve the optimum performance in terms of pushing the minimum gap to one of the end points of the evolution. As a part of this study we develop a convex optimization formulation of the search for optimal adiabatic schedules that makes this computation more tractable, and which may be of independent interest. We further study the effectiveness of random intermediate Hamiltonians on the minimum gap and success probability, and empirically find that random Hamiltonians have a significant probability of increasing the success probability, but only by a modest amount.
arXiv comment~10 pages
References in corpus (29)
- Quantum Annealing in the Transverse Ising Model
- Quantum annealing with more than one hundred qubits
- Ground state overlap and quantum phase transitions
- Quantum Annealing and Analog Quantum Computation
- Shortcuts to adiabaticity
- Quantum Search by Local Adiabatic Evolution
- Bounds for the adiabatic approximation with applications to quantum computation
- Coherent electronic transfer in quantum dot systems using adiabatic passage
- Anderson localization casts clouds over adiabatic quantum optimization
- Simple proof of equivalence between adiabatic quantum computation and the circuit model
- Inconsistency in the application of the adiabatic theorem
- Error corrected quantum annealing with hundreds of qubits
- Realizable Hamiltonians for Universal Adiabatic Quantum Computers
- First order phase transition in the Quantum Adiabatic Algorithm
- Quantum Adiabatic Brachistochrone
- Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
- Towards Fault Tolerant Adiabatic Quantum Computation
- First Order Quantum Phase Transition in Adiabatic Quantum Computation
- Quantum annealing correction for random Ising problems
- Intrinsic geometry of quantum adiabatic evolution and quantum phase transitions
- General error estimate for adiabatic quantum computing
- Adiabatic quantum optimization with the wrong Hamiltonian
- Band Gap Optimization of Two-Dimensional Photonic Crystals Using Semidefinite Programming and Subspace Methods
- Heavy tails in the distribution of time-to-solution for classical and quantum annealing
- Improved Error Bounds for the Adiabatic Approximation
- Exploring adiabatic quantum trajectories via optimal control
- High Fidelity Adiabatic Quantum Computation via Dynamical Decoupling
- The relationship between minimum gap and success probability in adiabatic quantum computing
- Probing nonlinear adiabatic paths with a universal integrator
Cited by in corpus (18)
- Adiabatic Quantum Computing
- Non-Stoquastic Interactions in Quantum Annealing via the Aharonov-Anandan Phase
- Quantum-Informed Recursive Optimization Algorithms
- Lyapunov control-inspired strategies for quantum combinatorial optimization
- Robust Quantum Control for Adiabatic Quantum Computation
- Diabatic Quantum Annealing for the Frustrated Ring Model
- Quantum Annealing with Trigger Hamiltonians: Application to 2-SAT and Nonstoquastic Problems
- Guided quantum walk
- Quantum annealing for hard 2-SAT problems : Distribution and scaling of minimum energy gap and success probability
- Non-Adiabatic Quantum Optimization for Crossing Quantum Phase Transitions
- Rapid quantum approaches for combinatorial optimisation inspired by optimal state-transfer
- Hard instance learning for quantum adiabatic prime factorization
- Quantum annealing sampling with a bias field
- Implementing transferable annealing protocols for combinatorial optimisation on neutral atom quantum processors: a case study on smart-charging of electric vehicles
- Quantum adiabatic optimization without heuristics
- Unifying framework for quantum simulation algorithms for time-dependent Hamiltonian dynamics
- Graph Coloring via Quantum Optimization on a Rydberg-Qudit Atom Array
- Hybrid Real-Imaginary Time Evolution for Low-Depth Hamiltonian Simulation in Quantum Optimization