A Categorical Model for a Quantum Circuit Description Language (Extended Abstract)

Francisco Rios
(Dalhousie University, Halifax, Canada)
Peter Selinger
(Dalhousie University, Halifax, Canada)

Quipper is a practical programming language for describing families of quantum circuits. In this paper, we formalize a small, but useful fragment of Quipper called Proto-Quipper-M. Unlike its parent Quipper, this language is type-safe and has a formal denotational and operational semantics. Proto-Quipper-M is also more general than Quipper, in that it can describe families of morphisms in any symmetric monoidal category, of which quantum circuits are but one example. We design Proto-Quipper-M from the ground up, by first giving a general categorical model of parameters and state. The distinction between parameters and state is also known from hardware description languages. A parameter is a value that is known at circuit generation time, whereas a state is a value that is known at circuit execution time. After finding some interesting categorical structures in the model, we then define the programming language to fit the model. We cement the connection between the language and the model by proving type safety, soundness, and adequacy properties.

In Bob Coecke and Aleks Kissinger: Proceedings 14th International Conference on Quantum Physics and Logic (QPL 2017), Nijmegen, The Netherlands, 3-7 July 2017, Electronic Proceedings in Theoretical Computer Science 266, pp. 164–178.
Published: 27th February 2018.

ArXived at: http://dx.doi.org/10.4204/EPTCS.266.11 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org