RAIRO-Theor. Inf. Appl.
Volume 45, Number 1, January-March 2011ICTCS 09
|Page(s)||99 - 116|
|Published online||15 March 2011|
An introduction to quantum annealing
Dipartimento di Scienze dell'Informazione
Università degli Studi di Milano,
via Comelico 39/41, 20135 Milano, Italy; firstname.lastname@example.org
Accepted: 18 November 2010
Quantum annealing, or quantum stochastic optimization, is a classical randomized algorithm which provides good heuristics for the solution of hard optimization problems. The algorithm, suggested by the behaviour of quantum systems, is an example of proficuous cross contamination between classical and quantum computer science. In this survey paper we illustrate how hard combinatorial problems are tackled by quantum computation and present some examples of the heuristics provided by quantum annealing. We also present preliminary results about the application of quantum dissipation (as an alternative to imaginary time evolution) to the task of driving a quantum system toward its state of lowest energy.
Mathematics Subject Classification: 81P68 / 68Q12 / 68W25
Key words: Combinatorial optimization / adiabatic quantum computation / quantum annealing / dissipative dynamics
© EDP Sciences, 2011
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.