Some algebraic properties of measure-once two-way quantum finite automata

DOI10.1007/s11128-008-0083-8zbMath1160.81352OpenAlexW2054122525WikidataQ62038221 ScholiaQ62038221MaRDI QIDQ1007122

Xin Wang, Zhengjun Xi, Yong-Ming Li

Publication date: 27 March 2009

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11128-008-0083-8

zbMATH Keywords

transition operatorquantum finite automataCauchy productalgebraic propertyone-way computertwo-way computer

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum mechanical Hamiltonian models of Turing machines
• Quantum automata and quantum grammars
• Two-way finite automata with quantum and classical states.
• Regular languages accepted by quantum automata
• Quantum computational networks
• Characterizations of 1-Way Quantum Finite Automata
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum Complexity Theory
• Unbounded-Error One-Way Classical and Quantum Communication Complexity
• Theoretical Computer Science
• Direct and dual laws for automata with multiplicities

This page was built for publication: Some algebraic properties of measure-once two-way quantum finite automata