On Quantum Computing and Pseudorandomness
The relationship between efficient verification and quantum computing is one of the most important and least well-understood questions in the theory of computation. In particular, is there a problem that can be solved efficiently on a quantum computer that cannot be verified? In this thesis we giv...
Internet
https://thesis.library.caltech.edu/6237/1/bfefferman-msthesis.pdfFefferman, William Jason (2011) On Quantum Computing and Pseudorandomness. Master's thesis, California Institute of Technology. doi:10.7907/3Q00-DD64. https://resolver.caltech.edu/CaltechTHESIS:01312011-155543067 <https://resolver.caltech.edu/CaltechTHESIS:01312011-155543067>