Enriched Presheaf Model of Quantum FPC
Article No.: 13, Pages 362 - 392
Abstract
Selinger gave a superoperator model of a first-order quantum programming language and proved that it is fully definable and hence fully abstract. This paper proposes an extension of the superoperator model to higher-order programs based on modules over superoperators or, equivalently, enriched presheaves over the category of superoperators. The enriched presheaf category can be easily proved to be a model of intuitionistic linear logic with cofree exponential, from which one can cave out a model of classical linear logic by a kind of bi-orthogonality construction. Although the structures of an enriched presheaf category are usually rather complex, a morphism in the classical model can be expressed simply as a matrix of completely positive maps. The model inherits many desirable properties from the superoperator model. A conceptually interesting property is that our model has only a state whose “total probability” is bounded by 1, i.e. does not have a state where true and false each occur with probability 2/3. Another convenient property inherited from the superoperator model is a ωCPO-enrichment. Remarkably, our model has a sufficient structure to interpret arbitrary recursive types by the standard domain theoretic technique. We introduce Quantum FPC, a quantum λ-calculus with recursive types, and prove that our model is a fully abstract model of Quantum FPC.
References
[1]
M. Abadi and M.P. Fiore. 1996. Syntactic considerations on recursive types. In Proceedings 11th Annual IEEE Symposium on Logic in Computer Science. IEEE Comput. Soc. Press. https://doi.org/10.1109/lics.1996.561324
[2]
Samson Abramsky, Radha Jagadeesan, and Pasquale Malacaria. 2000. Full Abstraction for PCF. Information and Computation, 163, 2 (2000), dec, 409–470. https://doi.org/10.1006/inco.2000.2930
[3]
J. Adamek and J. Rosicky. 1994. Locally Presentable and Accessible Categories. Cambridge University Press. https://doi.org/10.1017/cbo9780511600579
[4]
Pablo Andrés-Martínez and Chris Heunen. 2023. Categories of sets with infinite addition. Aug., https://doi.org/10.48550/ARXIV.2308.15183 arxiv:2308.15183.
[5]
Francis Borceux. 1994. Handbook of Categorical Algebra. Cambridge University Press. https://doi.org/10.1017/cbo9780511525865
[6]
Kenta Cho. 2016. Semantics for a Quantum Programming Language by Operator Algebras. New Generation Computing, 34, 1-2 (2016), mar, 25–68. https://doi.org/10.1007/s00354-016-0204-3
[7]
Pierre Clairambault and Marc de Visme. 2020. Full abstraction for the quantum lambda-calculus. Proceedings of the ACM on Programming Languages, 4, POPL (2020), dec, 1–28. https://doi.org/10.1145/3371131
[8]
Pierre Clairambault, Marc De Visme, and Glynn Winskel. 2019. Game semantics for quantum programming. Proceedings of the ACM on Programming Languages, 3, POPL (2019), jan, 1–29. https://doi.org/10.1145/3290345
[9]
Vincent Danos and Thomas Ehrhard. 2011. Probabilistic coherence spaces as a model of higher-order probabilistic computation. Information and Computation, 209, 6 (2011), jun, 966–991. https://doi.org/10.1016/j.ic.2011.02.001
[10]
Brian Day. 1970. On closed categories of functors. In Lecture Notes in Mathematics. Springer Berlin Heidelberg, 1–38. https://doi.org/10.1007/bfb0060438
[11]
Thomas Ehrhard, Michele Pagani, and Christine Tasson. 2018. Full Abstraction for Probabilistic PCF. Journal of the ACM, 65, 4 (2018), apr, 1–44. https://doi.org/10.1145/3164540
[12]
Thomas Ehrhard and Laurent Regnier. 2008. Uniformity and the Taylor expansion of ordinary lambda-terms. Theoretical Computer Science, 403, 2-3 (2008), aug, 347–372. https://doi.org/10.1016/j.tcs.2008.06.001
[13]
Thomas Ehrhard, Christine Tasson, and Michele Pagani. 2014. Probabilistic coherence spaces are fully abstract for probabilistic PCF. In Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM. https://doi.org/10.1145/2535838.2535865
[14]
M.P. Fiore and G.D. Plotkin. 1994. An axiomatisation of computationally adequate domain theoretic models of FPC. In Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science. IEEE Comput. Soc. Press. https://doi.org/10.1109/lics.1994.316083
[15]
Marcelo P. Fiore. 1996. Axiomatic Domain Theory in Categories of Partial Maps. Cambridge University Press. https://doi.org/10.1017/cbo9780511526565
[16]
Jean-Yves Girard. 2004. Between Logic and Quantic: a Tract. In Linear Logic in Computer Science. Cambridge University Press, 346–381. https://doi.org/10.1017/cbo9780511550850.011
[17]
Esfandiar Haghverdi. 2000. Unique decomposition categories, Geometry of Interaction and combinatory logic. Mathematical Structures in Computer Science, 10, 2 (2000), apr, 205–230. https://doi.org/10.1017/s0960129599003035
[18]
Masahito Hasegawa. 1999. Categorical Glueing and Logical Predicates for Models of Linear Logic.
[19]
Ichiro Hasuo and Naohiko Hoshino. 2011. Semantics of Higher-Order Quantum Computation via Geometry of Interaction. In 2011 IEEE 26th Annual Symposium on Logic in Computer Science. IEEE. https://doi.org/10.1109/lics.2011.26
[20]
Ichiro Hasuo and Naohiko Hoshino. 2017. Semantics of higher-order quantum computation via geometry of interaction. Annals of Pure and Applied Logic, 168, 2 (2017), feb, 404–469. https://doi.org/10.1016/j.apal.2016.10.010
[21]
Naohiko Hoshino. 2011. A Modified GoI Interpretation for a Linear Functional Programming Language and Its Adequacy. In Foundations of Software Science and Computational Structures. Springer Berlin Heidelberg, 320–334. https://doi.org/10.1007/978-3-642-19805-2_22
[22]
J.M.E. Hyland and C.-H.L. Ong. 2000. On Full Abstraction for PCF: I, II, and III. Information and Computation, 163, 2 (2000), dec, 285–408. https://doi.org/10.1006/inco.2000.2917
[23]
Martin Hyland and Andrea Schalk. 2003. Glueing and orthogonality for models of linear logic. Theoretical Computer Science, 294, 1-2 (2003), feb, 183–231. https://doi.org/10.1016/s0304-3975(01)00241-9
[24]
Xiaodong Jia, Andre Kornell, Bert Lindenhovius, Michael Mislove, and Vladimir Zamdzhiev. 2022. Semantics for variational Quantum programming. Proceedings of the ACM on Programming Languages, 6, POPL (2022), jan, 1–31. https://doi.org/10.1145/3498687
[25]
G.M. Kelly and M.L. Laplaza. 1980. Coherence for compact closed categories. Journal of Pure and Applied Algebra, 19 (1980), dec, 193–213. https://doi.org/10.1016/0022-4049(80)90101-2
[26]
Gregory Maxwell Kelly. 1982. Basic concepts of enriched category theory (London Mathematical Society lecture note series). Cambridge University Press. isbn:0521287022 Bibliography: p. 231-238
[27]
Jim Laird, Giulio Manzonetto, Guy McCusker, and Michele Pagani. 2013. Weighted Relational Models of Typed Lambda-Calculi. In 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE. https://doi.org/10.1109/lics.2013.36
[28]
Bert Lindenhovius, Michael Mislove, and Vladimir Zamdzhiev. 2021. LNL-FPC: The Linear/Non-linear Fixpoint Calculus. Logical Methods in Computer Science, 17, 2 (2021), April, https://doi.org/10.23638/LMCS-17(2:9)2021 arxiv:1906.09503.
[29]
Octavio Malherbe. 2013. Categorical models of computation: partially traced categories and presheaf models of quantum computation. Jan., https://doi.org/10.48550/ARXIV.1301.5087 arxiv:1301.5087.
[30]
Ernest G. Manes and Michael A. Arbib. 1986. Algebraic Approaches to Program Semantics. Springer New York. https://doi.org/10.1007/978-1-4612-4962-7
[31]
Michele Pagani, Peter Selinger, and Benoît Valiron. 2014. Applying quantitative semantics to higher-order quantum computing. In Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM. https://doi.org/10.1145/2535838.2535879
[32]
Romain Péchoux, Simon Perdrix, Mathys Rennela, and Vladimir Zamdzhiev. 2020. Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory. In Lecture Notes in Computer Science. Springer International Publishing, 562–581. https://doi.org/10.1007/978-3-030-45231-5_29
[33]
Gordon D. Plotkin. 1985. Denotational semantics with partial functions.
[34]
Hans-E. Porst. 2008. On Categories of Monoids, Comonoids, and Bimonoids. Quaestiones Mathematicae, 31, 2 (2008), jun, 127–139. https://doi.org/10.2989/qm.2008.31.2.2.474
[35]
Mathys Rennela and Sam Staton. 2020. Classical Control, Quantum Circuits and Linear Logic in Enriched Category Theory. Logical Methods in Computer Science, 16, 1 (2020), 1–24. https://doi.org/10.23638/LMCS-16(1:30)2020 arxiv:1711.05159.
[36]
Peter Selinger. 2004. Towards a quantum programming language. Mathematical Structures in Computer Science, 14, 4 (2004), aug, 527–586. https://doi.org/10.1017/s0960129504004256
[37]
Peter Selinger. 2004. Towards a semantics for higher-order quantum computation. In Proceedings of the 2nd International Workshop on Quantum Programming Languages. 127–143.
[38]
Peter Selinger and Benoît Valiron. 2008. On a Fully Abstract Model for a Quantum Linear Functional Language. Electronic Notes in Theoretical Computer Science, 210 (2008), jul, 123–137. https://doi.org/10.1016/j.entcs.2008.04.022
[39]
Peter Selinger and Benoît Valiron. 2009. Quantum Lambda Calculus. In Semantic Techniques in Quantum Computation. Cambridge University Press, 135–172. https://doi.org/10.1017/cbo9781139193313.005
[40]
Sam Staton. 2015. Algebraic Effects, Linearity, and Quantum Programming Languages. In Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM. https://doi.org/10.1145/2676726.2676999
[41]
Takeshi Tsukada and Kazuyuki Asada. 2022. Linear-Algebraic Models of Linear Logic as Categories of Modules over Sigma-Semirings. In Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Christel Baier and Dana Fisman (Eds.). ACM, 60:1–60:13. https://doi.org/10.1145/3531130.3533373
[42]
Takeshi Tsukada and Kazuyuki Asada. 2023. Enriched Presheaf Model of Quantum FPC. Nov., arxiv:2311.03117.
[43]
Takeshi Tsukada, Kazuyuki Asada, and C.-H. Luke Ong. 2017. Generalised species of rigid resource terms. In 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE. https://doi.org/10.1109/lics.2017.8005093
[44]
Takeshi Tsukada, Kazuyuki Asada, and C.-H. Luke Ong. 2018. Species, Profunctors and Taylor Expansion Weighted by SMCC. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. ACM. https://doi.org/10.1145/3209108.3209157
[45]
Takeshi Tsukada and C.-H. Luke Ong. 2015. Nondeterminism in Game Semantics via Sheaves. In 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE. https://doi.org/10.1109/lics.2015.30
[46]
Takeshi Tsukada and C.-H. Luke Ong. 2016. Plays as Resource Terms via Non-idempotent Intersection Types. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. ACM. https://doi.org/10.1145/2933575.2934553
Index Terms
- Enriched Presheaf Model of Quantum FPC
Recommendations
With a Few Square Roots, Quantum Computing Is as Easy as Pi
Rig groupoids provide a semantic model of Π, a universal classical reversible programming language over finite types. We prove that extending rig groupoids with just two maps and three equations about them results in a model of quantum computing that is ...
Invertible quantum operations and perfect encryption of quantum states
In this note, we characterize the form of an invertible quantum operation, i.e., a completely positive trace preserving linear transformation (a CPTP map) whose inverse is also a CPTP map. The precise form of such maps becomes important in contexts such ...
Model of a hybrid processor executing C++ with additional quantum functions
Display Omitted Provide a VHDL simulation model of a hybrid quantum/classical processor.Provide a processor capable of executing classical and quantum programs.Provide an assembler to interpret both classical and quantum assembly instructions.Provide C++...
Comments
Information & Contributors
Information
Published In
January 2024
2820 pages
Copyright © 2024 Owner/Author.
This work is licensed under a Creative Commons Attribution 4.0 International License.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 05 January 2024
Published in PACMPL Volume 8, Issue POPL
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Japan Society for the Promotion of Science
- ROIS NII Open Collaborative Research
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 280Total Downloads
- Downloads (Last 12 months)280
- Downloads (Last 6 weeks)37
Reflects downloads up to 26 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in