First Page | Document Content | |
---|---|---|
Date: 2018-08-26 18:23:45Computational complexity theory Theoretical computer science Theory of computation Complexity classes Quantum computing Quantum complexity theory Emerging technologies Quantum algorithm BQP PP P versus NP problem NP | Lecture 24, Tues April 18: Collision and Other Applications of Grover We’ve seen the application of Grover’s algorithm to searching game trees. Now let’s see another important application, to… The Collision ProblAdd to Reading ListSource URL: www.scottaaronson.comDownload Document from Source WebsiteFile Size: 249,65 KBShare Document on Facebook |
The Space ‟Just Above” BQP Adam Bouland Based on joint work with Scott Aaronson, Joseph Fitzsimons and Mitchell Lee arXiv: 1412:6507 ITCS ‘16DocID: 1sxeE - View Document | |
NP-complete Problems and Physical Reality arXiv:quant-ph/0502072v2 21 Feb 2005 Scott Aaronson∗DocID: 1pr8U - View Document | |
Limitations of Quantum Advice and One-Way CommunicationDocID: 1pojZ - View Document | |
LA-URTheory Component of the Quantum Information ProcessingDocID: 1p9P7 - View Document | |
c 2005 Cambridge University Press Combinatorics, Probability and Computing, 737–754. DOI: S0963548305007005 Printed in the United Kingdom Approximate Counting and Quantum ComputationDocID: 1oB0X - View Document |