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 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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1145/2491533.2491549 | SIGACT News |
Keywords | Field | DocType |
quantum mechanic,classical pcp theorem,quantum computational complexity,quantum pcp conjecture,ongoing story,guest column,fascinating vista,quantum version,classical complexity,quantum error correction,information theory,classical complexity theory | Quantum,Quantum no-deleting theorem,Combinatorics,No-go theorem,Topological order,Computer science,Quantum information science,PCP theorem,Conjecture,Quantum error correction | Journal |
Volume | Issue | Citations |
44 | 2 | 14 |
PageRank | References | Authors |
0.65 | 32 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dorit Aharonov | 1 | 659 | 74.21 |
| Itai Arad | 2 | 78 | 8.54 |
| Thomas Vidick | 3 | 377 | 31.69 |