scientific article
From MaRDI portal
Publication:2762497
zbMath0976.68087arXivquant-ph/0009004MaRDI QIDQ2762497
Māris Valdats, Arnolds Ķikusts, Andris Ambainis
Publication date: 9 January 2002
Full work available at URL: https://arxiv.org/abs/quant-ph/0009004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (20)
On the Size of One-way Quantum Finite Automata with Periodic Behaviors ⋮ Unnamed Item ⋮ Deterministic construction of QFAs based on the quantum fingerprinting technique ⋮ Exact results for accepting probabilities of quantum automata. ⋮ Eilenberg's variety theorem without Boolean operations ⋮ Another approach to the equivalence of measure-many one-way quantum finite automata and its application ⋮ Lower Bounds for Generalized Quantum Finite Automata ⋮ One-way reversible and quantum finite automata with advice ⋮ On language varieties without Boolean operations ⋮ Some formal tools for analyzing quantum automata. ⋮ Hierarchy and equivalence of multi-letter quantum finite automata ⋮ Quantum versus deterministic counter automata ⋮ Interactive proofs with quantum finite automata ⋮ Improved constructions of quantum automata ⋮ Efficient probability amplification in two-way quantum finite automata ⋮ On a class of languages recognizable by probabilistic reversible decide-and-halt automata ⋮ Quantum Automata Theory – A Review ⋮ Quantum State Complexity of Formal Languages ⋮ Improved Constructions of Quantum Automata ⋮ Quantum finite automata with control language
This page was built for publication:
