Towards a High-Level Quantum Programming Language
February 22, 2005
Thorsten Altenkirch, University of Nottingham
Quantum programming tries to exploit the strange properties of quantum physics to run programs much faster than on any conventional hardware. A famous quantum algorithm is Shor's factorisation algorithm, which entails that on a quantum computer we can crack cryptosystems like RSA.
While nobody has yet built quantum hardware of interesting size, we are already trying to understand how to program quantum computers. Most of these approaches are based on quantum circuits which can be modelled by unitary operators on finite-dimensional complex Hilbert spaces. On this level it seems quite hard to understand what your algorithm is actually doing, and it is also difficult to design new ones.
Ongoing research as Nottingham (joint venture Mathematical Physics and Computer Science) attempts to overcome this by developing a functional quantum programming language (QML). The design of this language is inspired by comparing classical computation and quantum computation, identifying the similarities and differences. A draft paper on QML is available from my webpage (http://www.cs.nott.ac.uk/~txa/publ/qml-draft.pdf) and a compiler is under development. We are collaborating with Amr Sabry and Juliana Vizotto (Indiana U) on the constructive semantics and reasoning principles for QML.
(This is joint work with Jonathan Grattage.)
Co-sponsored by Laboratory for Secure Systems, New Jersey Institute for Trustworthy Enterprise Software, and the PORTIA project.