Despite the rich literature on quantum algorithms, there is a surprisingly small amount of coverage of their concrete logical design and implementation. Most resource estimation is done at the level of complexity analysis, but actual concrete numbers (of quantum gates, qubits, etc.) can differ by orders of magnitude. The line of work we present here is a formal framework to write, and reason about, quantum algorithms. Specifically, we designed a language, Quipper, with scalability in mind, and we are able to report actual resource counts for seven non-trivial algorithms found in the quantum computer science literature.

UR - http://arxiv.org/abs/1412.0625v1 ER - TY - JOUR T1 - An Introduction to Quantum Programming in Quipper JF - Lecture Notes in Computer Science Y1 - 2013 A1 - Alexander S. Green A1 - Peter LeFanu Lumsdaine A1 - Neil J. Ross A1 - Peter Selinger A1 - Benoît Valiron AB - 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. VL - 7948 U4 - 110-124 SN - 978-3-642-38986-3 UR - http://arxiv.org/abs/1304.5485v1 J1 - Lecture Notes in Computer Science 7948:110-124 U5 - 10.1007/978-3-642-38986-3_10 ER - TY - JOUR T1 - Quipper: A Scalable Quantum Programming Language JF - ACM SIGPLAN Notices Y1 - 2013 A1 - Alexander S. Green A1 - Peter LeFanu Lumsdaine A1 - Neil J. Ross A1 - Peter Selinger A1 - Benoît Valiron AB -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.

VL - 48 U4 - 333-342 UR - http://arxiv.org/abs/1304.3390v1 CP - 6 J1 - SIGPLAN Not. U5 - 10.1145/2499370.2462177 ER -