Quantum logarithmic space and post-selection

DOI10.4230/LIPICS.TQC.2021.10MaRDI QIDQ6161152zbMATH OpenFDO

Authors François Le Gall, Harumichi Nishimura, Abuzer Yakaryılmaz

Publication date 26 June 2023

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

zbMATH Keywords

computational complexitypost-selectionspace-bounded quantum computation

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• Proving the power of postselection
• Quantum computing, postselection, and probabilistic polynomial-time
• Postselection finite quantum automata
• Space-bounded quantum complexity
• scientific article; zbMATH DE number 1335895

Cited in

(1)

• Classical and quantum Merlin-Arthur automata

This page was built for publication: Quantum logarithmic space and post-selection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6161152)