Pages that link to "Item:Q1605308"
From MaRDI portal
The following pages link to Computational complexity of uniform quantum circuit families and quantum Turing machines (Q1605308):
Displaying 15 items.
- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families (Q1009352) (← links)
- Quantum implicit computational complexity (Q1044836) (← links)
- Uniformity of quantum circuit families for error-free algorithms (Q1770403) (← links)
- Quantum branching programs and space-bounded nonuniform quantum complexity (Q1779302) (← links)
- Quantum random access stored-program machines (Q2084736) (← links)
- Implementation of an E-payment security evaluation system based on quantum blind computing (Q2208041) (← links)
- Power of uninitialized qubits in shallow quantum circuits (Q2220824) (← links)
- Classically simulating quantum circuits with local depolarizing noise (Q2238211) (← links)
- Models of quantum computation and quantum programming languages (Q2250909) (← links)
- Polynomial time quantum computation with advice (Q2390250) (← links)
- On quantum lambda calculi: a foundational perspective (Q2973238) (← links)
- (Q5089258) (← links)
- Hilbert’s sixth problem: the endless road to rigour (Q5154202) (← links)
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY (Q5858921) (← links)
- Zero sum subsequences and hidden subgroups (Q6182403) (← links)
