Quantum information and computation is concerned with the use of quantum-mechanical systems to carry out computational and information-processing tasks [16]. In the few short years that this approach has been studied, a
Quantum information and computation is concerned with the use of quantum-mechanical systems to carry out computational and information-processing tasks (Nielsen and Chunag, 2000). In the few short years that this approach has been studied, a number of remarkable concepts and results have emerged, most notably:a couple of spectacular algorithms and a number of information protocols, exemplified by quantum teleportation, which exploit quantum entanglement in an essential fashion. The current tools available for developing quantum algorithms and protocols are deficient on two main levels: firstly, they are too low-level and at a more fundamental level, the standard mathematical framework for quantum mechanics (which is essentially due to von Neumann (1932)) is actually insufficiency comprehensive for informatic purposes. In joint work with Bob Coecke, we have recently made some striking progress in addressing both these points. They have recast the von Neumann formalism at a more abstract and conceptual level, using category theory.
Quantum information and computation is concerned with the use of quantum-mechanical systems to carry out computational and information-processing tasks (Nielsen and Chunag, 2000). In the few short years that this approach has been studied, a number of remarkable concepts and results have emerged, most notably:a couple of spectacular algorithms and a number of information protocols, exemplified by quantum teleportation, which exploit quantum entanglement in an essential fashion. The current tools available for developing quantum algorithms and protocols are deficient on two main levels: firstly, they are too low-level and at a more fundamental level, the standard mathematical framework for quantum mechanics (which is essentially due to von Neumann (1932)) is actually insufficiency comprehensive for informatic purposes. In joint work with Bob Coecke, we have recently made some striking progress in addressing both these points. They have recast the von Neumann formalism at a more abstract and conceptual level, using category theory.
Particular focus in this paper is on quantum information protocols, which exploit quantum-mechanical effects in an essential way. The particular examples we shall use to illustrate our approach will be teleportation (Benett et al., 1993), logic-gate teleportation (Gottesman and Chuang,1999), and entanglement swapping (Zukowski et al., 1993). The ideas illustrated in these protocols form the basis for novel and potentially very important applications to secure and fault-tolerant communication and computation (2001,1999,2000).
This paper explores the application of category theory to provide a semantic framework for quantum vector spaces, which are fundamental to quantum mechanics and quantum information. We move beyond the traditional algebraic and analytical descriptions of Hilbert spaces to adopt a more abstract, compositional, and graphical approach rooted in monoidal categories. This categorical perspective allows for a unified understanding of quantum phenomena, including superposition, entanglement, and measurement, by representing quantum systems as objects and processes as morphisms. We delve into the concept of compact closed categories and dagger symmetric monoidal categories as the appropriate mathematical structures to capture the essential features of quantum theory, such as duality, adjoints, and the tensor product for composite systems. Furthermore, the paper discusses how graphical calculi, arising from these categorical structures, offer an intuitive and rigorous method for reasoning about quantum protocols and computations, facilitating the design and verification of quantum algorithms. By providing a high-level, axiomatic framework, categorical semantics clarifies the foundational principles of quantum mechanics and opens new avenues for developing quantum programming languages and understanding the interplay between quantum information and computation.
These lecture notes survey some joint work with Samson Abramsky as it was presented by me at Mathematical Foundations of Programming Semantics XXI in Birmingham (2005).2 It concerns a categorical semantics for quantum mechanics introduced in [Abramsky, S. and Coecke, B. (2004) A categorical semantics of quantum protocols. In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LiCS'04), IEEE Computer Science Press. An extended & improved version is available at http://arXiv.org/quant-ph/0402130; Abramsky, S. and Coecke, B. (2005) Abstract physical traces. Theory and Applications of Categories 14, 111–124. Available at www.tac.mta.ca/tac/volumes/14/6/14-06abs.html]. We present this semantics with a particular focus on the connection between categorical diagrams and certain pictures involving typed squares, triangles, diamonds and lines. Along the way we unravel the structural components which come with strong compact closure. We provide pointers to related literature. Keywords: Strong compact closure, semantics, quantum mechanics, quantum logic, quantum informatics.