Paper Info
Title
Presheaf Models of Quantum Computation: An Outline.
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.
Year
DOI
Venue
2013
10.1007/978-3-642-38164-5_13
Computation, Logic, Games, and Quantum Foundations
Field
DocType
ISSN
Discrete mathematics,Topology,Lambda calculus,Open problem,Monoidal category,Algebra,Denotational semantics,Quantum computer,Functor,Presheaf,Linear logic,Mathematics
Conference
Lecture Notes in Computer Science 7860:178-194, 2013
Citations 
PageRank 
References 
8
0.51
14
Authors
3
Name
Order
Citations
PageRank
Octavio Malherbe180.84
Philip Scott280.84
Peter Selinger343436.65