Determination of equivalence between quantum sequential machines

DOI10.1016/j.tcs.2006.03.001zbMath1097.68040OpenAlexW2119825179WikidataQ62049462 ScholiaQ62049462MaRDI QIDQ2503273

Lvzhou Li, Dao Wen Qiu

Publication date: 14 September 2006

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

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

zbMATH Keywords

equivalencequantum computationquantum sequential machinesstochastic sequential machines

Mathematics Subject Classification ID

Related Items (16)

State succinctness of two-way finite automata with quantum and classical states ⋮ Quaternionic quantum automata ⋮ QPSO-CD: quantum-behaved particle swarm optimization algorithm with Cauchy distribution ⋮ Learning quantum finite automata with queries ⋮ Another approach to the equivalence of measure-many one-way quantum finite automata and its application ⋮ Equivalence checking of quantum finite-state machines ⋮ Hierarchy and equivalence of multi-letter quantum finite automata ⋮ Periodic generalized automata over the reals ⋮ Determining the equivalence for one-way quantum finite automata ⋮ Weakly regular quantum grammars and asynchronous quantum automata ⋮ On the power of two-way multihead quantum finite automata ⋮ A note on quantum sequential machines ⋮ 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

• 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
• Two-way finite automata with quantum and classical states.
• Regular languages accepted by quantum automata
• Characterizations of quantum automata
• Characterizations of 1-Way Quantum Finite Automata
• Dense quantum coding and quantum finite automata
• Relations Among Complexity Measures
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum Complexity Theory
• Logical Reversibility of Computation
• Quantum computers.
• Analogies and differences between quantum and stochastic automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Determination of equivalence between quantum sequential machines