Pages that link to "Item:Q413305"
From MaRDI portal
The following pages link to Superiority of exact quantum automata for promise problems (Q413305):
Displayed 40 items.
- State succinctness of two-way finite automata with quantum and classical states (Q391188) (← links)
- Size lower bounds for quantum automata (Q403023) (← links)
- Promise problems solved by quantum and classical finite automata (Q511009) (← links)
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- Unbounded-error quantum computation with small space bounds (Q550246) (← links)
- Quantum online algorithms with respect to space and advice complexity (Q669542) (← links)
- Comparative complexity of quantum and classical OBDDs for total and partial functions (Q906414) (← links)
- Unary probabilistic and quantum automata on promise problems (Q1617185) (← links)
- Quantum \(\omega\)-automata over infinite words and their relationships (Q1741054) (← links)
- Improved constructions for succinct affine automata (Q2096598) (← links)
- Two-way and one-way quantum and classical automata with advice for online minimization problems (Q2139057) (← links)
- An exact quantum algorithm for a restricted subtraction game (Q2190513) (← links)
- Modeling of RNA secondary structures using two-way quantum finite automata (Q2201368) (← links)
- On language varieties without Boolean operations (Q2232259) (← links)
- Quantum online streaming algorithms with logarithmic memory (Q2241048) (← links)
- Quantum alternation (Q2361668) (← links)
- Very narrow quantum OBDDs and width hierarchies for classical OBDDs (Q2361670) (← links)
- Nondeterministic unitary OBDDs (Q2399370) (← links)
- Language Recognition Power and Succinctness of Affine Automata (Q2819147) (← links)
- Looking for Pairs that Hard to Separate: A Quantum Approach (Q2830222) (← links)
- Complexity of Promise Problems on Classical and Quantum Automata (Q2944886) (← links)
- Quantum Finite Automata: A Modern Introduction (Q2944891) (← 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)
- On a Conjecture by Christian Choffrut (Q4605510) (← links)
- Quantum Pushdown Automata with Garbage Tape (Q4640342) (← links)
- (Q4988166) (← links)
- The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints (Q5130748) (← links)
- Uncountable classical and quantum complexity classes (Q5223610) (← links)
- (Q5232904) (← links)
- On the Computational Power of Affine Automata (Q5739014) (← links)
- Affine Computation and Affine Automaton (Q5740183) (← links)
- On the Power of One-Way Automata with Quantum and Classical States (Q5744127) (← links)
- Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice (Q5919277) (← links)
- Quantum versus classical online streaming algorithms with logarithmic size of memory (Q6043926) (← links)
- Deterministic construction of QFAs based on the quantum fingerprinting technique (Q6043928) (← links)
- Language recognition power and succinctness of affine automata (Q6061995) (← links)
- Quaternionic quantum automata (Q6114652) (← links)
- Classical and Quantum Computations with Restricted Memory (Q6163622) (← links)