Prospects for a Quantum PCP Theorem

Published on ● Video Link: https://www.youtube.com/watch?v=TURe17P6tcM



Duration: 59:36
555 views
6


Matt Hastings, Microsoft Research
Complexity Meets Condensed Matter
http://simons.berkeley.edu/talks/matt-hastings-2014-03-25







Tags:
Simons Institute
Quantum Hamiltonian Complexity
UC Berkeley
computer science
theory of computing
Matt Hastings