Quantum random access stored-program machines

DOI10.1016/j.jcss.2022.08.002OpenAlexW4294991430WikidataQ114162784 ScholiaQ114162784MaRDI QIDQ2084736

Qisheng Wang, Ming Sheng 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

zbMATH Keywords

Turing machinequantum computingrandom access machinestored-program machine

Mathematics Subject Classification ID

Quantum computation (81P68) Other nonclassical models of computation (68Q09)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational complexity of uniform quantum circuit families and quantum Turing machines
• Time bounded random access machines
• A proof system for disjoint parallel quantum programs
• Models of quantum computation and quantum programming languages
• Parallel Quantum Computation and Quantum Codes
• Quantum computational networks
• Quantum Random Access Memory
• On Halting Process of Quantum Turing Machine
• Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum Computability
• Quantum Complexity Theory
• Can a Universal Quantum Computer Be Fully Quantum?
• Quantum advantage with shallow circuits
• Remarks on universal quantum computer

This page was built for publication: Quantum random access stored-program machines