Quipper: A Scalable Quantum Programming Language

被引:244
作者
Green, Alexander S. [1 ]
Lumsdaine, Peter LeFanu
Ross, Neil J. [1 ]
Selinger, Peter [1 ]
Valiron, Benoit [2 ]
机构
[1] Dalhousie Univ, Halifax, NS B3H 3J5, Canada
[2] Univ Penn, Philadelphia, PA 19104 USA
关键词
Quipper; Quantum Programming Languages; LAMBDA-CALCULUS; COMPUTATION;
D O I
10.1145/2499370.2462177
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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.
引用
收藏
页码:333 / 342
页数:10
相关论文
共 22 条
[1]   ANY AND-OR FORMULA OF SIZE N CAN BE EVALUATED IN TIME N1/2+o(1) ON A QUANTUM COMPUTER [J].
Ambainis, A. ;
Childs, A. M. ;
Reichardt, B. W. ;
Spalek, R. ;
Zhang, S. .
SIAM JOURNAL ON COMPUTING, 2010, 39 (06) :2513-2530
[2]  
[Anonymous], QUANTPH0310134
[3]  
[Anonymous], P HASK WORKSH
[4]  
[Anonymous], IARPABAA1002
[5]  
[Anonymous], P 28 S THEOR ASP COM
[6]  
[Anonymous], 2009, Semantic Techniques in Quantum Computation, DOI [10.1017/CBO9781139193313.005, DOI 10.1017/CBO9781139193313.005]
[7]  
[Anonymous], P 35 ANN S FDN COMP
[8]  
[Anonymous], J ACM
[9]  
[Anonymous], 2001, THESIS CHALMERS U TE
[10]  
[Anonymous], SEMANTIC TECHNIQUES