Pages that link to "Item:Q511009"
From MaRDI portal
The following pages link to Promise problems solved by quantum and classical finite automata (Q511009):
Displaying 11 items.
- Superiority of exact quantum automata for promise problems (Q413305) (← links)
- Unary probabilistic and quantum automata on promise problems (Q1617185) (← links)
- Finite automata capturing winning sequences for all possible variants of the \(PQ\) penny flip game (Q1657268) (← links)
- Modeling of RNA secondary structures using two-way quantum finite automata (Q2201368) (← links)
- On coverings of products of uninitialized sequential quantum machines (Q2323760) (← links)
- Complexity of Promise Problems on Classical and Quantum Automata (Q2944886) (← links)
- Classical and Quantum Counter Automata on Promise Problems (Q2947425) (← links)
- (Q3455037) (← 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)
- Three Attacks on the Mediated Semi‐Quantum Key Distribution without Invoking Quantum Measurement (Q6068611) (← links)