#### Filter Results:

#### Publication Year

2005

2012

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

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… (More)

- Jonathan Grattage, Thorsten Altenkirch
- 2005

We introduce a compiler for the functional quantum programming language QML [1], developed in Haskell. The compiler takes QML expressions as input and outputs a representation of quantum circuits (via the category FQC of finite quantum computations) which can be simulated by the simulator presented here, or by using a standard simulator for quantum gates.… (More)

- Jonathan Grattage, Thorsten Altenkirch, Alex Green
- 2006

QML: A functional quantum programming language – p.1/14

We develop a sound and complete equational theory for the functional quantum programming language QML. The soundness and completeness of the theory are with respect to the previously developed denotational semantics of QML. The completeness proof also gives rise to a normalisation algorithm following the normalisation-by-evaluation approach. The current… (More)

- Thorsten Altenkirch, Jonathan Grattage
- 2005

We introduce the language QML, a functional language for quantum computations on finite types. QML introduces quantum data and control structures, and integrates reversible and irreversible quantum computation. QML is based on strict linear logic, hence weakenings, which may lead to decoherence, have to be explicit. We present an operational semantics of… (More)

We describe an n-dimensional quantum cellular automaton (QCA) capable of simulating all others, in that the initial configuration and the forward evolution of any n-dimensional QCA can be encoded within the initial configuration of the universal QCA. Several steps of the universal QCA then correspond to one step of the simulated QCA. The simulation… (More)

There have been several non-axiomatic approaches taken to define quantum cellular automata (QCA). Partitioned QCA (PQCA) are the most canonical of these non-axiomatic definitions. In this work we show that any QCA can be put into the form of a PQCA. Our construction reconciles all the non-axiomatic definitions of QCA, showing that they can all simulate one… (More)

This paper demonstrates how to add a measurement operator to quantum λ-calculi. A proof of the consistency of the semantics is given through a proof of confluence presented in a sufficiently general way to allow this technique to be used for other languages. The method described here may be applied to probabilistic rewrite systems in general, and to add… (More)

This research describes a three dimensional quantum cellular automaton (QCA) which can simulate all other 3D QCA. This intrinsically universal QCA belongs to the simplest subclass of QCA: Partitioned QCA (PQCA). PQCA are QCA of a particular form, where incoming information is scattered by a fixed uni-tary U before being redistributed and rescattered. Our… (More)