Categorical quantum mechanics

Categorical quantum mechanics is the study of quantum foundations and quantum information using paradigms from mathematics and computer science, notably monoidal category theory. The primitive objects of study are physical processes, and the different ways that these can be composed. It was pioneered in 2004 by Samson Abramsky and Bob Coecke. Categorical quantum mechanics is entry 18M40 in MSC2020.

Mathematical setup[edit]

Mathematically, the basic setup is captured by a dagger symmetric monoidal category: composition of morphisms models sequential composition of processes, and the tensor product describes parallel composition of processes. The role of the dagger is to assign to each state a corresponding test. These can then be adorned with more structure to study various aspects. For instance:

A substantial portion of the mathematical backbone to this approach is drawn from 'Australian category theory', most notably from work by Max Kelly and M. L. Laplaza,[6] Andre Joyal and Ross Street,[7] A. Carboni and R. F. C. Walters,[8] and Steve Lack.[9] Modern textbooks include Categories for quantum theory[10] and Picturing quantum processes.[11]

Diagrammatic calculus[edit]

One of the most notable features of categorical quantum mechanics is that the compositional structure can be faithfully captured by string diagrams.[12]

An illustration of the diagrammatic calculus: the quantum teleportation protocol as modeled in categorical quantum mechanics.

These diagrammatic languages can be traced back to Penrose graphical notation, developed in the early 1970s.[13] Diagrammatic reasoning has been used before in quantum information science in the quantum circuit model, however, in categorical quantum mechanics primitive gates like the CNOT-gate arise as composites of more basic algebras, resulting in a much more compact calculus.[14] In particular, the ZX-calculus has sprung forth from categorical quantum mechanics as a diagrammatic counterpart to conventional linear algebraic reasoning about quantum gates. The ZX-calculus consists of a set of generators representing the common Pauli quantum gates and the Hadamard gate equipped with a set of graphical rewrite rules governing their interaction. Although a standard set of rewrite rules has not yet been established, some versions have been proven to be complete, meaning that any equation that holds between two quantum circuits represented as diagrams can be proven using the rewrite rules.[15] The ZX-calculus has been used to study for instance measurement-based quantum computing.

Branches of activity[edit]

Axiomatization and new models[edit]

One of the main successes of the categorical quantum mechanics research program is that from seemingly weak abstract constraints on the compositional structure, it turned out to be possible to derive many quantum mechanical phenomena. In contrast to earlier axiomatic approaches, which aimed to reconstruct Hilbert space quantum theory from reasonable assumptions, this attitude of not aiming for a complete axiomatization may lead to new interesting models that describe quantum phenomena, which could be of use when crafting future theories.[16]

Completeness and representation results[edit]

There are several theorems relating the abstract setting of categorical quantum mechanics to traditional settings for quantum mechanics.

  • Completeness of the diagrammatic calculus: an equality of morphisms can be proved in the category of finite-dimensional Hilbert spaces if and only if it can be proved in the graphical language of dagger compact closed categories.[17]
  • Dagger commutative Frobenius algebras in the category of finite-dimensional Hilbert spaces correspond to orthogonal bases.[18] A version of this correspondence also holds in arbitrary dimension.[19]
  • Certain extra axioms guarantee that the scalars embed into the field of complex numbers, namely the existence of finite dagger biproducts and dagger equalizers, well-pointedness, and a cardinality restriction on the scalars.[20]
  • Certain extra axioms on top of the previous guarantee that a dagger symmetric monoidal category embeds into the category of Hilbert spaces, namely if every dagger monic is a dagger kernel. In that case the scalars form an involutive field instead of just embedding in one. If the category is compact, the embedding lands in finite-dimensional Hilbert spaces.[21]
  • Six axioms characterize the category of Hilbert spaces completely, fulfilling the reconstruction programme.[22] Two of these axioms concern a dagger and a tensor product, a third concerns biproducts.
  • Special dagger commutative Frobenius algebras in the category of sets and relations correspond to discrete abelian groupoids.[23]
  • Finding complementary basis structures in the category of sets and relations corresponds to solving combinatorical problems involving Latin squares.[24]
  • Dagger commutative Frobenius algebras on qubits must be either special or antispecial, relating to the fact that maximally entangled tripartite states are SLOCC-equivalent to either the GHZ or the W state.[25]

Categorical quantum mechanics as logic[edit]

Categorical quantum mechanics can also be seen as a type theoretic form of quantum logic that, in contrast to traditional quantum logic, supports formal deductive reasoning.[26] There exists software that supports and automates this reasoning.

There is another connection between categorical quantum mechanics and quantum logic, as subobjects in dagger kernel categories and dagger complemented biproduct categories form orthomodular lattices.[27][28] In fact, the former setting allows logical quantifiers, the existence of which was never satisfactorily addressed in traditional quantum logic.

Categorical quantum mechanics as foundation for quantum mechanics[edit]

