Quantum finite automata
From MaRDI portal
Recommendations
Cited in
(26)- Improved constructions of quantum automata
- Pumping lemma for quantum automata
- Characterizations of quantum automata
- Automata and quantum computing
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
- Algebraic results on quantum automata
- Quantum finite automata: a modern introduction
- From quantum query complexity to state complexity
- Generalizations of the distributed Deutsch-Jozsa promise problem
- Quantum automata theory -- a review
- One-way finite automata with quantum and classical states
- Lower Bounds for Generalized Quantum Finite Automata
- State succinctness of two-way finite automata with quantum and classical states
- scientific article; zbMATH DE number 35744 (Why is no real title available?)
- scientific article; zbMATH DE number 1948489 (Why is no real title available?)
- Exponentially more concise quantum recognition of non-RMM regular languages
- scientific article; zbMATH DE number 1421018 (Why is no real title available?)
- Computing power of Turing machines in the framework of unsharp quantum logic
- Time-Space Complexity Advantages for Quantum Computing
- Application of distributed semi-quantum computing model in phase estimation
- Promise problems solved by quantum and classical finite automata
- scientific article; zbMATH DE number 6440119 (Why is no real title available?)
- Classically time-controlled quantum automata
- Learning quantum finite automata with queries
- Latvian quantum finite state automata for unary languages
- On finite automata with quantum and classical states
This page was built for publication: Quantum finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5418251)
