Quipper: a scalable quantum programming language

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, USA;Dalhousie University, Halifax, NS, Canada;Dalhousie University, Halifax, NS, Canada;University of Pennsylvania, Philadelphia, PA, USA
Venue:
Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
Year:
2013

Citing 11
Cited 3

Template meta-programming for Haskell

Proceedings of the 2002 ACM SIGPLAN workshop on Haskell
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
A Lambda Calculus for Quantum Computation

SIAM Journal on Computing
Quantum algorithms for the triangle problem

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A lambda calculus for quantum computation with classical control

Mathematical Structures in Computer Science
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)
Algorithms for quantum computation: discrete logarithms and factoring

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
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

QuaFL: a typed DSL for quantum programming

Proceedings of the 1st annual workshop on Functional programming concepts in domain-specific languages
Abstract resource cost derivation for logical quantum circuit descriptions

Proceedings of the 1st annual workshop on Functional programming concepts in domain-specific languages
An introduction to quantum programming in quipper

RC'13 Proceedings of the 5th international conference on Reversible Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.