Exact results for accepting probabilities of quantum automata.

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)

zbMATH Keywords

Finite automataQuantum computationQuantum measurement

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (5)

Deterministic construction of QFAs based on the quantum fingerprinting technique ⋮ Lower Bounds for Generalized Quantum Finite Automata ⋮ Quantum versus deterministic counter automata ⋮ Mathematical logic and quantum finite state automata ⋮ Quantum Automata Theory – A Review

Cites Work

• Quantum automata and quantum grammars
• Two-way finite automata with quantum and classical states.
• Space-bounded quantum complexity
• Characterizations of 1-Way Quantum Finite Automata
• Quantum Complexity Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Exact results for accepting probabilities of quantum automata.