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 (207)
- 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
- Quantum Annealing in the Transverse Ising Model
- Decoherence Free Subspaces for Quantum Computation
- A Quantum Approximate Optimization Algorithm
- Adiabatic Quantum Computing
- Improved Simulation of Stabilizer Circuits
- Quantum Amplitude Amplification and Estimation
- Noiseless Quantum Codes
- Observation of a Many-Body Dynamical Phase Transition with a 53-Qubit Quantum Simulator
- Universal computation by quantum walk
- Many-body localization in a quantum simulator with programmable random disorder
- Quantum Simulation of Antiferromagnetic Spin Chains in an Optical Lattice
- A Rydberg Quantum Simulator
- Exponential algorithmic speedup by quantum walk
- Quantum Computational Supremacy
- Quantum annealing with more than one hundred qubits
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Theory of Quantum Annealing of an Ising Spin Glass
- Quantum Annealing and Analog Quantum Computation
- Quantum Annealing: A New Method for Minimizing Multidimensional Functions
- Quantum Search by Local Adiabatic Evolution
- Defining and detecting quantum speedup
- The Flux Qubit Revisited to Enhance Coherence and Reproducibility
- Quantum Computation by Adiabatic Evolution
- Perspectives of quantum annealing: Methods and implementations
- Robustness of adiabatic quantum computation
- Digitized adiabatic quantum computing with a superconducting circuit
- Emergence and Frustration of Magnetic Order with Variable-Range Interactions in a Trapped Ion Quantum Simulator
- Spin and Charge Resolved Quantum Gas Microscopy of Antiferromagnetic Order in Hubbard Chains
- Bounds for the adiabatic approximation with applications to quantum computation
- A generative modeling approach for benchmarking and training shallow quantum circuits
- Digital quantum simulation of fermionic models with a superconducting circuit
- Observation of topological phenomena in a programmable lattice of 1,800 qubits
- Architectural considerations in the design of a superconducting quantum annealing processor
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- Average-case complexity versus approximate simulation of commuting quantum computations
- Obstacles to State Preparation and Variational Optimization from Symmetry Protection
- Quantum Supremacy and the Complexity of Random Circuit Sampling
- Differentiable Learning of Quantum Circuit Born Machine
- Quantum Adiabatic Markovian Master Equations
- Experimental Investigation of an Eight Qubit Unit Cell in a Superconducting Optimization Processor
- Quantum Approximate Optimization of the Long-Range Ising Model with a Trapped-Ion Quantum Simulator
- The XZZX Surface Code
- Anderson localization casts clouds over adiabatic quantum optimization
- A quantum-inspired classical algorithm for recommendation systems
- Reverse Quantum Annealing Approach to Portfolio Optimization Problems
- A case study in programming a quantum annealer for hard operational planning problems
- Simple proof of equivalence between adiabatic quantum computation and the circuit model
- Adiabatic Quantum Computation in Open Systems
- Quantum Optimization of Fully-Connected Spin Glasses
- Matchgates and classical simulation of quantum circuits
- Demonstration of a scaling advantage for a quantum annealer over simulated annealing
- Error corrected quantum annealing with hundreds of qubits
- Support vector machines on the D-Wave quantum annealer
- Experimental Demonstration of a Robust and Scalable Flux Qubit
- Realizable Hamiltonians for Universal Adiabatic Quantum Computers
- Experimental implementation of an adiabatic quantum optimization algorithm
- Application of Quantum Annealing to Training of Deep Neural Networks
- Quantum Speedup by Quantum Annealing
- How Powerful is Adiabatic Quantum Computation?
- First order phase transition in the Quantum Adiabatic Algorithm
- Probing for quantum speedup in spin glass problems with planted solutions
- Quantum annealing versus classical machine learning applied to a simplified computational biology problem
- Tomography and Generative Data Modeling via Quantum Boltzmann Training
- Dynamical Generation of Noiseless Quantum Subsystems
- Decoherence in adiabatic quantum computation
- Searching for quantum speedup in quasistatic quantum annealers
- The Born Supremacy: Quantum Advantage and Training of an Ising Born Machine
- Reachability Deficits in Quantum Approximate Optimization
- Efficient multiphoton sampling of molecular vibronic spectra on a superconducting bosonic processor
- Scaling advantage in quantum simulation of geometrically frustrated magnets
- A Cluster Monte Carlo Algorithm for 2-Dimensional Spin Glasses
- Error correcting codes for adiabatic quantum computation
- Focus beyond quadratic speedups for error-corrected quantum advantage
- Near-optimal quantum circuit for Grover's unstructured search using a transverse field
- Nonnegative/binary matrix factorization with a D-Wave quantum annealer
- Probing the Universality of Topological Defect Formation in a Quantum Annealer: Kibble-Zurek Mechanism and Beyond
- 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
- Tunable Quantum Tunneling of Magnetic Domain Walls
- Consistency Tests of Classical and Quantum Models for a Quantum Annealer
- Optimal Protocols in Quantum Annealing and QAOA Problems
- Energy gaps in quantum first-order mean-field-like transitions: The problems that quantum annealing cannot solve
- Power of Pausing: Advancing Understanding of Thermalization in Experimental Quantum Annealers
- Quantum adiabatic machine learning
- First Order Quantum Phase Transition in Adiabatic Quantum Computation
- A scalable readout system for a superconducting adiabatic quantum optimization system
- Thermally assisted adiabatic quantum computation
- Strengths and weaknesses of weak-strong cluster problems: A detailed overview of state-of-the-art classical heuristics vs quantum approaches
- Reverse annealing for the fully connected -spin model
- Efficient Cluster Algorithm for Spin Glasses in Any Space Dimension
- Quantum annealing correction for random Ising problems
- Understanding Quantum Tunneling through Quantum Monte Carlo Simulations
- Coherent coupled qubits for quantum annealing
- Information Perspective to Probabilistic Modeling: Boltzmann Machines versus Born Machines
- Modernizing Quantum Annealing using Local Searches
- Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
- First-order transitions and the performance of quantum algorithms in random optimization problems
- Reexamining classical and quantum models for the D-Wave One processor
- Quantum Annealing Correction with Minor Embedding
- Adiabaticity in open quantum systems
- Quantum-assisted Helmholtz machines: A quantum-classical deep learning framework for industrial datasets in near-term devices
- The surface code with a twist
- A Coherent Quantum Annealer with Rydberg Atoms
- Decoherence in adiabatic quantum computation
- How "Quantum" is the D-Wave Machine?
- Training A Quantum Optimizer
- Quantum Adiabatic Evolution Algorithms versus Simulated Annealing
- Scaling and diabatic effects in quantum annealing with a D-Wave device
- Tunneling and speedup in quantum optimization for permutation-symmetric problems
- Benchmarking a quantum annealing processor with the time-to-target metric
- Clustering of conditional mutual information for quantum Gibbs states above a threshold temperature
- Dynamics of reverse annealing for the fully-connected -spin model
- Best-case performance of quantum annealers on native spin-glass benchmarks: How chaos can affect success probabilities
- The quantum adiabatic algorithm and scaling of gaps at first order quantum phase transitions
- Training a Binary Classifier with the Quantum Adiabatic Algorithm
- Coherence-Preserving Quantum Bits
- Accuracy vs run time in adiabatic quantum search
- A deceptive step towards quantum speedup detection
- Adiabatic theorems for generators of contracting evolutions
- Role of Single Qubit Decoherence Time in Adiabatic Quantum Computation
- Temperature scaling law for quantum annealing optimizers
- Demonstration of nonstoquastic Hamiltonian in coupled superconducting flux qubits
- Applying quantum algorithms to constraint satisfaction problems
- Adiabatic quantum optimization with the wrong Hamiltonian
- Reverse quantum annealing of the -spin model with relaxation
- On the Computational Complexity of Curing the Sign Problem
- Quantum-inspired low-rank stochastic regression with logarithmic dependence on the dimension
- Quantum annealing of the -spin model under inhomogeneous transverse field driving
- A Near-Term Quantum Computing Approach for Hard Computational Problems in Space Exploration
- Quantum annealing: the fastest route to quantum computation?
- Role of Non-stoquastic Catalysts in Quantum Adiabatic Optimization
- Nested Quantum Annealing Correction
- Boundaries of quantum supremacy via random circuit sampling
- Finite temperature quantum annealing solving exponentially small gap problem with non-monotonic success probability
- Programmable Quantum Annealing Architectures with Ising Quantum Wires
- Quantum search with hybrid adiabatic-quantum walk algorithms and realistic noise
- Classical and Quantum Bounded Depth Approximation Algorithms
- Adiabatic Markovian Dynamics
- Finding spin-glass ground states using quantum walks
- Quantum processor-inspired machine learning in the biomedical sciences
- Reexamination of the evidence for entanglement in the D-Wave processor
- QMA-complete problems for stoquastic Hamiltonians and Markov matrices
- Quantum annealing correction at finite temperature: ferromagnetic -spin models
- Analog Errors in Ising Machines
- Performance of two different quantum annealing correction codes
- The Power of Adiabatic Quantum Computation with No Sign Problem
- An energetic perspective on rapid quenches in quantum annealing
- Mean Field Analysis of Quantum Annealing Correction
- Classical algorithms, correlation decay, and complex zeros of partition functions of quantum many-body systems
- Tunneling spectroscopy using a probe qubit
- Why and when is pausing beneficial in quantum annealing?
- Error suppression for Hamiltonian-based quantum computation using subsystem codes
- Quantum Monte Carlo tunneling from quantum chemistry to quantum annealing
- Relation between quantum fluctuations and the performance enhancement of quantum annealing in a nonstoquastic Hamiltonian
- Comparison of QAOA with Quantum and Simulated Annealing
- Scalable Superconducting Architecture for Adiabatic Quantum Computation
- Relaxation vs. adiabatic quantum steady state preparation: which wins?
- Improved Boltzmann machines with error corrected quantum annealing
- Quantum Monte Carlo Simulations of Tunneling in Quantum Adiabatic Optimization
- Analog Nature of Quantum Adiabatic Unstructured Search
- Non-commuting two-local Hamiltonians for quantum error suppression
- Comparing relaxation mechanisms in quantum and classical transverse-field annealing
- Quantum supremacy and random circuits
- Adiabatic and Hamiltonian computing on a 2D lattice with simple 2-qubit interactions
- De-Signing Hamiltonians for Quantum Adiabatic Optimization
- Quantum adiabatic machine learning with zooming
- Optimally Stopped Optimization
- Nested Quantum Annealing Correction at Finite Temperature: -spin models
- Optimal working point in digitized quantum annealing
- Error Reduction in Quantum Annealing using Boundary Cancellation: Only the End Matters
- Necessary Adiabatic Run Times in Quantum Optimization
- Continuous quantum error correction for evolution under time-dependent Hamiltonians
- Ferromagnetically shifting the power of pausing
- Classical Ising model test for quantum circuits
- Free energy-based reinforcement learning using a quantum processor
- Quantum-Assisted Genetic Algorithm
- Quantum Speed-Up at Zero Temperature via Coherent Catalysis
- Error correcting Bacon-Shor code with continuous measurement of noncommuting operators
- What do QAOA energies reveal about graphs?
- Error Suppression for Hamiltonian Quantum Computing in Markovian Environments
- Decoherence induced deformation of the ground state in adiabatic quantum computation
- Superconducting qubit circuit emulation of a vector spin-1/2
- Anneal-path correction in flux qubits
- Can quantum Monte Carlo simulate quantum annealing?
- Arbitrary-time error suppression for Markovian adiabatic quantum computing using stabilizer subspace codes
- Optimal quantum control with digitized Quantum Annealing
- Unfolding as Quantum Annealing
- Quantum ground state isoperimetric inequalities for the energy spectrum of local Hamiltonians
- Sensitivity of quantum speedup by quantum annealing to a noisy oracle
- Simulations of the adiabatic quantum optimization for the Set Partition Problem
- Track clustering with a quantum annealer for primary vertex reconstruction at hadron colliders
- Duality in Quantum Quenches and Classical Approximation Algorithms: Pretty Good or Very Bad
- Effective gaps are not effective: quasipolynomial classical simulation of obstructed stoquastic Hamiltonians
- Exponential suppression of decoherence and relaxation of quantum systems using energy penalty
- Pulsed quantum annealing
- Quantum-assisted cluster analysis
- Quantum speedup in stoquastic adiabatic quantum computation
- Inhomogeneous driving in quantum annealers can result in orders-of-magnitude improvements in performance
- Stoquastic simulations of non-stoquastic superconducting flux circuits
- Gap-independent cooling and hybrid quantum-classical annealing
- Nonadiabatic Quantum Annealing for One-Dimensional Trasverse-Field Ising Model
- Robust universal Hamiltonian quantum computing using two-body interactions
Cited by in corpus (81)
- 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
- An energetic perspective on rapid quenches in quantum annealing
- Completely Quantum Neural Networks
- Designing Quantum Annealing Schedules using Bayesian Optimization
- Scaling Advantage in Approximate Optimization with Quantum Annealing
- Variationally Scheduled Quantum Simulation
- Adaptive variational simulation for open quantum systems
- Circumventing superexponential runtimes for hard instances of quantum adiabatic optimization
- Search range in experimental quantum annealing
- Many-body localization enables iterative quantum optimization
- Standard quantum annealing outperforms adiabatic reverse annealing with decoherence
- Lower Bounds on Quantum Annealing Times
- Quantum support vector machines for aerodynamic classification
- Atomic Quantum Technologies for Quantum Matter and Fundamental Physics Applications
- Breakdown of the weak coupling limit in quantum annealing
- Quantum algorithms for scientific computing
- Hybrid actor-critic algorithm for quantum reinforcement learning at CERN beam lines
- Counterdiabatic Reverse Annealing
- Diabatic Quantum Annealing for the Frustrated Ring Model
- Customized quantum annealing schedules
- Fluctuation guided search in quantum annealing
- Deep learning optimal quantum annealing schedules for random Ising models
- 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
- 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
- A QUBO model of the RNA folding problem optimized by variational hybrid quantum annealing
- Stoquasticity in circuit QED
- 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
- Counterdiabatic Driving with Performance Guarantees
- Rapid quantum approaches for combinatorial optimisation inspired by optimal state-transfer
- Quantum technologies for climate change: Preliminary assessment
- Why adiabatic quantum annealing is unlikely to yield speed-up
- Demonstration of long-range correlations via susceptibility measurements in a one-dimensional superconducting Josephson spin chain
- A numerical approach for calculating exact non-adiabatic terms in quantum dynamics
- Grover Speedup from Many Forms of the Zeno Effect
- From quantum-enhanced to quantum-inspired Monte Carlo
- Eigenvalue-invariant transformation of Ising problem for anti-crossing mitigation in quantum annealing
- Mixed-Integer Programming Using a Bosonic Quantum Computer
- Load Balancing For High Performance Computing Using Quantum Annealing
- Convergence condition of simulated quantum annealing for closed and open systems
- Quantum computing for data science
- Speeding up Quantum Annealing with Engineered Dephasing
- Continuous-time quantum optimisation without the adiabatic principle
- Zeno-effect Computation: Opportunities and Challenges
- Noisy Demkov-Kunike model
- Investigating the potential for a limited quantum speedup on protein lattice problems
- Quantum walk in a reinforced free-energy landscape: Quantum annealing with reinforcement
- Deep Unfolded Local Quantum Annealing
- 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
- 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
- Hamiltonian singular value transformation and inverse block encoding
- Quantum Annealing Algorithms for Estimating Ising Partition Functions
- Convergence condition of simulated quantum annealing with a non-stoquastic catalyst
- Optimized adiabatic-impulse protocol preserving Kibble-Zurek scaling with attenuated anti-Kibble-Zurek behavior
- QTIS: A QAOA-Based Quantum Time Interval Scheduler
- Noise Effects on Diabatic Quantum Annealing Protocols
- Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios
- Validity condition for high-fidelity Digitized Quantum Annealing
- Testing Quantum and Simulated Annealers on the Drone Delivery Packing Problem
- Adiabatic Dynamics of Entanglement
- Finite temperature quantum condensations in the space of states: a new perspective for quantum annealing
- Families of 2D subsystem stabilizer codes for universal Hamiltonian quantum computation with two-body interactions
- Hidden local adiabatic ramp in the modulated time evolution and the quantum approximate optimization algorithm
- Quantum annealing and condensed matter physics
- Essentiality of the Non-stoquastic Hamiltonians and Driver Graph Design in Quantum Optimization Annealing
- Frustration-enhanced quantum annealing correction models with additional inter-replica interactions
- Quantum Advantage for All