Proving the Power of Postselection

DOI10.3233/FI-2013-803zbMath1279.68091arXiv1111.3125OpenAlexW3102967820MaRDI QIDQ4914314

Abuzer Yakaryılmaz, A. C. Cem Say

Publication date: 18 April 2013

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.3125

zbMATH Keywords

postselectionprobabilistic Turing machinesquantum Turing machinesspace-bounded computationzero errorone-sided error

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (5)

Quantum alternation ⋮ Exact Affine Counter Automata ⋮ Unnamed Item ⋮ Uncountable classical and quantum complexity classes ⋮ Computation with multiple CTCs of fixed length and width

This page was built for publication: Proving the Power of Postselection