Pages that link to "Item:Q2720411"
From MaRDI portal
The following pages link to Local Transition Functions of Quantum Turing Machines (Q2720411):
Displayed 10 items.
- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families (Q1009352) (← links)
- Quantum branching programs and space-bounded nonuniform quantum complexity (Q1779302) (← links)
- Polynomial time quantum computation with advice (Q2390250) (← links)
- Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem (Q2458453) (← links)
- Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition (Q2825346) (← links)
- Revisiting the simulation of quantum Turing machines by quantum circuits (Q5160678) (← links)
- ANALYSIS OF QUANTUM FUNCTIONS (Q5696940) (← links)
- QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES (Q5696941) (← links)
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY (Q5858921) (← links)
- How does adiabatic quantum computation fit into quantum automata theory? (Q5918616) (← links)