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

DOI10.1007/S11128-008-0083-8MaRDI QIDQ1007122zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Zheng-Jun Xi, Xin Wang, Yongming 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

quantum finite automatatransition operatorCauchy productalgebraic propertyone-way computertwo-way computer

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• Characterizations of 1-Way Quantum Finite Automata
• Characterizations of one-way general quantum finite automata
• Two-way finite automata with quantum and classical states.
• SOFSEM 2006: Theory and Practice of Computer Science
• Algebraic characterization of the class of languages recognized by measure only quantum automata

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 2040892 (Why is no real title available?)
• scientific article; zbMATH DE number 1511685 (Why is no real title available?)
• scientific article; zbMATH DE number 1759400 (Why is no real title available?)
• scientific article; zbMATH DE number 3229565 (Why is no real title available?)
• Characterizations of 1-Way Quantum Finite Automata
• Direct and dual laws for automata with multiplicities
• Lower bounds on the size of quantum automata accepting unary languages.
• Quantum Complexity Theory
• Quantum automata and quantum grammars
• Quantum computational networks
• Quantum mechanical Hamiltonian models of Turing machines
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Regular languages accepted by quantum automata
• Two-way finite automata with quantum and classical states.
• Unbounded-Error One-Way Classical and Quantum Communication Complexity

Cited in

(8)

• Corrigendum to: ``Another approach to the equivalence of measure-many one-way quantum finite automata and its application
• Characterizations of 1-Way Quantum Finite Automata
• Two-way finite automata with quantum and classical states.
• SOFSEM 2006: Theory and Practice of Computer Science
• Mirrors and memory in quantum automata
• Algebraic characterization of the class of languages recognized by measure only quantum automata
• On the power of two-way multihead quantum finite automata
• Algebraic results on quantum automata

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007122)