Pages that link to "Item:Q1009352"
From MaRDI portal
The following pages link to Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families (Q1009352):
Displayed 6 items.
- Quantum implicit computational complexity (Q1044836) (← links)
- Uniformity of quantum circuit families for error-free algorithms (Q1770403) (← links)
- QPCF: higher-order languages and quantum circuits (Q2331073) (← links)
- A branching distributed temporal logic for reasoning about entanglement-free quantum state transformations (Q2401638) (← links)
- $$\mathsf {qPCF}$$ : A Language for Quantum Circuit Computations (Q2988843) (← links)
- Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer (Q4972864) (← links)