Guest column: the quantum PCP conjecture

  • Authors:

  • Dorit Aharonov;Itai Arad;Thomas Vidick

  • Affiliations:

  • School of Engineering and Computer Science, The Hebrew University, Jerusalem, Israel;Centre for Quantum Technologies, National University of Singapore, Singapore;Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, USA

  • Venue:
  • ACM SIGACT News
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

The classical PCP theorem is arguably the most important achievement of classical complexity theory in the past quarter century. In recent years, researchers in quantum computational complexity have tried to identify approaches and develop tools that address the question: does a quantum version of the PCP theorem hold? The story of this study starts with classical complexity and takes unexpected turns providing fascinating vistas on the foundations of quantum mechanics and multipartite entanglement, topology and the so-called phenomenon of topological order, quantum error correction, information theory, and much more; it raises questions that touch upon some of the most fundamental issues at the heart of our understanding of quantum mechanics. At this point, the jury is still out as to whether or not such a theorem holds. This survey aims to provide a snapshot of the status in this ongoing story, tailored to a general theory-of-CS audience.