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 tracks the ground state of a suitable time-dependent Hamiltonian, where '' is slowly switched off. We illustrate several applications of quantum annealing strategies, starting from textbook toy-models - double-well potentials and other one-dimensional examples, with and without disorder. These examples display in a clear way the crucial differences between classical and quantum annealing. We then discuss applications of quantum annealing to challenging hard optimization problems, such as the random Ising model, the travelling salesman problem and Boolean satisfiability problems. The techniques used to implement quantum annealing are either deterministic Schrödinger's evolutions, for the toy models, or path-integral Monte Carlo and Green's function Monte Carlo approaches, for the hard optimization problems. The crucial role played by disorder and the associated non-trivial Landau-Zener tunnelling phenomena is discussed and emphasized
Optimization using quantum mechanics: quantum annealing through adiabatic evolution / Santoro, Giuseppe Ernesto; Tosatti, Erio. - In: JOURNAL OF PHYSICS. A, MATHEMATICAL AND GENERAL. - ISSN 0305-4470. - 39:36(2006), pp. R393-R431. [10.1088/0305-4470/39/36/R01]
Optimization using quantum mechanics: quantum annealing through adiabatic evolution
Santoro, Giuseppe Ernesto;Tosatti, Erio
2006-01-01
Abstract
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 tracks the ground state of a suitable time-dependent Hamiltonian, where '' is slowly switched off. We illustrate several applications of quantum annealing strategies, starting from textbook toy-models - double-well potentials and other one-dimensional examples, with and without disorder. These examples display in a clear way the crucial differences between classical and quantum annealing. We then discuss applications of quantum annealing to challenging hard optimization problems, such as the random Ising model, the travelling salesman problem and Boolean satisfiability problems. The techniques used to implement quantum annealing are either deterministic Schrödinger's evolutions, for the toy models, or path-integral Monte Carlo and Green's function Monte Carlo approaches, for the hard optimization problems. The crucial role played by disorder and the associated non-trivial Landau-Zener tunnelling phenomena is discussed and emphasizedFile | Dimensione | Formato | |
---|---|---|---|
QA_JPA_reprint.pdf
non disponibili
Licenza:
Non specificato
Dimensione
1.12 MB
Formato
Adobe PDF
|
1.12 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.