Back to Results
First PageMeta Content
Quantum complexity theory / Models of computation / Turing machine / PostBQP / PP / Quantum Turing machine / Probabilistic Turing machine / RL / Bounded-error probabilistic polynomial / Theoretical computer science / Computational complexity theory / Applied mathematics


Proving the power of postselection⋆ Abuzer Yakaryılmaz1, ⋆⋆ and A.C. Cem Say2, ⋆ ⋆ ⋆ 1 arXiv:1111.3125v1 [cs.CC] 14 Nov 2011
Add to Reading List

Document Date: 2013-12-19 23:31:39


Open Document

File Size: 311,08 KB

Share Result on Facebook
UPDATE