It looks like you're new here. If you want to get involved, click one of these buttons!
Quipper has a language independent design referred to as an idiom. It is an embeeded EDSL, embedded in Haskell. Because Haskell does not support dependent- or linear types, certain well-formedness properties of programs have to be checked at runtime.
The software's quantum computer targets include:
It does not however target the quantum adiabatic evolution model supported by the D-Wave architecture.
Both classical and quantum wires can be defined.
Quipper is a recently developed programming language for expressing quantum computations. This paper gives a brief tutorial in- troduction to the language, through a demonstration of how to make use of some of its key features. We illustrate many of Quipper’s language features by developing a few well known examples of Quantum computa- tion, including quantum teleportation, the quantum Fourier transform, and a quantum circuit for addition.
The field of quantum algorithms is vibrant. Still, there is currently a lack of programming languages for describing quantum computation on a practical scale, i.e., not just at the level of toy problems. We address this issue by introducing Quipper, a scalable, expressive, functional, higher-order quantum programming language. Quipper has been used to program a diverse set of non-trivial quantum algorithms, and can generate quantum gate representations using trillions of gates. It is geared towards a model of computation that uses a classical computer to control a quantum device, but is not dependent on any particular model of quantum hardware. Quipper has proven effective and easy to use, and opens the door towards using formal methods to analyze quantum algorithms.