Determining the equivalence for one-way quantum finite automata

DOI10.1016/j.tcs.2008.03.021zbMath1175.68250arXivquant-ph/0703087OpenAlexW2028811084WikidataQ62049449 ScholiaQ62049449MaRDI QIDQ2518375

Lvzhou Li, Dao Wen Qiu

Publication date: 15 January 2009

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

Full work available at URL: https://arxiv.org/abs/quant-ph/0703087

zbMATH Keywords

quantum computingregular languages

Mathematics Subject Classification ID

Related Items (21)

One-Way Finite Automata with Quantum and Classical States ⋮ State succinctness of 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 ⋮ Equivalence checking of quantum finite-state machines ⋮ Exponentially more concise quantum recognition of non-RMM regular languages ⋮ Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties ⋮ SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES ⋮ Promise problems solved by quantum and classical finite automata ⋮ On the complexity of minimizing probabilistic and quantum automata ⋮ Quantum computation with write-only memory ⋮ Two-tape finite automata with quantum and classical states ⋮ Unbounded-error quantum computation with small space bounds ⋮ Hierarchy and equivalence of multi-letter quantum finite automata ⋮ On the power of two-way multihead quantum finite automata ⋮ From mathematical equivalence such as Ma equivalence to generalized Zhang equivalency including gradient equivalency ⋮ Languages Recognized with Unbounded Error by 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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum automata and quantum grammars
• Characterization of sequential quantum machines
• Two-way finite automata with quantum and classical states.
• One-way probabilistic reversible and quantum one-counter automata.
• Regular languages accepted by quantum automata
• Algebraic results on quantum automata
• Determination of equivalence between quantum sequential machines
• Undecidability on quantum finite automata
• Characterizations of 1-Way Quantum Finite Automata
• Dense quantum coding and quantum finite automata
• A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum Computability
• On the Power of Quantum Computation
• 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
• Generalized Automata and Stochastic Languages
• Quantum computers.
• Analogies and differences between quantum and stochastic automata

This page was built for publication: Determining the equivalence for one-way quantum finite automata