Quantum random access stored-program machines
From MaRDI portal
Publication:2084736
Recommendations
- scientific article; zbMATH DE number 1379489
- ROM-based computation: quantum versus classical
- Simulating and compiling code for the sequential quantum random access machine
- Models of quantum computation and quantum programming languages
- Publication:4941921
- scientific article; zbMATH DE number 2156270
- Quantum Complexity Theory
- scientific article; zbMATH DE number 2013798
- Universality of quantum Turing machines with deterministic control
- Quantum random access memory
Cites work
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3533996 (Why is no real title available?)
- A proof system for disjoint parallel quantum programs
- Can a Universal Quantum Computer Be Fully Quantum?
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- Models of quantum computation and quantum programming languages
- On Halting Process of Quantum Turing Machine
- Parallel quantum computation and quantum codes
- Quantum Complexity Theory
- Quantum Computability
- Quantum advantage with shallow circuits
- Quantum computational networks
- Quantum random access memory
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Remarks on universal quantum computer
- The Solovay--Kitaev algorithm
- The cost of quantum gate primitives
- Time bounded random access machines
This page was built for publication: Quantum random access stored-program machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084736)
