The following pages link to (Q4941921):
Displayed 10 items.
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families (Q1009352) (← links)
- Theory of one-tape linear-time Turing machines (Q1041220) (← links)
- Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report) (Q2152096) (← links)
- Polynomial time quantum computation with advice (Q2390250) (← links)
- Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition (Q2825346) (← links)
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY (Q5858921) (← links)
- How does adiabatic quantum computation fit into quantum automata theory? (Q5918616) (← links)
- Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice (Q5919277) (← links)
- Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability (Q6102995) (← links)