Pages that link to "Item:Q5166503"
From MaRDI portal
The following pages link to On the state complexity of semi-quantum finite automata (Q5166503):
Displaying 13 items.
- Lower bounds on the size of semi-quantum finite automata (Q264532) (← links)
- Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties (Q498408) (← links)
- Application of distributed semi-quantum computing model in phase estimation (Q506164) (← links)
- Promise problems solved by quantum and classical finite automata (Q511009) (← links)
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- On coverings of products of uninitialized sequential quantum machines (Q2323760) (← links)
- On hybrid models of quantum finite automata (Q2353395) (← links)
- Potential of Quantum Finite Automata with Exact Acceptance (Q2947961) (← links)
- Generalizations of the distributed Deutsch–Jozsa promise problem (Q2973249) (← links)
- Time-Space Complexity Advantages for Quantum Computing (Q5055992) (← links)
- On the power of two-way multihead quantum finite automata (Q5223828) (← links)
- Quantum State Complexity of Formal Languages (Q5500700) (← links)
- Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice (Q5919277) (← links)
