Universality of quantum Turing machines with deterministic control
From MaRDI portal
Recommendations
Cited in
(15)- Universal quantum computation via quantum controlled classical operations
- Classically controlled quantum computation
- Partial observation of quantum Turing machines and a weaker well-formedness condition
- Quantum computers.
- Size-based termination of higher-order rewriting
- Note on a universal quantum Turing machine
- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
- Universality and programmability of quantum computers
- Quantum chaos in quantum Turing machines
- Strongly Universal Quantum Turing Machines and Invariance of Kolmogorov Complexity
- Quantum Turing automata
- scientific article; zbMATH DE number 1418357 (Why is no real title available?)
- Quantum Computability
- Quantum random access stored-program machines
- Quantum Complexity Theory
This page was built for publication: Universality of quantum Turing machines with deterministic control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2987040)