Abstract
Finding a denotational semantics for higher order quantum computation is a long-standing problem in the semantics of quantum programming languages. Most past approaches to this problem fell short in one way or another, either limiting the language to an unusably small finitary fragment, or giving up important features of quantum physics such as entanglement. In this paper, we propose a denotational semantics for a quantum lambda calculus with recursion and an infinite data type, using constructions from quantitative semantics of linear logic.
Supplemental Material
- V. Danos and T. Ehrhard. Probabilistic coherence spaces as a model of higher-order probabilistic computation. Inform. Comput., 2011. Google Scholar
Digital Library
- T. Ehrhard. Finiteness spaces. MSCS, 15(4):615--646, 2005. Google Scholar
Digital Library
- J.-Y. Girard. Linear logic. Th. Comp. Sc., 50:1--102, 1987. Google Scholar
Digital Library
- J.-Y. Girard. Normal functors, power series and lambda-calculus. Ann. Pure Appl. Logic, 37(2):129--177, 1988.Google Scholar
Cross Ref
- J.-Y. Girard. Coherent Banach spaces: a continuous denotational semantics. Theoretical Computer Science, 227:297, 1999. Google Scholar
Digital Library
- I. Hasuo and N. Hoshino. Semantics of higher-order quantum computation via geometry of interaction. In Proceedings of LICS, pages 237--246, 2011. Google Scholar
Digital Library
- K. Keimel and J. D. Lawson. D-completions and the d-topology. Annals of Pure and Applied Logic, 159(3):292--306, 2009.Google Scholar
Cross Ref
- E. H. Knill. Conventions for quantum pseudocode. Technical Report LAUR-96-2724, Los Alamos National Laboratory, 1996.Google Scholar
Cross Ref
- Y. Lafont. Logiques, catégories et machines. PhD thesis, Université Paris 7, 1988.Google Scholar
- U. D. Lago, A.Masini, andM. Zorzi. Confluence results for a quantum lambda calculus with measurements. Electr. Notes Theor. Comput. Sci., 270(2):251--261, 2011. Google Scholar
Digital Library
- J. Laird, G. Manzonetto, and G. McCusker. Constructing differential categories and deconstructing categories of games. Information and Computation, 222:247--264, 2013. Google Scholar
Digital Library
- J. Laird, G. McCusker, G. Manzonetto, and M. Pagani. Weighted relational models of typed lambda-calculi. In LICS'13, 2013.Google Scholar
Digital Library
- S. Mac Lane. Categories for the Working Mathematician. Springer, 2nd edition, Sept. 1998.Google Scholar
- O. Malherbe. Categorical models of computation: partially traced categories and presheaf models of quantum computation. PhD thesis, University of Ottawa, 2010. Google Scholar
Digital Library
- P.-A. Melliès. Categorical semantics of linear logic. Panoramas et Synthèses, 12, 2009.Google Scholar
- P.-A. Melliès, N. Tabareau, and C. Tasson. An explicit formula for the free exponential modality of linear logic. In ICALP'09 (2), pages 247--260, 2009. Google Scholar
Digital Library
- M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2002. Google Scholar
Digital Library
- P. Selinger. Towards a quantum programming language. Mathematical Structures in Computer Science, 14(4):527--586, 2004. Google Scholar
Digital Library
- P. Selinger. Towards a semantics for higher-order quantum computation. In QPL'04, TUCS Gen. Publi. No 33, pages 127--143, 2004.Google Scholar
- P. Selinger and B. Valiron. A lambda calculus for quantum computation with classical control. Mathematical Structures in Computer Science, 16(3):527--552, 2006. Google Scholar
Digital Library
- P. Selinger and B. Valiron. On a fully abstract model for a quantum linear functional language. In QPL'06, 2008. Google Scholar
Digital Library
- P. Selinger and B. Valiron. Quantum lambda calculus. In S. Gay and I.Mackie, editors, Semantic Techniques in Quantum Computation, chapter 9, pages 135--172. Cambridge University Press, 2009.Google Scholar
- B. Valiron. Semantics for a higher-order functional programming language for quantum computation. PhD thesis, Univ. of Ottawa, 2008. Google Scholar
Digital Library
- D. Zhao and T. Fan. Dcpo-completion of posets. Th. Comp. Sc., 411 (22-24):2167--2173, 2010. Google Scholar
Digital Library
Index Terms
Applying quantitative semantics to higher-order quantum computing
Recommendations
Applying quantitative semantics to higher-order quantum computing
POPL '14: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming LanguagesFinding a denotational semantics for higher order quantum computation is a long-standing problem in the semantics of quantum programming languages. Most past approaches to this problem fell short in one way or another, either limiting the language to an ...
A first-order epistemic quantum computational semantics with relativistic-like epistemic effects
Quantum computation has suggested new forms of quantum logic, called quantum computational logics. In these logics well-formed formulas are supposed to denote pieces of quantum information: possible pure states of quantum systems that can store the ...
Semantics of Higher-Order Quantum Computation via Geometry of Interaction
LICS '11: Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer ScienceWhile much of the current study on quantum computation employs low-level formalisms such as quantum circuits, several high-level languages/calculi have been recently proposed aiming at structured quantum programming. The current work contributes to the ...







Comments