skip to main content
research-article

The geometry of parallelism: classical, probabilistic, and quantum effects

Published:01 January 2017Publication History
Skip Abstract Section

Abstract

We introduce a Geometry of Interaction model for higher-order quantum computation, and prove its adequacy for a fully fledged quantum programming language in which entanglement, duplication, and recursion are all available.

This model is an instance of a new framework which captures not only quantum but also classical and probabilistic computation. Its main feature is the ability to model commutative effects in a parallel setting. Our model comes with a multi-token machine, a proof net system, and a -style language. Being based on a multi-token machine equipped with a memory, it has a concrete nature which makes it well suited for building low-level operational descriptions of higher-order languages.

References

  1. K. de Leeuw, E. F. Moore, et al. Computability by probabilistic machine. In Automata Studies. Princeton U. Press, 1955.Google ScholarGoogle Scholar
  2. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press, 10th edition, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. G. L. Miller. Riemann’s hypothesis and tests for primality. In STOC, pages 234–239, 1975. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. M. O. Rabin. Probabilistic algorithm for testing primality. Journal of Number Theory, 12(1):128 – 138, 1980.Google ScholarGoogle ScholarCross RefCross Ref
  5. P. W. Shor. Algorithms for quantum computation: Discrete logarithms and factoring. In SFCS, pages 124–134, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. D. Whitfield, J. Biamonte, and A. Aspuru-Guzik. Simulation of electronic structure hamiltonians using quantum computers. Molecular Physics, 109(5):735–750, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  7. A. W. Harrow, A. Hassidim, and S. Lloyd. Quantum algorithm for linear systems of equations. Phys. Rev. Lett., 103:150502, Oct 2009.Google ScholarGoogle ScholarCross RefCross Ref
  8. D. Kozen. Semantics of probabilistic programs. Journal of Computer System Sciences, 22:328–350, 1981.Google ScholarGoogle ScholarCross RefCross Ref
  9. G. Plotkin. Probabilistic powerdomains. In CAAP, 1982.Google ScholarGoogle Scholar
  10. S. J. Gay. Quantum programming languages: survey and bibliography. Mathematical Structures in Computer Science, 16(4):581–600, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. P. Selinger and B. Valiron. A lambda calculus for quantum computation with classical control. Math. Struct. in Comp. Sc., 16(3):527–552, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. A. S. Green, P. LeFanu Lumsdaine, et al. Quipper: A scalable quantum programming language. In PLDI, pages 333–342, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. M. Pagani, P. Selinger, and B. Valiron. Applying quantitative semantics to higher-order quantum computing. In POPL, pages 647–658, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. J.-Y. Girard. Linear logic. Theor. Comput. Sci., 50:1–102, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for PCF. Inf. Comput., 163(2):409–470, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. J. M. E. Hyland and C.-H. Luke Ong. On full abstraction for PCF: I, II, and III. Inf. Comput., 163(2):285–408, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. J.-Y. Girard. Geometry of interaction I: Interpretation of system F. Logic Colloquium 88, 1989.Google ScholarGoogle Scholar
  18. Y. Lafont. Logiques, catégories et machines. PhD thesis, Université Paris 7, 1988.Google ScholarGoogle Scholar
  19. P.-A. Melliès. Categorical semantics of linear logic. Panoramas et Synthèses, 12, 2009.Google ScholarGoogle Scholar
  20. P. Selinger. Towards a quantum programming language. Math. Struct. in Comp. Sc., 14(4):527–586, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. I. Hasuo and N. Hoshino. Semantics of higher-order quantum computation via geometry of interaction. In LICS, pages 237–246, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Y. Delbecque. Quantum games as quantum types. PhD thesis, McGill University, 2009.Google ScholarGoogle Scholar
  23. Y. Delbecque and P. Panangaden. Game semantics for quantum stores. Electr. Notes Theor. Comput. Sci., 218:153–170, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. U. Dal Lago and M. Zorzi. Wave-style token machines and quantum lambda calculi. In LINEARITY, pages 64–78, 2014.Google ScholarGoogle Scholar
  25. U. Dal Lago, C. Faggian, I. Hasuo, and A. Yoshimizu. The geometry of synchronization. In CSL-LICS, pages 35:1–35:10, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. V. Danos and L. Regnier. Reversible, irreversible and optimal lambdamachines. Theor. Comput. Sci., 227(1-2):79–97, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Ian Mackie. The geometry of interaction machine. In POPL, pages 198–208, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. U. Dal Lago, C. Faggian, B. Valiron, and A. Yoshimizu. Parallelism and synchronization in an infinitary context. In LICS, pages 559–572, 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. U. Dal Lago, C. Faggian, B. Valiron, and A. Yoshimizu. The geometry of parallelism: Classical, probabilistic, and quantum effects (long version). Available at https://arxiv.org/abs/1610.09629, 2016.Google ScholarGoogle Scholar
  30. I. Mackie. Applications of the Geometry of Interaction to language implementation. Phd thesis, University of London, 1994.Google ScholarGoogle Scholar
  31. D. R. Ghica, A. Smith, and S. Singh. Geometry of synthesis IV. In ICFP, pages 221–233, 2011.Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. S. Abramsky, E. Haghverdi, and P. J. Scott. Geometry of interaction and linear combinatory algebras. Math. Struct. in Comp. Sc., 12(5): 625–665, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. T. Ehrhard, C. Tasson, and M. Pagani. Probabilistic coherence spaces are fully abstract for probabilistic PCF. In POPL, pages 309–320, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. V. Danos and R. Harmer. Probabilistic game semantics. ACM Trans. Comput. Log., 3(3):359–382, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. N. Hoshino, K. Muroya, and I. Hasuo. Memoryful geometry of interaction. In CSL-LICS, page 52, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. S. Staton. Algebraic effects, linearity, and quantum programming languages. In POPL, pages 395–406, 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. B. Coecke, R. Duncan, A. Kissinger, and Q. Wang. Strong complementarity and non-locality in categorical quantum mechanics. In LICS, pages 245–254, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. D. R. Ghica. Geometry of synthesis: a structured approach to VLSI design. In POPL, pages 363–375, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. K. Muroya, N. Hoshino, and I. Hasuo. Memoryful geometry of interaction II: recursion and adequacy. In POPL, pages 748–760, 2016. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. M. Bezem and J. W. Klop. Term Rewriting Systems, volume 55 of Cambridge Tracts in Theoretical Computer Science, chapter Abstract Reduction Systems. Cambridge University Press, 2003.Google ScholarGoogle Scholar
  41. A. Pitts. Nominal Sets: Names and Symmetry in Computer Science. Cambridge University Press, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. The geometry of parallelism: classical, probabilistic, and quantum effects

    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!