Quipper
Alexander S. Green, Peter LeFanu Lumsdaine, Neil J. Ross et al. · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · 2013
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.
Cited by 334 works. doi:10.1145/2491956.2462177
Authors
References
- Quantum Computation and Quantum Information
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Algorithms for quantum computation: discrete logarithms and factoring
- Quantum Algorithm for Linear Systems of Equations
- Quantum Computation and Quantum Information: 10th Anniversary Edition
- Exponential algorithmic speedup by a quantum walk
- Template meta-programming for Haskell
- Simulation of electronic structure Hamiltonians using quantum computers
- Conventions for quantum pseudocode
- Simulation of Electronic Structure Hamiltonians Using Quantum Computers