Exact results for accepting probabilities of quantum automata.
From MaRDI portal
Publication:1401229
DOI10.1016/S0304-3975(02)00393-6zbMath1044.68058MaRDI QIDQ1401229
Andris Ambainis, Arnolds Ķikusts
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q45: Formal languages and automata
81P68: Quantum computation
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Mathematical logic and quantum finite state automata, Quantum versus deterministic counter automata, Quantum Automata Theory – A Review, Lower Bounds for Generalized Quantum Finite Automata
Cites Work