arXiv:2010.12334

Dynamical replica analysis of quantum annealing

A C C Coolen, T Nikoletopoulos

Published Oct 23, 2020• 0 citations

Abstract

Quantum annealing aims to provide a faster method for finding the minima of complicated functions, compared to classical computing, so there is an increasing interest in the relaxation dynamics of quantum spin systems. Moreover, it is known that problems in quantum annealing caused by first order phase transitions can be reduced via appropriate temporal adjustment of control parameters, aimed at steering the system away from local minima. To do this optimally, it would be helpful to predict the evolution of the system at the level of macroscopic observables. Solving the dynamics of a quantum ensemble is nontrivial, as it requires modelling not just the quantum spin system itself but also its interaction with the environment, with which it exchanges energy. An interesting alternative approach to the dynamics of quantum spin systems was proposed about a decade ago. It involves creating a stochastic proxy dynamics via the Suzuki-Trotter mapping of the quantum ensemble to a classical one (the quantum Monte Carlo method), and deriving from this new dynamics closed macroscopic equations for macroscopic observables, using the dynamical replica method. In this chapter we give an introduction to this approach, focusing on the ideas and assumptions behind the derivations, and on its potential and limitations.

DOI: 10.48550/arxiv.2010.12334

Related papers

Dynamical Analysis of Quantum Annealing

A C C Coolen, T Nikoletopoulos, Shunta Arai +1 more

Abstract Quantum annealing aims to provide a faster method than classical computing for finding the minima of complicated functions, and it has created increasing interest in the relaxation dynamics of quantum spin systems. Moreover, problems in quantum annealing caused by first-order phase transitions can be reduced via appropriate temporal adjustment of control parameters, and in order to do this optimally, it is helpful to predict the evolution of the system at the level of macroscopic observables. Solving the dynamics of quantum ensembles is nontrivial, requiring modeling of both the quantum spin system and its interaction with the environment with which it exchanges energy. An alternative approach to the dynamics of quantum spin systems was proposed about a decade ago. It involves creating stochastic proxy dynamics via the Suzuki-Trotter mapping of the quantum ensemble to a classical one (the quantum Monte Carlo method), and deriving from this new dynamics closed macroscopic equations for macroscopic observables using the dynamical replica method. In this chapter, we give an introduction to this approach, focusing on the ideas and assumptions behind the derivations, and on its potential and limitations.

Springer eBooksOct 19, 20210 citations

Quantum annealing: A new method for minimizing multidimensional functions

A B Finnila, M A Gomez, C. Sebenik +2 more

Abstract Quantum Monte Carlo has found a new application far afield from the solution of the Schrodinger equation for many-body problems. In this paper the authors report a method for solving multidimensional optimization problems that is superior, in many cases, to other methods such as conjugate gradient methods, the simplex method, direction-set methods, genetic methods, and classical simulated annealing. The new approach, aptly titled “quantum annealing,” is closely related to classical annealing, in which a physical system such as a metal cluster is slowly cooled and finds its lowest-energy configuration as the temperature drops to zero. In classical annealing the system follows classical-mechanical dynamics as the temperature drops. In quantum annealing a collection of configurations evolves in the the same way as walkers undergoing diffusion and multiplication in diffusion QMC with the added feature of a slowly dropping value for Planck’s constant h. Classical annealing allows the escape from local minima with the aid of thermal fluctuations. Quantum annealing allows such escape by delocalization and tunneling. Since a QMC walker can multiply in number on entering a low-energy region, a single walker can populate an entire region.

Jun 18, 200723 citations

Deterministic flows of order-parameters in stochastic processes of quantum Monte Carlo method

Jun-ichi Inoue

In terms of the stochastic process of quantum-mechanical version of Markov chain Monte Carlo method (the MCMC), we analytically derive macroscopically deterministic flow equations of order parameters such as spontaneous magnetization in infinite-range ( d (= ∞ )-dimensional) quantum spin systems. By means of the Trotter decomposition, we consider the transition probability of Glauber-type dynamics of microscopic states for the corresponding ( d + 1)-dimensional classical system. Under the static approximation, differential equations with respect to macroscopic order parameters are explicitly obtained from the master equation that describes the microscopic-law. In the steady state, we show that the equations are identical to the saddle point equations for the equilibrium state of the same system. The equation for the dynamical Ising model is recovered in the classical limit. We also check the validity of the static approximation by making use of computer simulations for finite size systems and discuss several possible extensions of our approach to disordered spin systems for statistical-mechanical informatics. Especially, we shall use our procedure to evaluate the decoding process of Bayesian image restoration. With the assistance of the concept of dynamical replica theory (the DRT), we derive the zero-temperature flow equation of image restoration measure showing some 'non-monotonic' behaviour in its time evolution.

arXiv:1004.2943Journal of Physics Conference SeriesJun 1, 20106 citations

Mathematical foundation of quantum annealing

Satoshi Morita, Hidetoshi Nishimori

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 following the Schrödinger or stochastic (Monte Carlo) dynamics. It is proved that the same asymptotic behavior of the control parameter guarantees convergence for both the Schrödinger dynamics and the stochastic dynamics in spite of the essential difference of these two types of dynamics. Also described are the prescriptions to reduce errors in the final approximate solution obtained after a long but finite dynamical evolution of quantum annealing. It is shown there that we can reduce errors significantly by an ingenious choice of annealing schedule (time dependence of the control parameter) without compromising computational complexity qualitatively. A review is given on the derivation of the convergence condition for classical simulated annealing from the view point of quantum adiabaticity using a classical-quantum mapping.

arXiv:0806.1859Journal of Mathematical PhysicsDec 1, 2008380 citations

Study of Optimization Problems by Quantum Annealing

Tadashi Kadowaki

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 transverse Ising model and the traveling salesman problem (TSP). Adding the transverse field to the Ising model is a simple way to introduce quantum fluctuations. The strength of the transverse field is controlled as a function of time similarly to the temperature in the conventional method. TSP can be described by the Ising spin, so that we also apply the same technique to TSP. We directory solve the time-dependent Schrödinger equation for small-size systems and perform the quantum Monte Carlo simulation for large-size systems. Comparison with the results of the corresponding classical (thermal) method reveals that the quantum method leads to the ground state with much larger probability in almost all cases if we use the same annealing schedule of the control parameters. We also find that the relaxation time is quite short for quantum systems by numerical simulations. We consider this is one of the reasons why the annealing in quantum systems have a better performance of finding the optimal state in comparison with classical systems.

arXiv:quant-ph/0205020May 5, 200239 citations

Quantum Spin Glasses, Annealing and Computation

Shu Tanaka, Ryo Tamura, Bikas K. Chakrabarti

Quantum annealing is a new-generation tool of information technology, which helps in solving combinatorial optimization problems with high precision, based on the concepts of quantum statistical physics. Detailed discussion on quantum spin glasses and its application in solving combinatorial optimization problems is required for better understanding of quantum annealing concepts. Fulfilling this requirement, the book highlights recent development in quantum spin glasses including Nishimori line, replica method and quantum annealing methods along with the essential principles. Separate chapters on simulated annealing, quantum dynamics and classical spin models are provided for enhanced learning. Important topics including adiabatic quantum computers and quenching dynamics are discussed in detail. This text will be useful for students of quantum computation, quantum information, statistical physics and computer science.

May 4, 201775 citations