Hierarchy and equivalence of multi-letter quantum finite automata
From MaRDI portal
Publication:2271440
DOI10.1016/j.tcs.2009.03.040zbMath1179.68073OpenAlexW1834492313WikidataQ62049436 ScholiaQ62049436MaRDI QIDQ2271440
Publication date: 7 August 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.03.040
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (13)
One-Way Finite Automata with Quantum and Classical States ⋮ State succinctness of two-way finite automata with quantum and classical states ⋮ QPSO-CD: quantum-behaved particle swarm optimization algorithm with Cauchy distribution ⋮ Mirrors and memory in quantum automata ⋮ Another approach to the equivalence of measure-many one-way quantum finite automata and its application ⋮ Exponentially more concise quantum recognition of non-RMM regular languages ⋮ SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES ⋮ Promise problems solved by quantum and classical finite automata ⋮ Two-tape finite automata with quantum and classical states ⋮ On the power of two-way multihead quantum finite automata ⋮ 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
Cites Work
- Quantum computing.
- 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
- One way multihead deterministic finite automata
- Automata theory based on quantum logic: reversibilities and pushdown 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
- 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
- On the equivalence problem for deterministic multitape automata and transducers
- Multi-letter Reversible and Quantum Finite Automata
- Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Hierarchy and equivalence of multi-letter quantum finite automata
