• Rapid Communication

Classical-quantum mixing in the random 2-satisfiability problem

Ionut-Dragos Potirniche, C. R. Laumann, and S. L. Sondhi
Phys. Rev. A 92, 040301(R) – Published 1 October 2015

Abstract

Classical satisfiability (SAT) and quantum satisfiability (QSAT) are complete problems for the complexity classes NP and QMA, respectively, and they are believed to be intractable for both classical and quantum computers. Statistical ensembles of instances of these problems have been studied previously in an attempt to elucidate their typical, as opposed to worst-case, behavior. In this paper, we introduce a statistical ensemble that interpolates between classical and quantum. For the simplest 2-SAT–2-QSAT ensemble, we find the exact boundary that separates SAT and UNSAT instances. We do so by establishing coincident lower and upper bounds, in the limit of large instances, on the extent of the UNSAT and SAT regions, respectively.

  • Figure
  • Figure
  • Received 23 February 2015

DOI:https://doi.org/10.1103/PhysRevA.92.040301

©2015 American Physical Society

Authors & Affiliations

Ionut-Dragos Potirniche1,2, C. R. Laumann3,4, and S. L. Sondhi2,4

  • 1Department of Physics, University of California, Berkeley, California 94720-7300, USA
  • 2Department of Physics, Princeton University, Princeton, New Jersey 08544, USA
  • 3Department of Physics, University of Washington, Seattle, Washington 98195, USA
  • 4Max-Planck-Institut für Physik Komplexer Systeme, 01187 Dresden, Germany

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 92, Iss. 4 — October 2015

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 A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×