The following pages link to (Q5418251):
Displayed 11 items.
- State succinctness of two-way finite automata with quantum and classical states (Q391188) (← links)
- Exponentially more concise quantum recognition of non-RMM regular languages (Q473186) (← links)
- Computing power of Turing machines in the framework of unsharp quantum logic (Q496026) (← links)
- Application of distributed semi-quantum computing model in phase estimation (Q506164) (← links)
- Promise problems solved by quantum and classical finite automata (Q511009) (← links)
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata (Q2343133) (← links)
- From Quantum Query Complexity to State Complexity (Q2944893) (← links)
- Generalizations of the distributed Deutsch–Jozsa promise problem (Q2973249) (← links)
- One-Way Finite Automata with Quantum and Classical States (Q3166958) (← links)
- Time-Space Complexity Advantages for Quantum Computing (Q5055992) (← links)
- Learning quantum finite automata with queries (Q6149966) (← links)