Name
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, the global nature of entanglement and its topological properties, 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. |
Year | Venue | Keywords |
|---|---|---|
2013 | arXiv: Quantum Physics | quantum physics |
Field | DocType | Volume |
Quantum,No-go theorem,Quantum entanglement,Quantum mechanics,Quantum information science,Conjecture,PCP theorem,Quantum error correction,Mathematics,Computational complexity theory | Journal | abs/1309.7495 |
ISSN | Citations | PageRank |
ACM SIGACT News archive Volume 44 Issue 2, June 2013, Pages 47--79 | 3 | 0.39 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dorit Aharonov | 1 | 659 | 74.21 |
| Itai Arad | 2 | 78 | 8.54 |
| Thomas Vidick | 3 | 377 | 31.69 |