Mathematical foundation of quantum annealing

  title={Mathematical foundation of quantum annealing},
  author={Satoshi Morita and Hidetoshi Nishimori},
  journal={Journal of Mathematical Physics},
Quantum annealing is a generic name of quantum algorithms that use quantum-mechanical fluctuations to search for the solution of an optimization problem. It shares the basic idea with quantum adiabatic evolution studied actively in quantum computation. The present paper reviews the mathematical and theoretical foundations of quantum annealing. In particular, theorems are presented for convergence conditions of quantum annealing to the target optimal state after an infinite-time evolution… 

Figures from this paper

Simulated quantum annealing as a simulator of nonequilibrium quantum dynamics
Simulated quantum annealing based on the path-integral Monte Carlo is one of the most common tools to simulate quantum annealing on classical hardware. Nevertheless, it is in principle highly
Statistical Analysis of Quantum Annealing
Quantum computers use quantum resources to carry out computational tasks and may outperform classical computers in solving certain computational problems. Specialpurpose quantum computers such as
An introduction to quantum annealing
This survey paper illustrates how hard combinatorial problems are tackled by quantum computation and presents some examples of the heuristics provided by quantum annealing.
Comparative study of the performance of quantum annealing and simulated annealing.
It is pointed out that the present mapping can be extended to accommodate explicit time dependence of temperature, which is used to justify the quantum-mechanical analysis of simulated annealing by Somma, Batista, and Ortiz.
Dynamics of open quantum systems by interpolation of von Neumann and classical master equations, and its application to quantum annealing
We propose a method to interpolate dynamics of von Neumann and classical master equations with an arbitrary mixing parameter to investigate the thermal effects in quantum dynamics. The two dynamics
Performance of quantum annealing in solving optimization problems: A review
Quantum annealing is one of the optimization method for generic optimization problems. It uses quantum mechanics and is implemented by a quantum computer ideally. At the earlier stage, several
Fast quantum methods for optimization
Discrete combinatorial optimization consists in finding the optimal configuration that minimizes a given discrete objective function. An interpretation of such a function as the energy of a classical
Nonequilibrium work performed in quantum annealing
Quantum annealing is a generic solver of classical optimization problems that makes full use of quantum fluctuations. We consider work statistics given by a repetition of quantum annealing processes
Quantum Monte Carlo simulation of a particular class of non-stoquastic Hamiltonians in quantum annealing
  • M. Ohzeki
  • Physics, Mathematics
    Scientific reports
  • 2017
This study proposes an alternative way to avoid the negative sign problem involved in a particular class of the non-stoquastic Hamiltonians, and demonstrates the validity of the method by applying it to a simple problem that includes the anti-ferromagnetic XX interaction.
Greedy parameter optimization for diabatic quantum annealing
A shorter processing time is desirable for quantum computation to minimize the effects of noise. We propose a simple procedure to variationally determine a set of parameters in the transverse-field


Convergence of Quantum Annealing with Real-Time Schrodinger Dynamics(General)
Convergence conditions for quantum annealing are derived for optimization problems represented by the Ising model of a general form. Quantum fluctuations are introduced as a transverse field and/or
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
Study of Optimization Problems by Quantum Annealing
We introduce quantum fluctuations into the simulated annealing process of optimization problems, aiming at faster convergence to the optimal state. The idea is tested by the two models, the
Quantum annealing in the transverse Ising model
We introduce quantum fluctuations into the simulated annealing process of optimization problems, aiming at faster convergence to the optimal state. Quantum fluctuations cause transitions between
Convergence theorems for quantum annealing
We prove several theorems to give sufficient conditions for convergence of quantum annealing, which is a protocol to solve generic optimization problems by quantum dynamics. In particular, the
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
Quantum approach to classical statistical mechanics.
A new approach to study the thermodynamic properties of d-dimensional classical systems by reducing the problem to the computation of ground state properties of a d- dimensional quantum model, which allows the scope of standard optimization methods by unifying them under a general framework.
Optimization by quantum annealing: Lessons from simple cases
We investigate the basic behavior and performance of simulated quantum annealing (QA) in comparison with classical annealing (CA). Three simple one-dimensional case study systems are considered:
Quantum search by local adiabatic evolution
The adiabatic theorem has been recently used to design quantum algorithms of a new kind, where the quantum computer evolves slowly enough so that it remains near its instantaneous ground state, which
Quantum annealing by the path-integral Monte Carlo method: The two-dimensional random Ising model
Quantum annealing was recently found experimentally in a disordered spin- magnet to be more effective than its classical, thermal counterpart. We use the random two-dimensional Ising model as a test