4.7 Review

The quantum adiabatic algorithm applied to random optimization problems: The quantum spin glass perspective

Journal

PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS
Volume 523, Issue 3, Pages 127-205

Publisher

ELSEVIER
DOI: 10.1016/j.physrep.2012.10.002

Keywords

Quantum spin glasses; Quantum annealing; Quantum adiabatic algorithm; Computational complexity

Funding

  1. Region Ile de France
  2. ANR
  3. GENCI-CCRT/TGCC [2012056924]
  4. PIR grant of ENS Optimization in complex system
  5. MIT-France Seed Fund/MISTI Global Seed Fund Numerical Simulation and Quantum Adiabatic Algorithms

Ask authors/readers for more resources

Among various algorithms designed to exploit the specific properties of quantum computers with respect to classical ones, the quantum adiabatic algorithm is a versatile proposition to find the minimal value of an arbitrary cost function (ground state energy). Random optimization problems provide a natural testbed to compare its efficiency with that of classical algorithms. These problems correspond to mean field spin glasses that have been extensively studied in the classical case. This paper reviews recent analytical works that extended these studies to incorporate the effect of quantum fluctuations, and presents also some original results in this direction. (c) 2012 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available