HackerPapers

arXiv:1304.3390cs.PL

Quipper: A Scalable Quantum Programming Language

Alexander S. Green, Peter LeFanu Lumsdaine, Neil J. Ross, Peter Selinger, Benoît Valiron

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

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.

arXiv comments
10 pages, PLDI 2013
Journal reference
ACM SIGPLAN Notices 48(6):333-342, 2013
DOI
doi:10.1145/2499370.2462177
Subjects
cs.PLProgramming Languages cs.ETEmerging Technologies quant-phQuantum Physics

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Jul 2013 to Jul 2013. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.