skip to main content
research-article

Applying quantitative semantics to higher-order quantum computing

Published:08 January 2014Publication History
Skip Abstract Section

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.

Skip Supplemental Material Section

Supplemental Material

d3_right_t8.mp4

References

  1. V. Danos and T. Ehrhard. Probabilistic coherence spaces as a model of higher-order probabilistic computation. Inform. Comput., 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. T. Ehrhard. Finiteness spaces. MSCS, 15(4):615--646, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J.-Y. Girard. Linear logic. Th. Comp. Sc., 50:1--102, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. J.-Y. Girard. Normal functors, power series and lambda-calculus. Ann. Pure Appl. Logic, 37(2):129--177, 1988.Google ScholarGoogle ScholarCross RefCross Ref
  5. J.-Y. Girard. Coherent Banach spaces: a continuous denotational semantics. Theoretical Computer Science, 227:297, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. I. Hasuo and N. Hoshino. Semantics of higher-order quantum computation via geometry of interaction. In Proceedings of LICS, pages 237--246, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. K. Keimel and J. D. Lawson. D-completions and the d-topology. Annals of Pure and Applied Logic, 159(3):292--306, 2009.Google ScholarGoogle ScholarCross RefCross Ref
  8. E. H. Knill. Conventions for quantum pseudocode. Technical Report LAUR-96-2724, Los Alamos National Laboratory, 1996.Google ScholarGoogle ScholarCross RefCross Ref
  9. Y. Lafont. Logiques, catégories et machines. PhD thesis, Université Paris 7, 1988.Google ScholarGoogle Scholar
  10. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. Laird, G. Manzonetto, and G. McCusker. Constructing differential categories and deconstructing categories of games. Information and Computation, 222:247--264, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. J. Laird, G. McCusker, G. Manzonetto, and M. Pagani. Weighted relational models of typed lambda-calculi. In LICS'13, 2013.Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. S. Mac Lane. Categories for the Working Mathematician. Springer, 2nd edition, Sept. 1998.Google ScholarGoogle Scholar
  14. O. Malherbe. Categorical models of computation: partially traced categories and presheaf models of quantum computation. PhD thesis, University of Ottawa, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. P.-A. Melliès. Categorical semantics of linear logic. Panoramas et Synthèses, 12, 2009.Google ScholarGoogle Scholar
  16. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  17. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. P. Selinger. Towards a quantum programming language. Mathematical Structures in Computer Science, 14(4):527--586, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. P. Selinger. Towards a semantics for higher-order quantum computation. In QPL'04, TUCS Gen. Publi. No 33, pages 127--143, 2004.Google ScholarGoogle Scholar
  20. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  21. P. Selinger and B. Valiron. On a fully abstract model for a quantum linear functional language. In QPL'06, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. 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 ScholarGoogle Scholar
  23. B. Valiron. Semantics for a higher-order functional programming language for quantum computation. PhD thesis, Univ. of Ottawa, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. D. Zhao and T. Fan. Dcpo-completion of posets. Th. Comp. Sc., 411 (22-24):2167--2173, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Applying quantitative semantics to higher-order quantum computing

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!