Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T11:21:15.366Z Has data issue: false hasContentIssue false

An introduction to quantum annealing

Published online by Cambridge University Press:  15 March 2011

Diego de Falco
Affiliation:
Dipartimento di Scienze dell'Informazione Università degli Studi di Milano, via Comelico 39/41, 20135 Milano, Italy; tamascelli@dsi.unimi.it
Dario Tamascelli
Affiliation:
Dipartimento di Scienze dell'Informazione Università degli Studi di Milano, via Comelico 39/41, 20135 Milano, Italy; tamascelli@dsi.unimi.it

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
© EDP Sciences, 2011