• Corpus ID: 59641708

A Procedural Formalism for Quantum Computing

  title={A Procedural Formalism for Quantum Computing},
  author={Bernhard {\"O}mer},
Despite many common concepts with classical computer science, quantum computing is still widely considered as a special discipline within the broad field of theoretical physics. One reason for the slow adoption of QC by the computer science community is the confusing variety of formalisms (Dirac notation, matrices, gates, operators, etc.), none of which has any similarity with classical programming languages, as well as the rather “physical” terminology in most of the available literature. QCL… 
A Brief Survey of Quantum Programming Languages
This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its beginnings in 1982, when Paul
N ov 2 00 2 Classical Concepts in Quantum Programming
This paper investigates, how classical concepts like hardware abstraction, hierarchical programs, data types, memory management, flow of control and structured programming can be used in quantum computing.
A Symbolic Classical Computer Language for Simulation of Quantum Algorithms
The present paper is devoted to the adaptation of the Mathematica symbolic language to known quantum algorithms and corresponding simulation on the classical computer.
Qumin, a minimalist quantum programming language
This work describes both the language's theoretical foundations in terms of lambda calculi and linear type systems, and more practical matters such as implementations of algorithms and useful programming tools that streamline the interaction of the classical and quantum fragments of a program.
High-level Structures for Quantum Computing
This book provides an introduction to abstract models of computation used in quantum information theory and introduces the models of Boolean circuits and Random Access Machine to present quantum programming techniques and quantum programming languages.
A New Algebraic Foundation for Quantum Programming Languages
A new algebraic formalism is presented that supports abstractions for reasoning about quantum effects and indicates important quantum properties explicitly rather than focusing solely on describing a physical system.
QCOR: A Language Extension Specification for the Heterogeneous Quantum-Classical Model of Computation
The high level of abstraction in the developed language is intended to accelerate the adoption of quantum computing by researchers familiar with classical HPC and strives to build on best practices of high performance computing (HPC).
1 8 Ju l 2 00 5 Semantics of a pure quantum programming language
It is proved that the two viewpoints of quantum programs – super-operators on density matrices and healthy transformers on quantum predicates – are equivalent, which gives a complete characterization of physically realizable quantum programs in terms of healthy quantum predicate transformers.
Semantics of a purely quantum programming language
It is shown that quantum programs can be treated as either super-operators on density matrices or healthy transformers on quantum predicates, which gives a complete characterization of physically realizable quantum programs in terms of healthy quantum predicate transformers.
Toward an architecture for quantum programming
A template high level quantum language is presented which complements a generic general purpose classical language with a set of quantum primitives, and easily lends itself to automatic, hardware independent, circuit simplification.


Efficient networks for quantum factoring.
The number of memory quantum bits (qubits) and the number of operations required to perform factorization, using the algorithm suggested by Shor are estimated.
Algorithms for quantum computation: discrete logarithms and factoring
  • P. Shor
  • Computer Science
    Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored are given.
Quantum computational networks
  • D. Deutsch
  • Physics, Computer Science
    Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences
  • 1989
The theory of quantum computational networks is the quantum generalization of the theory of logic circuits used in classical computing machines, and a single type of gate, the universal quantum gate, together with quantum ‘unit wires' is adequate for constructing networks with any possible quantum computational property.
An approximate Fourier transform useful in quantum factoring", IBM Research Report RC19642 ,; R. Cle
We define an approximate version of the Fourier transform on $2^L$ elements, which is computationally attractive in a certain setting, and which may find application to the problem of factoring
Quantum Computations with Cold Trapped Ions.
A quantum computer can be implemented with cold ions confined in a linear trap and interacting with laser beams, where decoherence is negligible, and the measurement can be carried out with a high efficiency.
An Introduction to the Theory of Numbers
THIS book must be welcomed most warmly into X the select class of Oxford books on pure mathematics which have reached a second edition. It obviously appeals to a large class of mathematical readers.
An Introduction to the Theory of Numbers
This is the fifth edition of a work (first published in 1938) which has become the standard introduction to the subject. The book has grown out of lectures delivered by the authors at Oxford,
Foundations of Computing, chap. 12: “Frontiers - Quantum Computing
  • 1998
Evaluation Errors . . . . . . . . . . . . . . . . . . . . . 89 B.2.3 Execution Errors
  • Evaluation Errors . . . . . . . . . . . . . . . . . . . . . 89 B.2.3 Execution Errors