<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2012-02-17 03:45:53Computational complexity theory Quantum complexity theory Quantum information science Decision tree model Quantum algorithm Deutsch–Jozsa algorithm PP BQP Quantum computer Theoretical computer science Applied mathematics Models of computation |
Add to Reading List |
Part III Michaelmas 2011 QUANTUM COMPUTATION Lecture notes | 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 |