Pages that link to "Item:Q473186"
From MaRDI portal
The following pages link to Exponentially more concise quantum recognition of non-RMM regular languages (Q473186):
Displayed 9 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)
- On hybrid models of quantum finite automata (Q2353395) (← links)
- Generalizations of the distributed Deutsch–Jozsa promise problem (Q2973249) (← links)
- On the power of two-way multihead quantum finite automata (Q5223828) (← links)
- Three Attacks on the Mediated Semi‐Quantum Key Distribution without Invoking Quantum Measurement (Q6068611) (← links)
- Learning quantum finite automata with queries (Q6149966) (← links)