A note on quantum sequential machines

DOI10.1016/J.TCS.2008.08.026MaRDI QIDQ1029358zbMATH OpenOpenAlexWikidataFDO

Authors Lvzhou Li, Daowen Qiu

Publication date 10 July 2009

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

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

zbMATH Keywords

equivalencequantum computingquantum finite automataquantum sequential machinesstochastic sequential machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68)

Recommendations

• Determination of equivalence between quantum sequential machines
• Characterization of sequential quantum machines
• Hierarchy and equivalence of multi-letter quantum finite automata
• Equivalence checking of quantum finite-state machines
• Determining the equivalence for one-way quantum finite automata

Cites work

• scientific article; zbMATH DE number 3181418 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 2080997 (Why is no real title available?)
• scientific article; zbMATH DE number 845841 (Why is no real title available?)
• scientific article; zbMATH DE number 3371972 (Why is no real title available?)
• A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
• Characterization of sequential quantum machines
• Characterizations of 1-Way Quantum Finite Automata
• Decidable and Undecidable Problems about Quantum Automata
• Dense quantum coding and quantum finite automata
• Determination of equivalence between quantum sequential machines
• Determining the equivalence for one-way quantum finite automata
• Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Probabilistic automata
• Quantum Complexity Theory
• Quantum automata and quantum grammars
• Quantum computational networks
• Quantum computers.
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Regular languages accepted by quantum automata
• The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
• Undecidability on quantum finite automata

Cited in

(14)

• Characterization of sequential quantum machines
• Two-tape finite automata with quantum and classical states
• Equivalence checking of quantum finite-state machines
• Characterizations of one-way general quantum finite automata
• scientific article; zbMATH DE number 7028346 (Why is no real title available?)
• Some languages recognized by two-way finite automata with quantum and classical states
• Another approach to the equivalence of measure-many one-way quantum finite automata and its application
• One-way finite automata with quantum and classical states
• Determination of equivalence between quantum sequential machines
• On hybrid models of quantum finite automata
• On the complexity of minimizing probabilistic and quantum automata
• Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
• Parsing a Sequence of Qubits
• On coverings of products of uninitialized sequential quantum machines

This page was built for publication: A note on quantum sequential machines

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