An energetic perspective on rapid quenches in quantum annealing

Abstract

There are well developed theoretical tools to analyse how quantum dynamics can solve computational problems by varying Hamiltonian parameters slowly, near the adiabatic limit. On the other hand, there are relatively few tools to understand the opposite limit of rapid quenches, as used in quantum annealing and (in the limit of infinitely rapid quenches) in quantum walks. In this paper, we develop several tools which are applicable in the rapid quench regime. Firstly, we analyse the energy expectation value of different elements of the Hamiltonian. From this, we show that monotonic quenches, where the strength of the problem Hamiltonian is consistently increased relative to fluctuation (driver) terms, will yield a better result on average than random guessing. Secondly, we develop methods to determine whether dynamics will occur locally under rapid quench Hamiltonians, and identify cases where a rapid quench will lead to a substantially improved solution. In particular, we find that a technique we refer to as "pre-annealing" can significantly improve the performance of quantum walks. We also show how these tools can provide efficient heuristic estimates for Hamiltonian parameters, a key requirement for practical application of quantum annealing.

arXiv commentPublished in PRX Quantum with minor differences under the title "Energetic perspective on rapid quenches in quantum annealing". 24+11 pages, 11 figures

References in corpus (62)

• Probing many-body dynamics on a 51-atom quantum simulator
• Quantum Annealing in the Transverse Ising Model
• Adiabatic Quantum Computing
• Quantum Computation and Decision Trees
• Spatial search by quantum walk
• Quantum Annealing: A New Method for Minimizing Multidimensional Functions
• Quantum Search by Local Adiabatic Evolution
• Quantum Computation by Adiabatic Evolution
• Bounds for the adiabatic approximation with applications to quantum computation
• Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
• Reverse Quantum Annealing Approach to Portfolio Optimization Problems
• The power of quantum systems on a line
• Error corrected quantum annealing with hundreds of qubits
• Consistency of the Adiabatic Theorem
• Optimizing Variational Quantum Algorithms using Pontryagin's Minimum Principle
• Error correcting codes for adiabatic quantum computation
• Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
• Towards Fault Tolerant Adiabatic Quantum Computation
• Prospects for Quantum Enhancement with Diabatic Quantum Annealing
• Quantum Annealing Applied to De-Conflicting Optimal Trajectories for Air Traffic Management
• Quantum Annealing Implementation of Job-Shop Scheduling
• Optimal Protocols in Quantum Annealing and QAOA Problems
• Zeno effect for quantum computation and control
• Reverse annealing for the fully connected $p$-spin model
• Quantum annealing correction for random Ising problems
• Modernizing Quantum Annealing using Local Searches
• Quantum Annealing Correction with Minor Embedding
• Adiabaticity in open quantum systems
• Quantum search by measurement
• Tunneling and speedup in quantum optimization for permutation-symmetric problems
• Dynamics of reverse annealing for the fully-connected $p$-spin model
• Circuit design for multi-body interactions in superconducting quantum annealing system with applications to a scalable architecture
• Forecasting financial crashes with quantum computing
• Improved Error-Scaling for Adiabatic Quantum State Transfer
• Different Strategies for Optimization Using the Quantum Adiabatic Algorithm
• Continuous quantum error correction by cooling
• A Direct Mapping of Max k-SAT and High Order Parity Checks to a Chimera Graph
• Adiabatic quantum optimization with the wrong Hamiltonian
• Flight Gate Assignment with a Quantum Annealer
• Nested Quantum Annealing Correction
• Stabilisers as a design tool for new forms of Lechner-Hauke-Zoller Annealer
• Quantum annealing with longitudinal bias fields
• Error suppression and error correction in adiabatic quantum computation II: non-equilibrium dynamics
• Maximum-Entropy Inference with a Programmable Annealer
• Quantum search with hybrid adiabatic-quantum walk algorithms and realistic noise
• Finding spin-glass ground states using quantum walks
• Adiabatic Quantum Algorithms for the NP-Complete Maximum-Weight Independent Set, Exact Cover and 3SAT Problems
• Improved Error Bounds for the Adiabatic Approximation
• The Power of Adiabatic Quantum Computation with No Sign Problem
• Different Adiabatic Quantum Optimization Algorithms for the NP-Complete Exact Cover and 3SAT Problems
• High Fidelity Adiabatic Quantum Computation via Dynamical Decoupling
• Scalable effective temperature reduction for quantum annealers via nested quantum annealing correction
• Finding a marked node on any graph by continuous-time quantum walk
• Error Reduction in Quantum Annealing using Boundary Cancellation: Only the End Matters
• Continuous quantum error correction for evolution under time-dependent Hamiltonians
• Fluctuation guided search in quantum annealing
• Irreconcilable Difference Between Quantum Walks and Adiabatic Quantum Computing
• Duality in Quantum Quenches and Classical Approximation Algorithms: Pretty Good or Very Bad
• Nonadiabatic Quantum Annealing for One-Dimensional Trasverse-Field Ising Model
• Decoding quantum error correction with Ising model hardware
• Error-run-time trade-off in the adiabatic approximation beyond scaling relations
• Stable quantum memories with limited measurement

Cited by in corpus (26)

• Hybrid quantum-classical algorithms in the noisy intermediate-scale quantum era and beyond
• Prospects for Quantum Enhancement with Diabatic Quantum Annealing
• Analytical Framework for Quantum Alternating Operator Ansätze
• Existence of replica-symmetry breaking in quantum glasses
• Search range in experimental quantum annealing
• Improved variational quantum eigensolver via quasi-dynamical evolution
• Guided quantum walk
• Fluctuation guided search in quantum annealing
• Continuous-time quantum walks for MAX-CUT are hot
• Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms
• The quantum annealing gap and quench dynamics in the exact cover problem
• Rapid quantum approaches for combinatorial optimisation inspired by optimal state-transfer
• Grover Speedup from Many Forms of the Zeno Effect
• Quantum optimization with linear Ising penalty functions for customer data science
• Quantum annealing sampling with a bias field
• Load Balancing For High Performance Computing Using Quantum Annealing
• Continuous-time quantum optimisation without the adiabatic principle
• Zeno-effect Computation: Opportunities and Challenges
• Using copies to improve precision in continuous-time quantum computing
• A thermodynamic approach to optimization in complex quantum systems
• Diabatic quantum and classical annealing of the Sherrington-Kirkpatrick model
• Quantum walk in a reinforced free-energy landscape: Quantum annealing with reinforcement
• Performance of Domain-Wall Encoding for Quantum Annealing
• Improving success probability in the LHZ parity embedding by computing with quantum walks
• Quantitative analysis of the effectiveness of mid-anneal measurement in quantum annealing
• Quantum annealing and condensed matter physics