On the state complexity of semi-quantum finite automata
From MaRDI portal
Publication:5166503
Recommendations
Cited in
(15)- Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties
- On the state complexity of semi-quantum finite automata
- Lower bounds on the size of semi-quantum finite automata
- From quantum query complexity to state complexity
- Generalizations of the distributed Deutsch-Jozsa promise problem
- Promise problems solved by quantum and classical finite automata
- Quantum state complexity of formal languages
- Potential of quantum finite automata with exact acceptance
- On hybrid models of quantum finite automata
- On the power of two-way multihead quantum finite automata
- Superposition as memory: unlocking quantum automatic complexity
- Time-Space Complexity Advantages for Quantum Computing
- Application of distributed semi-quantum computing model in phase estimation
- Quantum finite automata: advances on Bertoni's ideas
- On coverings of products of uninitialized sequential quantum machines
This page was built for publication: On the state complexity of semi-quantum finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166503)