The Quantum Adiabatic Algorithm applied to random optimization problems: the quantum spin glass perspective

  title={The Quantum Adiabatic Algorithm applied to random optimization problems: the quantum spin glass perspective},
  author={Victor Bapst and Laura Foini and Florent Krzakala and Guilhem Semerjian and Francesco Zamponi},
Among various algorithms designed to exploit the specific properties of quantum computers with respect to classical ones, the quantum adiabatic algorithm is a versatile proposition to find the minimal value of an arbitrary cost function (ground state energy). Random optimization problems provide a natural testbed to compare its efficiency with that of classical algorithms. These problems correspond to mean field spin glasses that have been extensively studied in the classical case. This paper… 
Quantum annealing: The fastest route to quantum computation?
In this review we consider the performance of the quantum adiabatic algorithm for the solution of decision problems. We divide the possible failure mechanisms into two sets: small gaps due to quantum
Dicke simulators with emergent collective quantum computational abilities.
Using an approach inspired from spin glasses, we show that the multimode disordered Dicke model is equivalent to a quantum Hopfield network. We propose variational ground states for the system at
Open system quantum annealing in mean field models with exponential degeneracy
Real life quantum computers are inevitably affected by intrinsic noise resulting in dissipative non-unitary dynamics realized by these devices. We consider an open system quantum annealing algorithm
Exponential vanishing of the ground-state gap of the quantum random energy model via adiabatic quantum computing
In this note, we use ideas of Farhi et al. [Int. J. Quantum. Inf. 6, 503 (2008) and Quantum Inf. Comput. 11, 840 (2011)] who link a lower bound on the run time of their quantum adiabatic search
Duality approach to quantum annealing of the 3-XORSAT problem
Classical models with complex energy landscapes represent a perspective avenue for the near-term application of quantum simulators. Until now, many theoretical works studied the performance of
Quantum algorithm for energy matching in hard optimization problems
We consider the ability of local quantum dynamics to solve the energy matching problem: given an instance of a classical optimization problem and a low energy state, find another macroscopically
Quantum annealing search of Ising spin glass ground state(s) with tunable transverse and longitudinal fields
Here we first discuss briefly the quantum annealing technique. We then study the quantum annealing of Sherrington-Kirkpatrick spin glass model with the tuning of both transverse and longitudinal
Enhancing the efficiency of quantum annealing via reinforcement: A path-integral Monte Carlo simulation of the quantum reinforcement algorithm
This work implements a local version of the quantum reinforcement algorithm, where the system wave function is replaced by an approximate wave function using the local expectation values of the system and uses this algorithm to find solutions to a prototypical constraint satisfaction problem (XORSAT) close to the satisfiability to unsatisfiability phase transition.
Optimal working point in dissipative quantum annealing
We study the effect of a thermal environment on the quantum annealing dynamics of a transverse-field Ising chain. The environment is modeled as a single Ohmic bath of quantum harmonic oscillators
Algorithms and Platforms for Quantum Science and Technology
It is demonstrated that optical resonances in ordered arrays of atoms and atomically thin semiconductors offer a powerful tool to control and manipulate light at both the classical and single-photon level and the robustness of adiabatic quantum algorithms are investigated, placing stringent requirements on noise induced by the environment.


Experimental implementation of an adiabatic quantum optimization algorithm.
A nuclear magnetic resonance computer with three quantum bits that simulates an adiabatic quantum optimization algorithm that agrees well with the prediction of a simple decoherence model is reported.
Noise resistance of adiabatic quantum computation using random matrix theory
Besides the traditional circuit-based model of quantum computation, several quantum algorithms based on a continuous-time Hamiltonian evolution have recently been introduced, including for instance
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
For the small examples that the authors could simulate, the quantum adiabatic algorithm worked well, providing evidence that quantum computers (if large ones can be built) may be able to outperform ordinary computers on hard sets of instances of NP-complete problems.
It is shown that poor choices for the Hamiltonian can guarantee that the quantum adiabatic algorithm will not find the minimum if the run time grows more slowly than .
Colloquium : Quantum annealing and analog quantum computation
The recent success in quantum annealing, i.e., optimization of the cost or energy functions of complex systems utilizing quantum fluctuations is reviewed here. The concept is introduced in successive
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation
It is suggested that the adiabatic computation model and the conventional quantum computation model are polynomially equivalent and this result can be extended to the physically realistic setting of particles arranged on a two-dimensional grid with nearest neighbor interactions.
CORRIGENDUM: Optimization using quantum mechanics: quantum annealing through adiabatic evolution
We review here some recent work in the field of quantum annealing, alias adiabatic quantum computation. The idea of quantum annealing is to perform optimization by a quantum adiabatic evolution which
Quantum stochastic optimization
We propose a combinatorial optimization procedure based on the physical idea of using the quantum tunnel effect to allow the search of global minima of a function of many Boolean variables to escape
Case studies in quantum adiabatic optimization
Quantum adiabatic optimization is a quantum algorithm for solving classical optimization problems (E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser. Quantum computation by adiabatic evolution, 2000.
Theory of Quantum Annealing of an Ising Spin Glass
By comparing classical and quantum Monte Carlo annealing protocols on the two-dimensional random Ising model (a prototype spin glass), this work confirms the superiority of quantumAnnealing relative to classical annealed and proposes a theory of quantum annealer based on a cascade of Landau-Zener tunneling events.