Models of quantum computation and quantum programming languages
From MaRDI portal
Publication:2250909
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.
Recommendations
Cites work
- A Lambda Calculus for Quantum Computation
- A single quantum cannot be cloned
- An Unsolvable Problem of Elementary Number Theory
- Bicontinuous extensions of invertible combinatorial functions
- Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
- Computability of Recursive Functions
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- Concepts in Programming Languages
- Functional and Logic Programming
- Game-theoretic discussion of quantum state estimation and cloning
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 5320343 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1161568 (Why is no real title available?)
- scientific article; zbMATH DE number 1178950 (Why is no real title available?)
- scientific article; zbMATH DE number 1393316 (Why is no real title available?)
- Introduction to algorithms
- One complexity theorist's view of quantum computing
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Programming in Haskell
- Progress in quantum algorithms
- Quantum algorithms for algebraic problems
- Quantum Complexity Theory
- Quantum computational networks
- Quantum computing
- Quantum cryptography based on Bell’s theorem
- Quantum cryptography: public key distribution and coin tossing
- Quantum Games and Quantum Strategies
- Quantum programming languages: survey and bibliography
- Quantum pseudo-telepathy
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum Walk Algorithm for Element Distinctness
- Quantum Walk Based Search Algorithms
- QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
- Rapid solution of problems by quantum computation
- Simulating and compiling code for the sequential quantum random access machine
- Spatial search and the Dirac equation
- Time bounded random access machines
- Towards a quantum programming language
- Universality in quantum computation
Cited in
(15)- Towards implementation of a generalized architecture for high-level quantum programming language
- Quantum walks: a comprehensive review
- Quantum random access stored-program machines
- Semantics of quantum programming languages: Classical control, quantum control
- Theory versus practice in annealing-based quantum computing
- Classical concepts in quantum programming
- Models in quantum computing: a systematic review
- Simulating and compiling code for the sequential quantum random access machine
- An introduction to one-way quantum computing in distributed architectures
- A web-based quantum computer simulator with symbolic extensions
- Quantum programming languages: survey and bibliography
- Towards a taxonomy for reversible computation approaches
- Foundations of quantum programming
- An interpreter for quantum circuits
- Quantum programming languages: a tentative study
This page was built for publication: Models of quantum computation and quantum programming languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2250909)
