Models of quantum computation and quantum programming languages
arXiv:1012.6035 · doi:10.2478/v10175-011-0039-5
Abstract
The goal of the presented paper is to provide an introduction to the basic computational models used in quantum information theory. We review various models of quantum Turing machine, quantum circuits and quantum random access machine (QRAM) along with their classical counterparts. We also provide an introduction to quantum programming languages, which are developed using the QRAM model. We review the syntax of several existing quantum programming languages and discuss their features and limitations.
23 pages, 10 figures, 9 listings
References in corpus (11)
- Quantum cryptography: Public key distribution and coin tossing
- Quantum Computing
- Free-Space distribution of entanglement and single photons over 144 km
- Universal computation by quantum walk
- Spatial search by quantum walk
- Quantum algorithms for algebraic problems
- A Lambda Calculus for Quantum Computation
- Quantum Walks, Quantum Gates and Quantum Computers
- Game-theoretic discussion of quantum state estimation and cloning
- Operational Semantics and Type Soundness of Quantum Programming Language LanQ
- Physics and computer science: quantum computation and other approaches
Cited by in corpus (9)
- Q#: Enabling scalable quantum computing and development with a high-level domain-specific language
- Quantum Software Engineering: Landscapes and Horizons
- qTorch: The Quantum Tensor Contraction Handler
- Integration of Quantum Accelerators with High Performance Computing -- A Review of Quantum Programming Tools
- Applications of the Adversary Method in Quantum Query Algorithms
- Quantum Random Access Stored-Program Machines
- Translation of Quantum Circuits into Quantum Turing Machines for Deutsch and Deutsch-Jozsa Problems
- QSSA: An SSA-based IR for Quantum Computing
- Ultimate Intelligence Part I: Physical Completeness and Objectivity of Induction