Quipper: a scalable quantum programming language

By Alexander S. Green, Peter LeFanu Lumsdaine, Neil J. Ross, Peter Selinger, Benoît Valiron. ACM-SIGPLAN Symposium on Programming Language Design and Implementation, 2013

486 citations recorded by the source corpus.

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.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/12c74cb1e4dc99da553b7c222df7669bea26087b

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Yuan Su
  2. Daniel J. Egger
  3. Stefan Woerner
  4. Neil J. Ross
  5. Ali Javadi-Abhari
  6. Y. Nam
  7. Dmitri Maslov
  8. Lev S. Bishop

In Computational Theory and Mathematics

  1. Yuan Su
  2. Dmitri Maslov
  3. Andrew M. Childs
  4. Y. Nam
  5. Krysta Marie Svore
  6. Neil J. Ross
  7. Matthias Troyer
  8. Robert Wille

Citations in the corpus