A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Presheaf Models of Quantum Computation: An Outline
[chapter]
2013
Lecture Notes in Computer Science
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
doi:10.1007/978-3-642-38164-5_13
fatcat:vphga3zfbfa35kyhrhziem7bzi