Categorical quantum mechanics

Last updated

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.

Contents

Mathematical setup

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

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

Teleport.png
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

Axiomatization and new models

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

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

Categorical quantum mechanics as logic

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

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

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

    Related Research Articles

    In mathematics and computer science, currying is the technique of translating a function that takes multiple arguments into a sequence of families of functions, each taking a single argument.

    In physics, the no-cloning theorem states that it is impossible to create an independent and identical copy of an arbitrary unknown quantum state, a statement which has profound implications in the field of quantum computing among others. The theorem is an evolution of the 1970 no-go theorem authored by James Park, in which he demonstrates that a non-disturbing measurement scheme which is both simple and perfect cannot exist. The aforementioned theorems do not preclude the state of one system becoming entangled with the state of another as cloning specifically refers to the creation of a separable state with identical factors. For example, one might use the controlled NOT gate and the Walsh–Hadamard gate to entangle two qubits without violating the no-cloning theorem as no well-defined state may be defined in terms of a subsystem of an entangled state. The no-cloning theorem concerns only pure states whereas the generalized statement regarding mixed states is known as the no-broadcast theorem.

    In mathematics, a monoidal category is a category equipped with a bifunctor

    The following outline is provided as an overview of and guide to category theory, the area of study in mathematics that examines in an abstract way the properties of particular mathematical concepts, by formalising them as collections of objects and arrows, where these collections satisfy certain basic conditions. Many significant areas of mathematics can be formalised as categories, and the use of category theory allows many intricate and subtle mathematical results in these fields to be stated, and proved, in a much simpler way than without the use of categories.

    In the mathematical study of logic and the physical analysis of quantum foundations, quantum logic is a set of rules for manip­ulation of propositions inspired by the structure of quantum theory. The formal system takes as its starting point an obs­ervation of Garrett Birkhoff and John von Neumann, that the structure of experimental tests in classical mechanics forms a Boolean algebra, but the structure of experimental tests in quantum mechanics forms a much more complicated structure.

    <span class="mw-page-title-main">Samson Abramsky</span> British computer scientist

    Samson Abramsky is Professor of Computer Science at University College London. He was previously the Christopher Strachey Professor of Computing at Wolfson College, Oxford, from 2000 to 2021.

    In mathematics, especially in the fields of representation theory and module theory, a Frobenius algebra is a finite-dimensional unital associative algebra with a special kind of bilinear form which gives the algebras particularly nice duality theories. Frobenius algebras began to be studied in the 1930s by Richard Brauer and Cecil Nesbitt and were named after Georg Frobenius. Tadashi Nakayama discovered the beginnings of a rich duality theory, . Jean Dieudonné used this to characterize Frobenius algebras. Frobenius algebras were generalized to quasi-Frobenius rings, those Noetherian rings whose right regular representation is injective. In recent times, interest has been renewed in Frobenius algebras due to connections to topological quantum field theory.

    <span class="mw-page-title-main">Penrose graphical notation</span> Graphical notation for multilinear algebra calculations

    In mathematics and physics, Penrose graphical notation or tensor diagram notation is a visual depiction of multilinear functions or tensors proposed by Roger Penrose in 1971. A diagram in the notation consists of several shapes linked together by lines.

    String diagrams are a formal graphical language for representing morphisms in monoidal categories, or more generally 2-cells in 2-categories. They are a prominent tool in applied category theory. When interpreted in the monoidal category of vector spaces and linear maps with the tensor product, string diagrams are called tensor networks or Penrose graphical notation. This has led to the development of categorical quantum mechanics where the axioms of quantum theory are expressed in the language of monoidal categories.

    In mathematical physics, Gleason's theorem shows that the rule one uses to calculate probabilities in quantum physics, the Born rule, can be derived from the usual mathematical representation of measurements in quantum physics together with the assumption of non-contextuality. Andrew M. Gleason first proved the theorem in 1957, answering a question posed by George W. Mackey, an accomplishment that was historically significant for the role it played in showing that wide classes of hidden-variable theories are inconsistent with quantum physics. Multiple variations have been proven in the years since. Gleason's theorem is of particular importance for the field of quantum logic and its attempt to find a minimal set of mathematical axioms for quantum theory.

    In category theory, a branch of mathematics, dagger compact categories first appeared in 1989 in the work of Sergio Doplicher and John E. Roberts on the reconstruction of compact topological groups from their category of finite-dimensional continuous unitary representations. They also appeared in the work of John Baez and James Dolan as an instance of semistrict k-tuply monoidal n-categories, which describe general topological quantum field theories, for n = 1 and k = 3. They are a fundamental structure in Samson Abramsky and Bob Coecke's categorical quantum mechanics.

    In the mathematical field of category theory, a dagger symmetric monoidal category is a monoidal category that also possesses a dagger structure. That is, this category comes equipped not only with a tensor product in the category theoretic sense but also with a dagger structure, which is used to describe unitary morphisms and self-adjoint morphisms in : abstract analogues of those found in FdHilb, the category of finite-dimensional Hilbert spaces. This type of category was introduced by Peter Selinger as an intermediate structure between dagger categories and the dagger compact categories that are used in categorical quantum mechanics, an area that now also considers dagger symmetric monoidal categories when dealing with infinite-dimensional quantum mechanical concepts.

    In mathematics, the category FdHilb has all finite-dimensional Hilbert spaces for objects and the linear transformations between them as morphisms. Whereas the theory described by the normal category of Hilbert spaces, Hilb, is ordinary quantum mechanics, the corresponding theory on finite dimensional Hilbert spaces is called fdQM.

    <span class="mw-page-title-main">Bob Coecke</span>

    Bob Coecke is a Belgian theoretical physicist and logician who was professor of Quantum foundations, Logics and Structures at Oxford University until 2020, when he became Chief Scientist of Cambridge Quantum Computing, and after the merger with Honeywell Quantum Systems, Chief Scientist of Quantinuum. In January 2023 he also became Distinguished Visiting Research Chair at the Perimeter Institute for Theoretical Physics. He pioneered categorical quantum mechanics, Quantum Picturalism, ZX-calculus, DisCoCat model for natural language, and quantum natural language processing (QNLP). He is a founder of the Quantum Physics and Logic community and conference series, and of the applied category theory community, conference series, and diamond-open-access journal Compositionality.

    In mathematics, Solèr's theorem is a result concerning certain infinite-dimensional vector spaces. It states that any orthomodular form that has an infinite orthonormal set is a Hilbert space over the real numbers, complex numbers or quaternions. Originally proved by Maria Pia Solèr, the result is significant for quantum logic and the foundations of quantum mechanics. In particular, Solèr's theorem helps to fill a gap in the effort to use Gleason's theorem to rederive quantum mechanics from information-theoretic postulates. It is also an important step in the Heunen–Kornell axiomatisation of the category of Hilbert spaces.

    The ZX-calculus is a rigorous graphical language for reasoning about linear maps between qubits, which are represented as string diagrams called ZX-diagrams. A ZX-diagram consists of a set of generators called spiders that represent specific tensors. These are connected together to form a tensor network similar to Penrose graphical notation. Due to the symmetries of the spiders and the properties of the underlying category, topologically deforming a ZX-diagram does not affect the linear map it represents. In addition to the equalities between ZX-diagrams that are generated by topological deformations, the calculus also has a set of graphical rewrite rules for transforming diagrams into one another. The ZX-calculus is universal in the sense that any linear map between qubits can be represented as a diagram, and different sets of graphical rewrite rules are complete for different families of linear maps. ZX-diagrams can be seen as a generalisation of quantum circuit notation.

    Applied category theory is an academic discipline in which methods from category theory are used to study other fields including but not limited to computer science, physics, natural language processing, control theory, probability theory and causality. The application of category theory in these domains can take different forms. In some cases the formalization of the domain into the language of category theory is the goal, the idea here being that this would elucidate the important structure and properties of the domain. In other cases the formalization is used to leverage the power of abstraction in order to prove new results about the field.

    DisCoCat is a mathematical framework for natural language processing which uses category theory to unify distributional semantics with the principle of compositionality. The grammatical derivations in a categorial grammar are interpreted as linear maps acting on the tensor product of word vectors to produce the meaning of a sentence or a piece of text. String diagrams are used to visualise information flow and reason about natural language semantics.

    Quantum natural language processing (QNLP) is the application of quantum computing to natural language processing (NLP). It computes word embeddings as parameterised quantum circuits that can solve NLP tasks faster than any classical computer. It is inspired by categorical quantum mechanics and the DisCoCat framework, making use of string diagrams to translate from grammatical structure to quantum processes.

    In the mathematical field of category theory, FinVect is the category whose objects are all finite-dimensional vector spaces and whose morphisms are all linear maps between them.

    References

    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].
    This page is based on this Wikipedia article
    Text is available under the CC BY-SA 4.0 license; additional terms may apply.
    Images, videos and audio are available under their respective licenses.