Characterizations of quantum automata

DOI10.1016/j.tcs.2003.08.007zbMath1075.68030OpenAlexW2044084653WikidataQ62049468 ScholiaQ62049468MaRDI QIDQ1884961

Ming Sheng Ying, Dao Wen Qiu

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.08.007

zbMATH Keywords

Hilbert spacesAutomataQuantum computationGrammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68) Grammars and rewriting systems (68Q42)

Related Items

Automata theory based on quantum logic: recognizability and accessibility, Quaternionic quantum automata, A theory of computation based on unsharp quantum logic: finite state automata and pushdown automata, Automata theory based on quantum logic: reversibilities and pushdown automata, Promise problems solved by quantum and classical finite automata, Determination of equivalence between quantum sequential machines, Weakly regular quantum grammars and asynchronous quantum automata, Efficient probability amplification in two-way quantum finite automata, On the power of two-way multihead quantum finite automata, Characterizations of one-way general quantum finite automata, On coverings of products of uninitialized sequential quantum machines, Characterization of tree automata based on quantum logic

Cites Work

• Unnamed Item
• Unnamed Item
• Quantum automata and quantum grammars
• Characterization of sequential quantum machines
• Two-way finite automata with quantum and classical states.
• Dense quantum coding and a lower bound for 1-way quantum automata
• Characterizations of 1-Way Quantum Finite Automata
• Quantum computers.