• A high-level circuit description language. This includes gate-by-gate descriptions of circuit fragments, as well as powerful operators for assembling and manipulating circuits.
• A syntax that allows a mixture of procedural and declarative programming styles.
• Built-in facilities for automatic synthesis of reversible quantum circuits, including from classical code.
• Support for hierarchical circuits.
• Extensible quantum data types.
• Programmable circuit transformers.
• Support for three execution phases: compile time, circuit generation time, and circuit execution time. A dynamic lifting operation to allow circuit generation to be parametric on values generated at circuit execution time.
• Extensive libraries of quantum functions, including: libraries for quantum integer and fixed-point arithmetic; the Quantum Fourier transform; an efficient Qram implementation; libraries for simulation of pseudo-classical circuits, Stabilizer circuits, and arbitrary circuits; libraries for exact and approximate decomposition of circuits into specific gate sets.

• Childs et al.'s Boolean Formula algorithm.
• Childs et al.'s quantum walk algorithm on Binary Welded Trees.
• Hallgren's Class Number algorithm.
• Whitfield et al.'s Ground State Estimation algorithm.
• Harrow et al.'s Quantum Linear Systems algorithm.
• Magniez et al.'s Triangle Finding algorithm.
• Regev and Kuperberg's Unique Shortest Vector algorithm.

• Programming your quantum computer, by Brian Hayes. American Scientist, January-February 2014.
• New language helps quantum coders build killer apps, by Sophie Hebden. New Scientist, 5 July 2013.

• An Introduction to Quantum Programming in Quipper. A tutorial-style introduction to Quipper via programming examples.
• Quipper: A Scalable Quantum Programming Language. A detailed look at Quipper's design rationale and its major features.
• Quipper online documentation. This is the starting point for browsing the source code, libraries, and algorithm implementations. Includes detailed descriptions of all Quipper operators and data types.

• Loading Classical Data into a Quantum Computer by John A. Cortese and Timothy M. Braje.
• Toward the first quantum simulation with quantum speedup by Andrew M. Childs, Dmitri Maslov, Yunseong Nam, Neil J. Ross, and Yuan Su. .
• Towards Quantum Programs Verification: From Quipper Circuits to QPMC by Linda Anticoli, Carla Piazza, Leonardo Taglialegne, and Paolo Zuliani.
• Algorithm for the solution of the Dirac equation on digital quantum computers, by François Fillion-Gourdeau, Steve MacLean, and Raymond Laflamme. This paper describes a quantum algorithm for solving a time-dependent Dirac equation. The authors use Quipper for determining resource requirements.
• Generating reversible circuits from higher-order functional programs by Benoîit Valiron.
• Concrete resource analysis of the quantum linear-system algorithm used to compute the electromagnetic scattering cross section of a 2D target by Artur Scherer, Benoît Valiron, Siun-Chuon Mau, Scott Alexander, Eric van den Berg, and Thomas E. Chapuran. A detailed resource analysis of the quantum linear systems algorithm using Quipper.
• Concrete Resource Estimation in Quantum Algorithms by Jonathan M. Smith, Neil J. Ross, Peter Selinger, and Benoît Valiron.
• Programming the quantum future, by Benoît Valiron, Neil J. Ross, Peter Selinger, D. Scott Alexander, and Jonathan M. Smith. This paper lays out general requirements for a quantum programming language and highlights some of Quipper's features.

Release notes

Downloading

Installing

Version

Contributors

License