A note on quantum sequential machines
From MaRDI portal
Publication:1029358
DOI10.1016/j.tcs.2008.08.026zbMath1172.68019OpenAlexW2072745801WikidataQ62049428 ScholiaQ62049428MaRDI QIDQ1029358
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
equivalencequantum computingquantum finite automataquantum sequential machinesstochastic sequential machines
Related Items
One-Way Finite Automata with Quantum and Classical States, Another approach to the equivalence of measure-many one-way quantum finite automata and its application, SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES, On the complexity of minimizing probabilistic and quantum automata, Two-tape finite automata with quantum and classical states, Characterizations of one-way general quantum finite automata, Multi-letter quantum finite automata: decidability of the equivalence and minimization of states, On coverings of products of uninitialized sequential quantum machines, On hybrid models of quantum finite automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum automata and quantum grammars
- Characterization of sequential quantum machines
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- Regular languages accepted by quantum automata
- Determination of equivalence between quantum sequential machines
- Determining the equivalence for one-way quantum finite automata
- Undecidability on quantum finite automata
- Quantum computational networks
- Characterizations of 1-Way Quantum Finite Automata
- Dense quantum coding and quantum finite automata
- A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Complexity Theory
- Decidable and Undecidable Problems about Quantum Automata
- Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages
- Probabilistic automata
- Quantum computers.
