First-Order Transitions and the Performance of Quantum Algorithms in Random Optimization Problems

Thomas Jörg, Florent Krzakala, Guilhem Semerjian, and Francesco Zamponi
Phys. Rev. Lett. 104, 207206 – Published 20 May 2010

Abstract

We present a study of the phase diagram of a random optimization problem in the presence of quantum fluctuations. Our main result is the characterization of the nature of the phase transition, which we find to be a first-order quantum phase transition. We provide evidence that the gap vanishes exponentially with the system size at the transition. This indicates that the quantum adiabatic algorithm requires a time growing exponentially with system size to find the ground state of this problem.

  • Figure
  • Figure
  • Figure
  • Figure
  • Received 19 November 2009

DOI:https://doi.org/10.1103/PhysRevLett.104.207206

©2010 American Physical Society

Authors & Affiliations

Thomas Jörg1, Florent Krzakala2,3, Guilhem Semerjian1, and Francesco Zamponi4,1

  • 1LPTENS, CNRS UMR 8549, associée à l’UPMC Paris 06, 24 Rue Lhomond, 75005 Paris, France
  • 2ESPCI ParisTech, CNRS UMR 7083 Gulliver, 10 rue Vauquelin, 75005 Paris, France
  • 3T-Division and Center for Nonlinear Studies, Los Alamos National Laboratory, New Mexico 87545 USA
  • 4Princeton Center for Theoretical Science, Princeton University, Princeton, New Jersey 08544, USA

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 104, Iss. 20 — 21 May 2010

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review Letters

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×