Postselection finite quantum automata

DOI10.1007/978-3-642-13523-1_14zbMATH Open1286.68143OpenAlexW1528751601MaRDI QIDQ3575223FDOQ3575223

Authors: Oksana Scegulnaja-Dubrovska, Lelde Lāce, Rūsiņš Freivalds 

Publication date: 26 July 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13523-1_14

Recommendations

• Proving the power of postselection
• Two-way finite automata with quantum and classical states.
• scientific article; zbMATH DE number 1490003
• Quantum finite automata: a modern introduction
• The complexity of probabilistic versus quantum finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68)

Cited In (2)

• Quantum hedging in two-round prover-verifier interactions
• Proving the power of postselection

This page was built for publication: Postselection finite quantum automata

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