Steering random spin systems to speed up the quantum adiabatic algorithm
arXiv:1804.01180 · doi:10.1103/PhysRevA.98.062311
Abstract
A general time-dependent quantum system can be driven fast from its initial ground state to its final ground state without generating transitions by adding a steering term to the Hamiltonian. We show how this technique can be modified to improve on the standard quantum adiabatic algorithm by making a single-particle and cluster approximation to the steering term. The method is applied to a one-dimensional Ising model in a random field. For the limit of strong disorder, the correction terms significantly enhance the probability for the whole system to remain in the ground state for the proposed non-stoquastic annealing protocol. We demonstrate that even when transitions occur for stronger interaction between qubits, the most probable quantum state is one of the lower energy states of the final Hamiltonian. Since the method can be applied to any model, and more sophisticated approximations to the steering term are possible, the new technique opens up an avenue for the improvement of the quantum adiabatic algorithm.
arXiv commentTo appear
References in corpus (27)
- Ising formulations of many NP problems
- Quantum Annealing in the Transverse Ising Model
- QuTiP 2: A Python framework for the dynamics of open quantum systems
- QuTiP: An open-source Python framework for the dynamics of open quantum systems
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Quantum annealing with more than one hundred qubits
- Shortcuts to adiabaticity by counter-diabatic driving
- Universality of Phase Transition Dynamics: Topological Defects from Symmetry Breaking
- Assisted finite-rate adiabatic passage across a quantum critical point: Exact solution for the quantum Ising model
- Experimental signature of programmable quantum annealing
- Minimizing irreversible losses in quantum systems by local counter-diabatic driving
- Randomized benchmarking and process tomography for gate errors in a solid-state qubit
- A Rydberg blockade CNOT gate and entanglement in a 2D array of neutral atom qubits
- Observation of topological transitions in interacting quantum circuits
- Measuring a topological transition in an artificial spin 1/2 system
- Adiabatic tracking of quantum many-body dynamics
- Transitionless quantum driving for spin systems
- Nonstoquastic Hamiltonians and Quantum Annealing of an Ising Spin Glass
- Dynamical Quantum Hall Effect in the Parameter Space
- Adiabatic theorems for generators of contracting evolutions
- Shortcuts to adiabaticity for quantum annealing
- Quantum response of dephasing open systems
- Non-Stoquastic Interactions in Quantum Annealing via the Aharonov-Anandan Phase
- Controlling quantum critical dynamics of isolated systems
- Nonadiabatic Dynamics of a Dissipative Two-level System
- Entanglement of distinguishable quantum memories
- Inhomogeneous quasi-adiabatic driving of quantum critical dynamics in weakly disordered spin chains
Cited by in corpus (23)
- Shortcuts to Adiabaticity in Digitized Adiabatic Quantum Computing
- Digitized-counterdiabatic quantum approximate optimization algorithm
- Portfolio Optimization with Digitized-Counterdiabatic Quantum Algorithms
- Controlling and exploring quantum systems by algebraic expression of adiabatic gauge potential
- Rapid counter-diabatic sweeps in lattice gauge adiabatic quantum computing
- Performance Evaluation of Adiabatic Quantum Computation via Quantum Speed Limits and Possible Applications to Many-Body Systems
- Quantum Approximate Optimization Algorithm with Adaptive Bias Fields
- Hamiltonian engineering for adiabatic quantum computation: Lessons from shortcuts to adiabaticity
- De-Signing Hamiltonians for Quantum Adiabatic Optimization
- Greedy parameter optimization for diabatic quantum annealing
- Numerical Gate Synthesis for Quantum Heuristics on Bosonic Quantum Processors
- Solution of SAT Problems with the Adaptive-Bias Quantum Approximate Optimization Algorithm
- Counterdiabatic Reverse Annealing
- Quantum Annealing with Trigger Hamiltonians: Application to 2-SAT and Nonstoquastic Problems
- Speedup of the Quantum Adiabatic Algorithm using Delocalization Catalysis
- Qutrit Circuits and Algebraic Relations: A Pathway to Efficient Spin-1 Hamiltonian Simulation
- Quantum annealing for hard 2-SAT problems : Distribution and scaling of minimum energy gap and success probability
- Effective spin models of Kerr-nonlinear parametric oscillators for quantum annealing
- Optimal protocols for finite-duration quantum quenches in the Luttinger model
- Enhancing Quantum Annealing in Digital-Analog Quantum Computing
- Iterative classical superadiabatic algorithm for combinatorial optimization
- Dynamics of qudit gates and effects of spectator modes on optimal control pulses
- Effects of Graph Network Connections on The Efficiency of Quantum Annealing