ncatlab.org

Quipper in nLab

Contents

Context

Computation

constructive mathematics, realizability, computability

intuitionistic mathematics

propositions as types, proofs as programs, computational trinitarianism

Constructive mathematics

Realizability

Computability

Quantum systems

quantum logic

quantum physics

quantum probability theoryobservables and states

quantum information

quantum technology

quantum computing

Type theory

natural deduction metalanguage, practical foundations

  1. type formation rule
  2. term introduction rule
  3. term elimination rule
  4. computation rule

type theory (dependent, intensional, observational type theory, homotopy type theory)

syntax object language

homotopy levels

semantics

Contents

Idea

Quipper is a functional quantum programming language, specifically a domain specific programming language for quantum circuits which is embedded into Haskell. As such it is similar to QWIRE.

References

Quipper landing page:

Precursors

Quipper has grown out of developments initiated in

and specifically the quantum lambda-calculus of:

[Selinger (2016):] When the QPL workshop series was first founded, it was called “Quantum Programming Languages”. One year I wasn’t participating, and while I wasn’t looking they changed the name to “Quantum Physics and Logic” — same acronym!

Back in those days in the early 21st century we were actually trying to do programming languages for quantum computing [[Selinger & Valiron 2004]], but the sad thing is: In those days nobody really cared. [...][...]

Now it’s 15 years later and several of these parameters have changed: There has been a renewed interest, from government agencies and also from companies who are actually building quantum computers. [...][...].

So now people are working on quantum programming languages again.

On categorical semantics on von Neumann algebras:

Quipper as such

Exposition of the general idea of quantum programming languages for classically controlled quantum computation with an eye towards the Quipper-language:

Original articles on Quipper:

Introduction and review:

Example algorithms:

  • Safat Siddiqui, Mohammed Jahirul Islam, Omar Shehab, Five Quantum Algorithms Using Quipper [arXiv:1406.4481]

On quantum software verification for/with Quipper:

  • Linda Anticoli, Carla Piazza, Leonardo Taglialegne, Paolo Zuliani, Towards Quantum Programs Verification: From Quipper Circuits to QPMC, In: Devitt S., Lanese I. (eds) Reversible Computation. RC 2016. Lecture Notes in Computer Science, vol 9720. Springer, Cham (doi:10.1007/978-3-319-40578-0_16)

Dependent linear types and categorical semantics

Discussion of some dependent linear type theory and categorical semantics for (proto-)Quipper:

Semantics on quantum CPOs (via quantum relations on quantum sets) for interpreting Quipper with term recursion:

Dynamic lifting

The issue of “dynamic lifting” (of “bits” resulting from quantum measurement back into the “context”):

Last revised on April 24, 2024 at 05:47:49. See the history of this page for a list of all contributions to it.