An introduction to quantum programming in quipper

Authors:
Alexander S. Green;Peter LeFanu Lumsdaine;Neil J. Ross;Peter Selinger;Benoît Valiron
Affiliations:
Dalhousie University, Halifax, NS, Canada;Institute of Advanced Studies, Princeton, NJ;Dalhousie University, Halifax, NS, Canada;Dalhousie University, Halifax, NS, Canada;University of Pennsylvania, Philadelphia, PA
Venue:
RC'13 Proceedings of the 5th international conference on Reversible Computation
Year:
2013

Citing 8
Cited 0

Lava: hardware design in Haskell

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Exponential algorithmic speedup by a quantum walk

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Quantum Computation and Lattice Problems

SIAM Journal on Computing
Quantum programming languages: survey and bibliography

Mathematical Structures in Computer Science
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem

Journal of the ACM (JACM)
Any AND-OR Formula of Size $N$ Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer

SIAM Journal on Computing
Quantum Computation and Quantum Information: 10th Anniversary Edition

Quantum Computation and Quantum Information: 10th Anniversary Edition
Quipper: a scalable quantum programming language

Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Quipper is a recently developed programming language for expressing quantum computations. This paper gives a brief tutorial introduction 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 computation, including quantum teleportation, the quantum Fourier transform, and a quantum circuit for addition.