Automata and quantum computing
From MaRDI portal
Publication:2244834
DOI10.4171/AUTOMATA-2/17OpenAlexW1810356272MaRDI QIDQ2244834
Andris Ambainis, Abuzer Yakaryılmaz
Publication date: 12 November 2021
Full work available at URL: https://arxiv.org/abs/1507.01988
Related Items (11)
Affine automata verifiers ⋮ Energy complexity of regular language recognition ⋮ Quantum Finite Automata: A Modern Introduction ⋮ Quantum versus classical online streaming algorithms with logarithmic size of memory ⋮ Deterministic construction of QFAs based on the quantum fingerprinting technique ⋮ Computational limitations of affine automata and generalized affine automata ⋮ Exact Affine Counter Automata ⋮ Learning quantum finite automata with queries ⋮ Error-Free Affine, Unitary, and Probabilistic OBDDs ⋮ GAPs for Shallow Implementation of Quantum Finite Automata ⋮ Improved constructions for succinct affine automata
This page was built for publication: Automata and quantum computing
