Prospects for Quantum Enhancement with Diabatic Quantum Annealing
arXiv:2008.09913 · doi:10.1038/s42254-021-00313-6
Abstract
We assess the prospects for algorithms within the general framework of quantum annealing (QA) to achieve a quantum speedup relative to classical state of the art methods in combinatorial optimization and related sampling tasks. We argue for continued exploration and interest in the QA framework on the basis that improved coherence times and control capabilities will enable the near-term exploration of several heuristic quantum optimization algorithms that have been introduced in the literature. These continuous-time Hamiltonian computation algorithms rely on control protocols that are more advanced than those in traditional ground-state QA, while still being considerably simpler than those used in gate-model implementations. The inclusion of coherent diabatic transitions to excited states results in a generalization called diabatic quantum annealing (DQA), which we argue for as the most promising route to quantum enhancement within this framework. Other promising variants of traditional QA include reverse annealing and continuous-time quantum walks, as well as analog analogues of parameterized quantum circuit ansatzes for machine learning. Most of these algorithms have no known (or likely to be discovered) efficient classical simulations, and in many cases have promising (but limited) early signs for the possibility of quantum speedups, making them worthy of further investigation with quantum hardware in the intermediate-scale regime. We argue that all of these protocols can be explored in a state-of-the-art manner by embracing the full range of novel out-of-equilibrium quantum dynamics generated by time-dependent effective transverse-field Ising Hamiltonians that can be natively implemented by, e.g., inductively-coupled flux qubits, both existing and projected at application scale.
A perspective/review. 26 pages, 6 figures
References in corpus (52)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Charge insensitive qubit design derived from the Cooper pair box
- Surface codes: Towards practical large-scale quantum computation
- Probing many-body dynamics on a 51-atom quantum simulator
- A Quantum Approximate Optimization Algorithm
- Universal computation by quantum walk
- Quantum Simulation of Antiferromagnetic Spin Chains in an Optical Lattice
- Exponential algorithmic speedup by quantum walk
- Bounds for the adiabatic approximation with applications to quantum computation
- Digital quantum simulation of fermionic models with a superconducting circuit
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- The XZZX Surface Code
- Simple proof of equivalence between adiabatic quantum computation and the circuit model
- Matchgates and classical simulation of quantum circuits
- Realizable Hamiltonians for Universal Adiabatic Quantum Computers
- Experimental implementation of an adiabatic quantum optimization algorithm
- How Powerful is Adiabatic Quantum Computation?
- Decoherence in adiabatic quantum computation
- Focus beyond quadratic speedups for error-corrected quantum advantage
- Towards Fault Tolerant Adiabatic Quantum Computation
- A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem
- Observation of classical-quantum crossover of 1/f flux noise and its paramagnetic temperature dependence
- Consistency Tests of Classical and Quantum Models for a Quantum Annealer
- Energy gaps in quantum first-order mean-field-like transitions: The problems that quantum annealing cannot solve
- Quantum annealing correction for random Ising problems
- Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
- Reexamining classical and quantum models for the D-Wave One processor
- The quantum adiabatic algorithm and scaling of gaps at first order quantum phase transitions
- Training a Binary Classifier with the Quantum Adiabatic Algorithm
- Accuracy vs run time in adiabatic quantum search
- Reverse quantum annealing of the -spin model with relaxation
- A Near-Term Quantum Computing Approach for Hard Computational Problems in Space Exploration
- Quantum annealing: the fastest route to quantum computation?
- Programmable Quantum Annealing Architectures with Ising Quantum Wires
- Adiabatic Markovian Dynamics
- Quantum annealing correction at finite temperature: ferromagnetic -spin models
- Tunneling spectroscopy using a probe qubit
- Why and when is pausing beneficial in quantum annealing?
- Comparison of QAOA with Quantum and Simulated Annealing
- Scalable Superconducting Architecture for Adiabatic Quantum Computation
- Comparing relaxation mechanisms in quantum and classical transverse-field annealing
- Optimally Stopped Optimization
- Quantum-Assisted Genetic Algorithm
- Free energy-based reinforcement learning using a quantum processor
- What do QAOA energies reveal about graphs?
- Decoherence induced deformation of the ground state in adiabatic quantum computation
- Can quantum Monte Carlo simulate quantum annealing?
- Optimal quantum control with digitized Quantum Annealing
- Sensitivity of quantum speedup by quantum annealing to a noisy oracle
- Stoquastic simulations of non-stoquastic superconducting flux circuits
- Nonadiabatic Quantum Annealing for One-Dimensional Trasverse-Field Ising Model
- Robust universal Hamiltonian quantum computing using two-body interactions
Cited by in corpus (78)
- Hybrid quantum-classical algorithms in the noisy intermediate-scale quantum era and beyond
- Biology and medicine in the landscape of quantum advantages
- 3-Regular 3-XORSAT Planted Solutions Benchmark of Classical and Quantum Heuristic Optimizers
- NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems
- Completely Quantum Neural Networks
- Designing Quantum Annealing Schedules using Bayesian Optimization
- Scaling Advantage in Approximate Optimization with Quantum Annealing
- Adaptive variational simulation for open quantum systems
- Circumventing superexponential runtimes for hard instances of quantum adiabatic optimization
- Standard quantum annealing outperforms adiabatic reverse annealing with decoherence
- Search range in experimental quantum annealing
- Many-body localization enables iterative quantum optimization
- Lower Bounds on Quantum Annealing Times
- Breakdown of the weak coupling limit in quantum annealing
- Atomic Quantum Technologies for Quantum Matter and Fundamental Physics Applications
- Quantum algorithms for scientific computing
- Quantum support vector machines for aerodynamic classification
- Counterdiabatic Reverse Annealing
- Diabatic Quantum Annealing for the Frustrated Ring Model
- Hybrid actor-critic algorithm for quantum reinforcement learning at CERN beam lines
- Customized quantum annealing schedules
- Fluctuation guided search in quantum annealing
- Quantum annealing for hard 2-SAT problems : Distribution and scaling of minimum energy gap and success probability
- Quantum adiabatic optimization with Rydberg arrays: localization phenomena and encoding strategies
- Effectiveness of quantum annealing for continuous-variable optimization
- Deep learning optimal quantum annealing schedules for random Ising models
- Polynomial scaling enhancement in ground-state preparation of Ising spin models via counter-diabatic driving
- A comparison between D-wave and a classical approximation algorithm and a heuristic for computing the ground state of an Ising spin glass
- Ising Machines for Diophantine Problems in Physics
- Stoquasticity in circuit QED
- A QUBO model of the RNA folding problem optimized by variational hybrid quantum annealing
- Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms
- Phase transitions in the frustrated Ising ladder with stoquastic and nonstoquastic catalysts
- Locally Suppressed Transverse-Field Protocol for Diabatic Quantum Annealing
- Theoretical survey of unconventional quantum annealing methods applied to adifficult trial problem
- Demonstration of long-range correlations via susceptibility measurements in a one-dimensional superconducting Josephson spin chain
- Quantum technologies for climate change: Preliminary assessment
- Counterdiabatic Driving with Performance Guarantees
- Why adiabatic quantum annealing is unlikely to yield speed-up
- Rapid quantum approaches for combinatorial optimisation inspired by optimal state-transfer
- Eigenvalue-invariant transformation of Ising problem for anti-crossing mitigation in quantum annealing
- A numerical approach for calculating exact non-adiabatic terms in quantum dynamics
- From quantum-enhanced to quantum-inspired Monte Carlo
- Mixed-Integer Programming Using a Bosonic Quantum Computer
- Grover Speedup from Many Forms of the Zeno Effect
- Convergence condition of simulated quantum annealing for closed and open systems
- Speeding up Quantum Annealing with Engineered Dephasing
- Load Balancing For High Performance Computing Using Quantum Annealing
- Quantum computing for data science
- Noisy Demkov-Kunike model
- Zeno-effect Computation: Opportunities and Challenges
- Continuous-time quantum optimisation without the adiabatic principle
- Quantum walk in a reinforced free-energy landscape: Quantum annealing with reinforcement
- Entanglement-assisted variational algorithm for discrete optimization problems
- Diabatic quantum and classical annealing of the Sherrington-Kirkpatrick model
- Using copies to improve precision in continuous-time quantum computing
- Deep Unfolded Local Quantum Annealing
- Hamiltonian singular value transformation and inverse block encoding
- Performance of Domain-Wall Encoding for Quantum Annealing
- Optimal solutions to quantum annealing using two independent control functions
- Limits of Short-Time Evolution of Local Hamiltonians
- Hardness-dependent quantum adiabatic schedules for the maximum-independent-set problem
- Optimized adiabatic-impulse protocol preserving Kibble-Zurek scaling with attenuated anti-Kibble-Zurek behavior
- Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios
- QTIS: A QAOA-Based Quantum Time Interval Scheduler
- Validity condition for high-fidelity Digitized Quantum Annealing
- Noise Effects on Diabatic Quantum Annealing Protocols
- Quantum Annealing Algorithms for Estimating Ising Partition Functions
- Convergence condition of simulated quantum annealing with a non-stoquastic catalyst
- Finite temperature quantum condensations in the space of states: a new perspective for quantum annealing
- Frustration-enhanced quantum annealing correction models with additional inter-replica interactions
- Quantum Advantage for All
- Families of 2D subsystem stabilizer codes for universal Hamiltonian quantum computation with two-body interactions
- Essentiality of the Non-stoquastic Hamiltonians and Driver Graph Design in Quantum Optimization Annealing
- Testing Quantum and Simulated Annealers on the Drone Delivery Packing Problem
- Hidden local adiabatic ramp in the modulated time evolution and the quantum approximate optimization algorithm
- Adiabatic Dynamics of Entanglement
- Quantum annealing and condensed matter physics