An Introduction to Quantum Programming in Quipper

@inproceedings{Green2013AnIT,
  title={An Introduction to Quantum Programming in Quipper},
  author={Alexander S. Green and Peter LeFanu Lumsdaine and Neil J. Ross and Peter Selinger and Beno{\^i}t Valiron},
  booktitle={RC},
  year={2013}
}
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. 
Five reversible quantum gates in Quipper
TLDR
This work uses the Quipper framework to demonstrate the implementation of five non-trivial reversible gates and uses a Quipper simulator to run a simulation for each gate on a classical computer.
Quantum Programming Language: A Systematic Review of Research Topic and Top Cited Languages
Quantum programming is an emerging area developed in last 2 decades from the multidisciplinary research on quantum computing. Quantum computing combines the idea of Quantum Mechanics, Mathematics and
Towards Automatically Construct Quantum Circuits for Quantum Programs with Quantum Control
TLDR
It is figured out that in fact, [qif] clause is a quantum multiplexor (QMUX) and can be implemented with the help of construction arbitrary two-dimensional controlled-unitary using Z-Y rotation using LIQUi|>.
Posner computing: a quantum neural network model in Quipper
We present a construction, rendered in Quipper, of a quantum algorithm which probabilistically computes a classical function from n bits to n bits. The construction is intended to be of interest
Posner computing: a quantum neural network model
TLDR
A construction of a quantum algorithm which probabilistically computes a classical function from n bits to n bits is presented, rendered in Quipper, as a simplest example of a particular quantum neural network which is inspired by recent work of Fisher concerning possible quantum substrates to cognition.
Quantum Programming Languages
Quantum algorithms are often presented as a mixture of mathematical equations, unitary matrices, circuit diagrams, and narrative text, which describe what the algorithm does and argue for its
Quantum Markov Chain Semantics for Quip-E Programs
TLDR
This work defines a structural operational semantics for the Quip-E language corresponding to quantum Markov chains, and uses it as a basis for analysing quantum programs through the QPMC model checker.
A heterogeneous quantum computer architecture
TLDR
This paper presents a complete system stack describing the different layers when building a quantum computer and presents the control logic and corresponding data path that needs to be implemented when executing quantum instructions.
Quantum Calculi—From Theory to Language Design
TLDR
This survey focuses on the QRAM (Quantum Random Access Machine) architectural model and provides the higher-order encoding in the functional languages qPCF and IQu of the well known Deutsch-Jozsa and Simon’s algorithms.
Q WIRE : A QRAM-Inspired Quantum Circuit Language
We introduce QWIRE, a linearly typed, strongly normalizing language for quantum circuits inspired by the QRAM model for quantum computing. We demonstrate the type-safety of the language and consider
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 23 REFERENCES
Quipper: a scalable quantum programming language
TLDR
Quipper, a scalable, expressive, functional, higher-order quantum programming language, which 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.
Quantum programming languages: survey and bibliography
  • S. Gay
  • Computer Science
    Mathematical Structures in Computer Science
  • 2006
TLDR
The study of quantum Programming languages is justified, the basics of quantum computing are presented, the literature in quantum programming languages is surveyed, and directions for future research are indicated.
Addition on a Quantum Computer
A new method for computing sums on a quantum computer is introduced. This technique uses the quantum Fourier transform and reduces the number of qubits necessary for addition by removing the need for
Quantum computation and quantum information
  • T. Paul
  • Mathematics, Computer Science
    Mathematical Structures in Computer Science
  • 2007
This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers deal
The Quantum IO Monad
TLDR
The Quantum IO monad is a purely functional interface to quantum programming implemented as a Haskell library that provides a constructive semantics of quantum programming and presents a complete implementation of Shor’s algorithm.
A Procedural Formalism for Quantum Computing
TLDR
QCL (Quantum Computation Language) is a hight level, architecture independent programming language for quantum computers, with a syntax derived from classical procedural languages like C or Pascal, which allows for the complete implementation and simulation of quantum algorithms in one consistent formalism.
Semantic Techniques in Quantum Computation
TLDR
This book explores quantum computation from the perspective of the branch of theoretical computer science known as semantics, as an alternative to the more well-known studies of algorithmics, complexity theory, and information theory.
Quantum programming languages: survey and bibliography
The field of quantum programming languages is developing rapidly and there is a surprisingly large literature. Research in this area includes the design of programming languages for quantum computi...
Simulation of electronic structure Hamiltonians using quantum computers
Over the last century, a large number of physical and mathematical developments paired with rapidly advancing technology have allowed the field of quantum chemistry to advance dramatically. However,
Exponential algorithmic speedup by a quantum walk
TLDR
A black box graph traversal problem that can be solved exponentially faster on a quantum computer than on a classical computer is constructed and it is proved that no classical algorithm can solve the problem in subexponential time.
...
1
2
3
...