A functional quantum programming language

@article{Grattage2005AFQ,
  title={A functional quantum programming language},
  author={Jonathan Grattage},
  journal={20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05)},
  year={2005},
  pages={249-258}
}
  • Jonathan Grattage
  • Published 11 September 2004
  • Computer Science
  • 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05)
We introduce the language QML, a functional language for quantum computations on finite types. Its design is guided by its categorical semantics: QML programs are interpreted by morphisms in the category FQC of finite quantum computations, which provides a constructive semantics of irreversible quantum computations realisable as quantum gates. QML integrates reversible and irreversible quantum computations in one language, using first order strict linear logic to make weakenings explicit… 
QML : Quantum data and control
TLDR
This work presents an operational semantics of QML programs using quantum circuits, and a denotational semantics using superoperators, and introduces the language QML, a functional language for quantum computations on finite types.
Compilation to quantum circuits for a language with quantum data and control
TLDR
A semantics for nQML is defined, which translates programs to quantum circuits in the category FQC of finite quantum computations, following the approach of Altenkirch and Grattage's QML.
Semantics and simulation of communication in quantum programming
TLDR
CQPL possesses a denotational semantics based on a partial order of superoperators and uses fixed points on a generalised Hilbert space to formalise the exchange of classical and quantum data between an arbitrary number of participants.
A lambda calculus for quantum computation with classical control
TLDR
A functional programming language for quantum computers, by extending the simply-typed lambda calculus with quantum types and operations, and gives a type system using affine intuitionistic linear logic.
A lambda calculus for quantum computation with classical control
TLDR
A functional programming language for quantum computers by extending the simply-typed lambda calculus with quantum types and operations, and gives a type system using affine intuitionistic linear logic.
Quantum Alternation: Prospects and Problems
TLDR
This work proposes a notion of quantum control in a quantum programming language which permits the superposition of finitely many quantum operations without performing a measurement, and shows that adding such a quantum IF statement to the QPL programming language simplifies the presentation of several quantum algorithms.
Semantics of a purely quantum programming language
TLDR
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.
Reversibility for Quantum Programming Language QML
TLDR
An extension of the denotational semantic model of the quantum programming language QML, to which computational reversibility is incorporated, and a history track is incorporated which allows reversibility in QML.
An Algebra of Pure Quantum Programming
Towards Automatically Construct Quantum Circuits for Quantum Programs with Quantum Control
TLDR
It is figured out that in fact, [qif] clause is a quantum multiplexor (QMUX) and can be implemented with the help of construction arbitrary two-dimensional controlled-unitary using Z-Y rotation using LIQUi|>.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 92 REFERENCES
Towards a quantum programming language
  • P. Selinger
  • Computer Science
    Mathematical Structures in Computer Science
  • 2004
TLDR
This paper describes the syntax and semantics of a simple quantum programming language with high-level features such as loops, recursive procedures, and structured data types, and has an interesting denotational semantics in terms of complete partial orders of superoperators.
Quantum Computation, Categorical Semantics and Linear Logic
TLDR
A type theory and denotational semantics are developed and provided for a simple fragment of the quantum lambda calculus, a formal language for quantum computation based on linear logic.
Operational semantics for formal tensorial calculus
TLDR
A functional language where all functions are linear operators by construction is defined, and the linear-algebraic -calculus hereby constructed is linear in a different (yet related) sense to that, say, of the linear -Calculus.
An Algebra of Pure Quantum Programming
A Lambda Calculus for Quantum Computation with Classical Control
TLDR
The main results of this paper are the safety properties of the language and the development of a type inference algorithm.
Structure and interpretation of quantum mechanics: a functional framework
TLDR
It is concluded that functional languages are right tools for formal computations in quantum physics by constructing effectively the tensor states for composed systems and a toy model of quantum circuit toolbox.
Quantum programming languages: survey and bibliography
  • S. Gay
  • Computer Science
    Mathematical Structures in Computer Science
  • 2006
TLDR
The study of quantum Programming languages is justified, the basics of quantum computing are presented, the literature in quantum programming languages is surveyed, and directions for future research are indicated.
Communicating quantum processes
TLDR
The syntax, operational semantics and type system of CQP are formally defined, and it is proved that the semantics preserves typing, and that typing guarantees that each qubit is owned by a unique process within a system.
Structuring quantum effects: superoperators as arrows
TLDR
The model of quantum computation based on density matrices and superoperators can be decomposed into a pure classical (functional) part and an effectful part modelling probabilities and measurement and expressed in the Haskell programming language using its special syntax for arrow computations.
Procedural Quantum Programming
TLDR
This paper investigates how the concept of procedural programming languages can be adopted to the field of quantum computing, and how non‐classical features like the reversibility of unitary transformations, the non‐observability of quantum states or the lack of copy and erase operations can be reflected semantically.
...
1
2
3
4
5
...