Quantum annealing: A new method for minimizing multidimensional functions

  title={Quantum annealing: A new method for minimizing multidimensional functions},
  author={Aleta Berk Finnila and M. A. Gomez and Craig Sebenik and Charles Stenson and Jimmie D. Doll},
  journal={Chemical Physics Letters},

Quantum path minimization: An efficient method for global optimization

A new unbiased global optimization approach is proposed, based on quantum staging path integral Monte Carlo sampling and local minimization of individual imaginary time slices. This algorithm uses

Quantum annealing – foundations and frontiers

We briefly review various computational methods for the solution of optimization problems. First, several classical methods such as Metropolis algorithm and simulated annealing are discussed. We

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

A comparison of classical and quantum annealing dynamics

Simulated annealing and quantum annealing are algorithms for combinatorial optimization problems. The former brings solutions using thermal fluctuations and through classical dynamics, while the

Quantum and classical annealing in a continuous space with multiple local minima

Abstract The protocol of quantum annealing is applied to an optimization problem with a one-dimensional continuous degree of freedom, a variant of the problem proposed by Shinomoto and Kabashima. The

An Overview of Approaches to Modernize Quantum Annealing Using Local Searches

This work explores strategies to use an annealer in a way which takes advantage of modern classical optimization algorithms, and additionally should be less sensitive to problem mis-specification then the traditional quantum annealing algorithm.

Theoretical survey of unconventional quantum annealing methods applied to adifficult trial problem.

We consider a range of unconventional modifications to Quantum Annealing (QA), applied to an artificial trial problem with continuously tunable difficulty. In this problem, inspired by "transverse

Quantum versus classical annealing of Ising spin glasses

The question of when quantum speedup may be expected is revisited and it is shown that the results depend on how the problem is described and how the optimization routine is implemented, which implies that care must be taken when using QMC simulations to assess the potential for quantum speed up.

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



Quantum Monte Carlo

An outline of a random walk computational method for solving the Schr�dinger equation for many interacting particles is given, together with a survey of results achieved so far and of applications

Reducing Quasi-Ergodic Behavior in Monte Carlo Simulations by J-Walking: Applications to Atomic Clusters

A method is introduced that is easy to implement and greatly reduces the systematic error resulting from quasi‐ergodicity, or incomplete sampling of configuration space, in Monte Carlo simulations of

Optimization by Simulated Annealing

A detailed analogy with annealing in solids provides a framework for optimization of the properties of very large and complex systems.

Physical cluster mechanics: Statics and energy surfaces for monatomic systems

Abstract The potential energy surfaces for clusters of some three to sixty atoms under Lennard-Jones forces have been systematically explored using numerical optimization techniques. In searching for

Mean field theory as a tool for intramolecular conformational optimization. 1. Tests on terminally-blocked alanine and met-enkephalin

A self-consistent multitorsional field (SCMTF) method of global optimization of the conformational energy of an oligopeptide is proposed. The method is based on the idea that the maximum of the

Computational study of transition dynamics in 55-atom clusters

Molecular dynamics computer simulation has ben employed to study structure and isomerization dynamics of intact 55‐atom clusters. The interactions used were selected to represent the heavier noble

Optimization by simulated annealing: Quantitative studies

Experimental studies of the simulated annealing method are presented and its computational efficiency when applied to graph partitioning and traveling salesman problems are presented.

Global energy minimum searches using an approximate solution of the imaginary time Schroedinger equation

We present a method for finding the global energy minimum of a multidimensional potential energy surface through an approximate solution of the Schrodinger equation in imaginary time. The wave