Pages that link to "Item:Q391188"
From MaRDI portal
The following pages link to State succinctness of two-way finite automata with quantum and classical states (Q391188):
Displaying 15 items.
- Application of distributed semi-quantum computing model in phase estimation (Q506164) (← links)
- Promise problems solved by quantum and classical finite automata (Q511009) (← links)
- Unary probabilistic and quantum automata on promise problems (Q1617185) (← links)
- On coverings of products of uninitialized sequential quantum machines (Q2323760) (← links)
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata (Q2343133) (← links)
- Complexity of Promise Problems on Classical and Quantum Automata (Q2944886) (← links)
- From Quantum Query Complexity to State Complexity (Q2944893) (← links)
- Potential of Quantum Finite Automata with Exact Acceptance (Q2947961) (← links)
- Generalizations of the distributed Deutsch–Jozsa promise problem (Q2973249) (← links)
- One-Way Finite Automata with Quantum and Classical States (Q3166958) (← links)
- On the power of two-way multihead quantum finite automata (Q5223828) (← links)
- Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice (Q5919277) (← links)
- Deterministic construction of QFAs based on the quantum fingerprinting technique (Q6043928) (← links)
- Quaternionic quantum automata (Q6114652) (← links)
- Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)