Categorical quantum mechanics allows a description of more general theories than quantum theory. This enables one to study which features single out quantum theory in contrast to other non-physical theories, hopefully providing some insight into the nature of quantum theory. For example, the framework allows a succinct compositional description of Spekkens' toy theory that allows one to pinpoint which structural ingredient causes it to be different from quantum theory.[29]

Categorical quantum mechanics and DisCoCat[edit]

The DisCoCat framework applies categorical quantum mechanics to natural language processing.[30] The types of a pregroup grammar are interpreted as quantum systems, i.e. as objects of a dagger compact category. The grammatical derivations are interpreted as quantum processes, e.g. a transitive verb takes its subject and object as input and produces a sentence as output. Function words such as determiners, prepositions, relative pronouns, coordinators, etc. can be modeled using the same Frobenius algebras that model classical communication.[31][32] This can be understood as a monoidal functor from grammar to quantum processes, a formal analogy which led to the development of quantum natural language processing.[33]

See also[edit]

References[edit]

  1. ^ Abramsky, Samson; Coecke, Bob (2004). "A categorical semantics of quantum protocols". Proceedings of the 19th IEEE conference on Logic in Computer Science (LiCS'04). IEEE. arXiv:quant-ph/0402130.
  2. ^ Selinger, P. (2005). "Dagger compact closed categories and completely positive maps". Proceedings of the 3rd International Workshop on Quantum Programming Languages, Chicago, June 30–July 1.
  3. ^ Coecke, B.; Pavlovic, D. (2007). "16. Quantum measurements without sums §16.2 Categorial Semantics". Mathematics of Quantum Computing and Technology. Taylor and Francis. pp. 567–604. arXiv:quant-ph/0608035. ISBN 9781584889007.
  4. ^ Coecke, B.; Perdrix, S. (2012). "Environment and classical channels in categorical quantum mechanics". Proceedings of the 19th EACSL Annual Conference on Computer Science Logic (CSL). Lecture Notes in Computer Science. Vol. 6247. Springer. arXiv:1004.1598. doi:10.2168/LMCS-8(4:14)2012. S2CID 16833406.
  5. ^ Coecke, B.; Duncan, R. (2011). "Interacting quantum observables". Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science. Vol. 5126. pp. 298–310. arXiv:0906.4725. doi:10.1088/1367-2630/13/4/043016. S2CID 14259278.
  6. ^ Kelly, G.M.; Laplaza, M.L. (1980). "Coherence for compact closed categories". Journal of Pure and Applied Algebra. 19: 193–213. doi:10.1016/0022-4049(80)90101-2.
  7. ^ Joyal, A.; Street, R. (1991). "The Geometry of tensor calculus I". Advances in Mathematics. 88 (1): 55–112. doi:10.1016/0001-8708(91)90003-P.
  8. ^ Carboni, A.; Walters, R.F.C. (1987). "Cartesian bicategories I". Journal of Pure and Applied Algebra. 49 (1–2): 11–32. doi:10.1016/0022-4049(87)90121-6.
  9. ^ Lack, S. (2004). "Composing PROPs". Theory and Applications of Categories. 13: 147–163.
  10. ^ Heunen, C.; Vicary, J. (2019). Categories for Quantum Theory. Oxford University Press. ISBN 978-0-19-873961-6.
  11. ^ Coecke, B.; Kissinger, A. (2017). Picturing Quantum Processes. Cambridge University Press. Bibcode:2017pqp..book.....C. ISBN 978-1-107-10422-8.
  12. ^ Coecke, B. (2010). "Quantum picturalism". Contemporary Physics. 51 (1): 59–83. arXiv:0908.1787. Bibcode:2010ConPh..51...59C. doi:10.1080/00107510903257624. S2CID 752173.
  13. ^ Penrose, R. (1971). "Applications of negative dimensional tensors". In Welsh, D. (ed.). Combinatorial Mathematics and its Applications. Proceedings of a Conference Held at the Mathematical Institute, Oxford, from 7-10 July, 1969. Academic Press. pp. 221–244. OCLC 257806578.
  14. ^ Backens, Miriam (2014). "The ZX-calculus is complete for stabilizer quantum mechanics". New Journal of Physics. 16 (9): 093021. arXiv:1307.7025. Bibcode:2014NJPh...16i3021B. doi:10.1088/1367-2630/16/9/093021. ISSN 1367-2630. S2CID 27558474.
  15. ^ Jeandel, Emmanuel; Perdrix, Simon; Vilmart, Renaud (2017-05-31). "A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics". arXiv:1705.11151 [quant-ph].
  16. ^ Baez, J.C. (2004). "Quantum quandaries: a category-theoretic perspective". In Rickles, D.; French, S. (eds.). The Structural Foundations of Quantum Gravity. Oxford University Press. pp. 240–266. arXiv:quant-ph/0404040. ISBN 978-0-19-926969-3.
  17. ^ Selinger, P. (2011). "Finite dimensional Hilbert spaces are complete for dagger compact closed categories". Electronic Notes in Theoretical Computer Science. 270 (1): 113–9. CiteSeerX 10.1.1.749.4436. doi:10.1016/j.entcs.2011.01.010.
  18. ^ Coecke, B.; Pavlovic, D.; Vicary, J. (2013). "A new description of orthogonal bases". Mathematical Structures in Computer Science. 23 (3): 555–567. arXiv:0810.0812. CiteSeerX 10.1.1.244.6490. doi:10.1017/S0960129512000047. S2CID 12608889.
  19. ^ Abramsky, S.; Heunen, C. (2010). "H*-algebras and nonunital Frobenius algebras: first steps in infinite-dimensional categorical quantum mechanics". Clifford Lectures, AMS Proceedings of Symposia in Applied Mathematics. arXiv:1011.6123. to appear (2010).
  20. ^ Vicary, J. (2011). "Completeness of dagger-categories and the complex numbers". Journal of Mathematical Physics. 52 (8): 082104. arXiv:0807.2927. Bibcode:2011JMP....52h2104V. doi:10.1063/1.3549117. S2CID 115154127.
  21. ^ Heunen, C. (2008). "An embedding theorem for Hilbert categories". Theory and Applications of Categories. 22: 321–344. arXiv:0811.1448.
  22. ^ Heunen, C.; Kornell, A. (2022). "Axioms for the category of Hilbert spaces". Proceedings of the National Academy of Sciences. 119 (9): e2117024119. arXiv:2109.07418. Bibcode:2022PNAS..11917024H. doi:10.1073/pnas.2117024119. PMC 8892366. PMID 35217613.
  23. ^ Pavlovic, D. (2009). "Quantum and classical structures in nondeterminstic computation". Quantum Interaction. QI 2009. Lecture Notes in Computer Science. Vol. 5494. Springer. pp. 143–157. arXiv:0812.2266. doi:10.1007/978-3-642-00834-4_13. ISBN 978-3-642-00834-4. S2CID 11615031.(2009).
  24. ^ Evans, J.; Duncan, R.; Lang, A.; Panangaden, P. (2009). "Classifying all mutually unbiased bases in Rel". arXiv:0909.4453 [quant-ph].
  25. ^ Coecke, B.; Kissinger, A. (2010). "The compositional structure of multipartite quantum entanglement". Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science. Vol. 6199. Springer. pp. 297–308. arXiv:1002.2540.
  26. ^ Duncan, R. (2006). Types for Quantum Computing (PDF) (PhD). University of Oxford. CiteSeerX 10.1.1.122.134. uk.bl.ethos.483690.
  27. ^ Heunen, C.; Jacobs, B. (2009). "Quantum logic in dagger kernel categories". Order. 27 (2): 177–212. arXiv:0902.2355. doi:10.1007/s11083-010-9145-5. S2CID 2760251.
  28. ^ Harding, J. (2009). "A Link between quantum logic and categorical quantum mechanics". International Journal of Theoretical Physics. 48 (3): 769–802. Bibcode:2009IJTP...48..769H. CiteSeerX 10.1.1.605.9683. doi:10.1007/s10773-008-9853-4. S2CID 13394885.
  29. ^ Coecke, B.; Edwards, B.; Spekkens, R.W. (2011). "Phase groups and the origin of non-locality for qubits". Electronic Notes in Theoretical Computer Science. 270 (2): 15–36. arXiv:1003.5005. doi:10.1016/j.entcs.2011.01.021. S2CID 27998267., to appear (2010).
  30. ^ Coecke, Bob; Sadrzadeh, Mehrnoosh; Clark, Stephen (2010-03-23). "Mathematical Foundations for a Compositional Distributional Model of Meaning". arXiv:1003.4394 [cs.CL].
  31. ^ Sadrzadeh, Mehrnoosh; Clark, Stephen; Coecke, Bob (2013-12-01). "The Frobenius anatomy of word meanings I: subject and object relative pronouns". Journal of Logic and Computation. 23 (6): 1293–1317. arXiv:1404.5278. doi:10.1093/logcom/ext044. ISSN 0955-792X.
  32. ^ Sadrzadeh, Mehrnoosh; Clark, Stephen; Coecke, Bob (2016). "The Frobenius anatomy of word meanings II: possessive relative pronouns". Journal of Logic and Computation. 26 (2): 785–815. arXiv:1406.4690. doi:10.1093/logcom/exu027.
  33. ^ Coecke, Bob; de Felice, Giovanni; Meichanetzidis, Konstantinos; Toumi, Alexis (2020-12-07). "Foundations for Near-Term Quantum Natural Language Processing". arXiv:2012.03755 [quant-ph].
Retrieved from "https://en.wikipedia.org/w/index.php?title=Categorical_quantum_mechanics&oldid=1216908508"