Pages that link to "Item:Q1017405"
From MaRDI portal
The following pages link to Improved constructions of mixed state quantum automata (Q1017405):
Displaying 8 items.
- Exponentially more concise quantum recognition of non-RMM regular languages (Q473186) (← links)
- Promise problems solved by quantum and classical finite automata (Q511009) (← links)
- From Quantum Query Complexity to State Complexity (Q2944893) (← links)
- Potential of Quantum Finite Automata with Exact Acceptance (Q2947961) (← links)
- (Q4088301) (← links)
- (Q4988166) (← links)
- Quantum State Complexity of Formal Languages (Q5500700) (← links)
- How does adiabatic quantum computation fit into quantum automata theory? (Q5918616) (← links)
