Upgrade to Pro — share decks privately, control downloads, hide ads and more …

Vidick (MIT) QIP 2014 slides on QPCP

Cad49e6ffc6048dc9c53c77a907632dc?s=47 Daniel Bilar
January 14, 2014

Vidick (MIT) QIP 2014 slides on QPCP

Abstract from companion paper https://arxiv.org/pdf/1309.7495.pdf

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.

Talk https://youtu.be/nrRPQ2EP3ms


Daniel Bilar

January 14, 2014


  1. None
  2. None
  3. None
  4. None
  5. None
  6. None
  7. None
  8. None
  9. None
  10. None
  11. None
  12. None
  13. None
  14. None
  15. None
  16. None
  17. None
  18. None
  19. None
  20. None
  21. None
  22. None
  23. None