Sciweavers

CORR
2004
Springer
94views Education» more  CORR 2004»
14 years 10 days ago
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
Scott Aaronson