On hybrid models of quantum finite automata

DOI10.1016/j.jcss.2015.01.001zbMath1323.68273arXiv1206.2131MaRDI QIDQ2353395

Yuan Feng, Lvzhou Li

Publication date: 13 July 2015

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.2131

zbMATH Keywords

automata theory; quantum computing; hybrid quantum finite automata; quantum finite automata (QFA)

Mathematics Subject Classification ID

68Q45: Formal languages and automata

81P68: Quantum computation

Related Items

Lower bounds on the size of semi-quantum finite automata, Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties, Application of distributed semi-quantum computing model in phase estimation, Promise problems solved by quantum and classical finite automata, Finite automata capturing winning sequences for all possible variants of the \(PQ\) penny flip game, Generalizations of the distributed Deutsch–Jozsa promise problem

Uses Software

• QPL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exponentially more concise quantum recognition of non-RMM regular languages
• Unbounded-error quantum computation with small space bounds
• On the complexity of minimizing probabilistic and quantum automata
• Characterizations of one-way general quantum finite automata
• Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
• An application of quantum finite automata to interactive proof systems
• A note on quantum sequential machines
• Quantum automata and quantum grammars
• Characterization of sequential quantum machines
• Two-way finite automata with quantum and classical states.
• Regular languages accepted by quantum automata
• On the complexity of simulating space-bounded quantum computations
• Determination of equivalence between quantum sequential machines
• Determining the equivalence for one-way quantum finite automata
• Undecidability on quantum finite automata
• Characterizations of 1-Way Quantum Finite Automata
• One-Way Finite Automata with Quantum and Classical States
• Quantum finite automata with control language
• Dense quantum coding and quantum finite automata
• Various Aspects of Finite Quantum Automata
• A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
• Towards a quantum programming language
• On the state complexity of semi-quantum finite automata