Potential of Quantum Finite Automata with Exact Acceptance
From MaRDI portal
Publication:2947961
DOI10.1142/S0129054115500215zbMath1327.81128arXiv1404.1689OpenAlexW2234492345MaRDI QIDQ2947961
Shenggen Zheng, Jozef Gruska, Dao Wen Qiu
Publication date: 29 September 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.1689
Related Items (9)
Unary probabilistic and quantum automata on promise problems ⋮ Complexity of Promise Problems on Classical and Quantum Automata ⋮ Quantum Finite Automata: A Modern Introduction ⋮ From Quantum Query Complexity to State Complexity ⋮ Language recognition power and succinctness of affine automata ⋮ Quaternionic quantum automata ⋮ Generalizations of the distributed Deutsch–Jozsa promise problem ⋮ Promise problems solved by quantum and classical finite automata ⋮ Language Recognition Power and Succinctness of Affine Automata
Cites Work
- State succinctness of two-way finite automata with quantum and classical states
- Superiority of exact quantum automata for promise problems
- Unbounded-error quantum computation with small space bounds
- Characterizations of one-way general quantum finite automata
- Improved constructions of quantum automata
- Improved constructions of mixed state quantum automata
- Quantum automata and quantum grammars
- Two-way finite automata with quantum and classical states.
- Small size quantum automata recognizing some regular languages
- Some formal tools for analyzing quantum automata.
- Characterizations of 1-Way Quantum Finite Automata
- Dense quantum coding and quantum finite automata
- Rapid solution of problems by quantum computation
- Quantum algorithms revisited
- On the Power of Quantum Computation
- SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES
- On the state complexity of semi-quantum finite automata
- GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA
This page was built for publication: Potential of Quantum Finite Automata with Exact Acceptance
