Quantum random access stored-program machines
From MaRDI portal
Publication:2084736
DOI10.1016/J.JCSS.2022.08.002OpenAlexW4294991430WikidataQ114162784 ScholiaQ114162784MaRDI QIDQ2084736FDOQ2084736
Authors: Qisheng Wang, Mingsheng Ying 
Publication date: 13 October 2022
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.03514
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
- Title not available (Why is that?)
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum Computability
- Quantum computational networks
- Quantum Complexity Theory
- Quantum random access memory
- The Solovay--Kitaev algorithm
- Quantum advantage with shallow circuits
- Parallel quantum computation and quantum codes
- Time bounded random access machines
- The cost of quantum gate primitives
- Title not available (Why is that?)
- On Halting Process of Quantum Turing Machine
- Can a Universal Quantum Computer Be Fully Quantum?
- Remarks on universal quantum computer
- A proof system for disjoint parallel quantum programs
- Models of quantum computation and quantum programming languages
- Computational complexity of uniform quantum circuit families and quantum Turing machines
Cited In (1)
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)
