The Quipper System

The Quipper System

This is the Quipper System, an embedded functional programming language for quantum computation. You can browse the source code and documentation from here.

User-level documentation:
The module Quipper is the public interface of the Quipper language. It contains all the functionality that should be accessed by user-level code.
Developer documentation:
The modules under Quipper.* contain the Quipper implementation. You can browse these to find out how Quipper works, what its internal data structures are, etc.
Algorithms:
These modules contain implementations of the GFI algorithms. Please click on the "Main" module of each algorithm to access its documentation.
QuipperLib:
These modules contain Quipper libraries, i.e., Quipper code that can be shared by several algorithms, but is not part of the Quipper programming language proper.
• Arith: Basic arithmetic functions on quantum integers. This includes the operations of addition, subtraction, multiplication, sign, absolute value, increment and decrement, comparison, division with remainder, and Euclid's algorithm. Currently, this is used by the Class Number and Triangle Finding algorithms.
• ClassicalOptim: Functions for optimizing classical circuits. This is intended to reduce the size of automatically-generated circuits, such as those that are built using Quipper's build_circuit keyword.
• Decompose: A library for decomposing circuits into particular gate sets.
• DynamicLiftings: Functions for performing dynamic liftings based on different mechanisms. For example, dynamic liftings can be based on simulated measurement outcomes, or just done at random.
• FPReal: Quantum implementation of fixed-precision real numbers. Includes addition, subtraction, multiplication, comparison, and logarithm. Currently, this is used by the Class Number algorithm.
• GateDecompositions: This library special decompositions of particular gates into particular gate bases. It also contains functions for decomposing multiple controls.
• QFT: An implementation of the Quantum Fourier transform. Since the Quantum Fourier transform is a component of phase estimation, this is used by several algorithms, including Ground State Estimation, Class Number, and Boolean Formula.
• QFTAdd: An implementation of Draper's ancilla-free addition circuit using the Quantum Fourier transform.
• Qram: Efficient implementation of random access of a quantum array by a quantum index.
• QuipperASCIIParser: A library for parsing Quipper's ASCII output and turning it back into a circuit. This library can be used as the basis for stand-alone tools that read and write circuits.
• Qureg: A library that provides quantum registers.
• Simulation: A library for simulating certain classes of circuits, for testing and debugging. Efficient simulation of classical circuits and stabilizer circuits; inefficient simulation of quantum circuits.
• Synthesis: A library integrating various exact and approximate synthesis algorithms into Quipper.
• Unboxing: Functions for “unboxing” hierarchical circuits, replacing calls to named subroutines by inlined copies of the subroutines themselves.
Libraries:
These modules contain general-purpose Haskell libraries, providing basic functionality that does not depend on Quipper, but that may be used by Quipper or other programs.
• Auxiliary: Provides various general-purpose auxiliary functions.
• CommandLine: This is a library to help with the processing of command line options. Since each algorithm has its own "main" function, it is useful to factor out some common functionality.
• PortableSignals: An attempt to provide a portable way to handle Ctrl-C.
• RandomSource: Provides a container class to hold sources of randomness.
• Sampling: Code to help with generating test cases. Currently the Binary Welded Tree and Triangle Finding implementations have the ability to run automated test suites.
• ShowAll: A useful trick for printing arbitrary values during debugging.
• Stabilizers: Implementation of the Stabilizer formalism, for efficient simulation of Clifford group circuits.
• Template: A library for lifting functions to a monad.
• Tuple: Auxiliary code for dealing with n-tuples.
• Typeable: Defines missing instances from Haskell's module Data.Typeable.
Programs: