Presheaf models of quantum computation: an outline release_xv4rzpvw4bdlro6eun33wetnoi

by Octavio Malherbe, Philip Scott, Peter Selinger

Released as a article .

2013  

Abstract

This paper outlines the construction of categorical models of higher-order quantum computation. We construct a concrete denotational semantics of Selinger and Valiron's quantum lambda calculus, which was previously an open problem. We do this by considering presheaves over appropriate base categories arising from first-order quantum computation. The main technical ingredients are Day's convolution theory and Kelly and Freyd's notion of continuity of functors. We first give an abstract description of the properties required of the base categories for the model construction to work. We then exhibit a specific example of base categories satisfying these properties.
In text/plain format

Archived Files and Locations

application/pdf  248.2 kB
file_6mvfcolhavbo3ifyoy2ewskm44
archive.org (archive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2013-02-22
Version   v1
Language   en ?
arXiv  1302.5652v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 5f7bba13-e2ce-43e0-8009-ededb1564ec0
API URL: JSON