PaperlayerView exact revision on arXiv

Source-linked AI summary

Categorical quantum mechanics

Samson Abramsky, Bob Coecke

arXiv:0808.1023v1quant-phmath.CTmath.LO

TL;DR

The chapter revisits the foundations of quantum mechanics using category theory, addressing how categorical structure can express quantum phenomena. It shows that basic ingredients of finitary quantum mechanics arise in semiadditive strongly compact closed categories, while noting important scope boundaries.

  • Problem

    Strongly compact closed categories lack expressive power for measurement branching and quantum–classical information flows.

  • Method

    The paper uses category theory and semiadditive strongly compact closed categories to formulate abstract quantum-mechanical structures and protocols.

  • Results

    The basic ingredients of finitary quantum mechanics can be identified in any semiadditive strongly compact closed category.

  • Takeaways & Limitations

    The framework provides categorical axiomatics for expressing core quantum-mechanical structures and protocols beyond the Hilbert-space presentation.

  • Takeaways & Limitations

    The categorical axiomatics primarily concerns pure states, and basis structures are noncanonical because they lack naturality.

Abstract

from arXiv · show

This invited chapter in the Handbook of Quantum Logic and Quantum Structures consists of two parts: 1. A substantially updated version of quant-ph/0402130 by the same authors, which initiated the area of categorical quantum mechanics, but had not yet been published in full length; 2. An overview of the progress which has been made since then in this area.

1 INTRODUCTION

The section motivates categorical quantum mechanics as a high-level response to limitations in current quantum-information methods and the standard von Neumann framework. It presents category theory and strongly compact closed categories with biproducts as a setting for structural analysis, diagrammatic calculation, and rigorous protocol verification.

  • Motivation: Quantum-information tools are too low-level, relying on ad hoc bras, kets, normalization constants, and matrices rather than compositionality, types, abstraction, and algebraic tools.The section argues that conceptual, high-level methods are needed for designing and reasoning about quantum computational systems.
  • Motivation: The von Neumann formalism is insufficiently comprehensive for protocols involving measurement-dependent feedback from classical or macroscopic systems to quantum systems.Such feedback remains implicit and informal, preventing rigorous analysis and proof.
  • Motivation: The programme addresses open questions about quantum resources, quantum–classical interaction, computational power, control features, and the logical status of No-Cloning and No-Deleting.It is also motivated by the emergence of diverse quantum computational architectures requiring methods for comparison and interpretation.
  • Approach: Category theory provides the mathematical setting for identifying abstract structures underlying quantum mechanics and developing new perspectives on its logic and No-Go theorems.The approach uses strongly compact closed categories with biproducts, with Hilbert spaces as one example.
  • Results: The structural approach yields a diagrammatic calculus with developing automated software support and enables precise formulations and correctness proofs for teleportation, logic-gate teleportation, and entanglement swapping.For teleportation, correctness means proving that Bob’s final qubit state equals Alice’s initial qubit state.

2 REVIEW OF QUANTUM MECHANICS AND TELEPORTATION

The section reviews finitary quantum mechanics through Hilbert spaces, tensor-product composition, reversible transformations, and projector-based measurements. It then introduces teleportation and related protocols, emphasizing entanglement, classical correction, and compositional generalizations.

  • Quantum mechanics: The paper restricts attention to finitary quantum mechanics, where all Hilbert spaces are finite-dimensional.This corresponds physically to observables with finite spectra, such as spin.
  • Quantum mechanics: Compound systems use tensor products, whose vectors can encode correlations that cannot be decomposed into separate component states.This is where entanglement arises in the formalism.
  • Quantum mechanics: Measurements are represented by mutually orthogonal projectors, with observation identifying an outcome branch and preparation producing the corresponding projected state.The measurement formalism separates receiving the outcome from the state change caused by the projector.
  • Quantum teleportation: Teleportation transfers an arbitrary qubit state using an initially entangled pair, a Bell-basis measurement, and two classical bits that select Bob’s unitary correction.The source state is destroyed, while the final state of the target qubit equals the original state.
  • Quantum teleportation: Observation branches remove classical information flow from teleportation networks, which is reintroduced later for analysis.Each branch corresponds to one component of the observation.
  • Teleportation variants: Logic gate teleportation replaces the EPR pair with another entangled state, yielding a state |f_Ψ(φ)⟩ determined by a Ψ-dependent linear map.Entanglement swapping instead transfers an EPR relationship from a–d to c–d, with further compositional generalizations.

3 COMPACT CLOSED CATEGORIES AND THE LOGIC OF ENTANGLEMENT

Compact closed categories provide a resource-sensitive process framework in which scalars act globally, while their absorption and compositionality lemmas model information flow in teleportation and entanglement swapping. The graphical and relational accounts show how these flows arise through composition and constraints between components.

  • Compact closed categories: Symmetric monoidal categories support resource-sensitive logics because sequential and parallel composition preserve No-Cloning and No-Deleting.The tensor describes independent or concurrent actions without reconstructing an element from components.
  • Compact closed categories: Scalars are endomorphisms of the tensor unit, forming an always-commutative monoid whose elements induce natural scalar multiplication across the category.Scalar multiplication respects identities, composition, and tensor products, so scalars act globally on morphisms.
  • Compact closed categories: Rel and FdVecK are compact closed categories, supplying concrete models based respectively on relations with cartesian product and finite-dimensional vector spaces with tensor product.In Rel, duals are converse relations; in FdVecK, duals are spaces of linear functionals.
  • The logic of entanglement: Lemmas 6–9—absorption, compositionality, compositional CUT, and backward absorption—form the core interpretation of entanglement in compact closed categories.These lemmas can also be established in arbitrary ∗-autonomous categories.
  • The logic of entanglement: The absorption and compositionality lemmas capture quantum information flow in logic-gate teleportation and entanglement swapping.The graphical interpretation represents information as flowing along wires while functions and conames act through labeled boxes.
  • The logic of entanglement: In Rel, compositionality arises by imposing constraints between tuple components, and each teleportation branch satisfies the correctness equation i ◦ 1A ◦ βi = 1A.Logic-gate teleportation further yields h ◦ βi = U† ◦ h when U is unitary, while nondestructive measurement produces two distinct flows.

4 STRONGLY COMPACT CLOSED CATEGORIES AND 2-DIMENSIONAL DIRAC NOTATION

The section introduces strongly compact closed categories by adding a dagger structure that captures Hilbert-space adjoints, complex conjugation, and transpose abstractly. It then interprets Dirac notation and develops projectors, including a bipartite form that exposes information flow through Map-State duality.

  • Strongly compact closed categories: The covariant functor f 7→f∗, together with the dagger, abstracts transpose, complex conjugation, and conjugate transpose in FdHilb.The construction makes the adjoint available categorically while distinguishing it from the dual in Hilbert spaces.
  • Strongly compact closed categories: Strongly compact closed categories combine compact closure with a dagger symmetric monoidal structure satisfying a coherence condition.The dagger is an identity-on-objects, contravariant, strictly involutive functor, and the monoidal coherence maps are unitary.
  • Strongly compact closed categories: Self-adjoint scalars in FdHilb are positive reals, so the transformation s to ss† models the passage from quantum amplitudes to probabilities.This identifies a categorical role for positive quantities associated with measurement probabilities.
  • 2-dimensional Dirac notation: With the adjoint, kets are arrows I → A, bras are their daggers, and the abstract inner product is a scalar agreeing with the usual Hilbert-space inner product.Unitary morphisms preserve this inner product, generalizing a basic Hilbert-space property.
  • Projectors and information flow: A normalized state ψ yields a projector ψ◦ψ†, while a bipartite state in A∗⊗B corresponds to a map A → B whose name reveals information flow.The framework therefore provides an abstract fine-structure of bipartite projectors for analyzing information flow in quantum protocols.

5 BIPRODUCTS, BRANCHING AND MEASUREMENTS

Biproducts supply categorical quantum mechanics with probabilistic branching and quantum–classical information flow, while also inducing semi-additivity, distributivity, scalar arithmetic, and matrix calculus. These structures support spectral decompositions, bases, and matrix characterizations of adjoints and unitaries.

  • Biproducts, branching and measurements: Biproducts provide the missing structure for expressing measurement branching and information flow between quantum and classical systems.They complete the expressive power of strongly compact closed categories for these aspects of quantum mechanics.
  • Biproducts, branching and measurements: Categories with biproducts are semi-additive: hom-sets carry commutative addition with zero, and composition is bilinear.Thus such categories are enriched over abelian monoids.
  • Biproducts, branching and measurements: A compact closed category with either products or coproducts has biproducts and is therefore semi-additive.This follows from self-duality and adjoint preservation properties in compact closed categories.
  • Biproducts, branching and measurements: Tensor distributes over biproducts, allowing a local measurement outcome to propagate outward and control an action on another subsystem.The category has natural right and left distributivity isomorphisms.
  • Biproducts, branching and measurements: Biproducts yield a matrix calculus in which morphism addition becomes matrix addition and composition becomes matrix multiplication.In strongly compact closed categories with biproducts, scalars form a commutative semiring; for Hilbert spaces these are complex numbers, while in Rel they are {0, 1}.
  • Biproducts, branching and measurements: With bases, the matrix of an adjoint is the conjugate transpose, and a morphism is unitary exactly when it preserves the inner product.These results provide matrix characterizations of dagger and unitary structure.

6 ABSTRACT QUANTUM MECHANICS: AXIOMATICS AND QUANTUM PROTOCOLS

The section develops an axiomatic account of finitary quantum mechanics in semiadditive strongly compact closed categories with biproducts, including states, bases, transformations, measurements, and classical communication. It shows that the Born rule and teleportation protocols arise within this abstract framework, with correctness characterized by commuting diagrams and teleportation enabled by suitable bases.

  • Axiomatic ingredients: Finitary quantum mechanics is modeled in semiadditive strongly compact closed categories, where objects represent state spaces and tensor products represent compound systems.Computational bases extend to dual state spaces, while unitary isomorphisms represent basic data transformations.
  • Axiomatic ingredients: Measurements are represented by projectors and explicit biproducts, making nondeterministic transitions and outcome branching explicit.Distributivity isomorphisms propagate locally obtained measurement information globally, enabling operations conditioned on outcomes.
  • Born rule: The Born rule emerges automatically from the abstract setting, assigning probabilities to measurement outcomes through the scalar expression associated with each projector and preparation.The framework interprets scalar components as probability amplitudes whose dagger composites yield self-adjoint probabilities.
  • Quantum protocols: Any strongly compact closed category with biproducts admits quantum teleportation provided it contains a teleportation base, and the protocol is correct when its defining diagram commutes.Finitely generated free R-modules and R-linear maps form one such category and realize teleportation; Bell-base observations supply unitary corrections.
  • Quantum protocols: Logic-gate teleportation is correct for a unitary qubit gate f when each β_i intertwines with a corresponding morphism ϕ_i(f), while universal computation requires teleportation of Q ⊗Q-gates.The CNOT gate is presented as an example of the higher-dimensional teleportation needed for universality.

7 EXTENSIONS AND FURTHER DEVELOPMENTS · 7.1 Projective structure

The chapter surveys major extensions of categorical quantum axiomatics, focusing especially on a projective reformulation that removes redundant global phases while retaining tensor products. It develops this construction abstractly, characterizes its phase-elimination properties, and identifies incompatibilities between projective structure and biproducts.

  • 7 EXTENSIONS AND FURTHER DEVELOPMENTS: Since 2004, the authors and other researchers have proposed numerous elaborations of categorical quantum axiomatics, which the chapter surveys.The chapter gives considerably more attention to projective structure than to its other topics.
  • 7.1 Projective structure: The axiomatics describes pure states whose linear-algebraic representation carries redundant global phases, motivating passage to a projective perspective.This projective perspective enables comparison with standard quantum logic approaches.
  • 7.1 Projective structure: Projective quantum-logical lattices lack an obvious counterpart of the Hilbert-space tensor product, despite its importance in quantum information and computation.This absence is identified as one reason Birkhoff–von Neumann-style quantum logic did not enter mainstream physics.
  • 7.1 Projective structure: Starting from FdHilb, the construction abstracts strongly compact closed categories with additive structure and defines WProj(C) to eliminate redundant global scalars while preserving tensor products.WProj(C) has the same objects as C and is again strongly compact closed.
  • 7.1 Projective structure: Propositions 33 and 34 show that morphisms related by unitary-scaled scalars have equal f ⊗ f† projections, and conversely equal projections imply such scalar-related morphisms.The scalar factors satisfy s ◦ s† = t ◦ t†, with the first implication requiring both factors to normalize to the identity.
  • 7.1 Projective structure: Although biproducts do not survive passage from C to WProj(C), the resulting weaker structure still supports comprehensive descriptions of the discussed protocols and preserves distributivity isomorphisms.The distributivity maps involving 0 and tensor products carry over to WProj(C).
  • 7.1 Projective structure: Proposition 35 states that a projective strongly compact closed category with biproducts and ring scalars must satisfy 1 = −1, so it has no non-trivial negatives.The absence of non-trivial negatives obstructs the description of interference.

7.2 Mixed states and Completely Positive Maps

The categorical axiomatics primarily describes pure states, whereas quantum-information applications often require mixed states and completely positive maps. Selinger’s CPM-construction provides a categorical setting for these maps, recovering completely positive maps in CPM(FdHilb) and embedding WProj(C) faithfully.

  • Motivation: Quantum-information applications often require mixed states acted on by completely positive maps rather than the primarily pure-state setting.This motivates extending the categorical axiomatics to mixed-state processes.
  • CPM-construction: Selinger’s construction assigns a category CPM(C) to any strongly compact closed category C, retaining C’s objects and defining new morphisms.Composition in CPM(C) is inherited pointwise from C.
  • CPM-construction: In CPM(FdHilb), morphisms are exactly completely positive maps, while CPM(FdHilb)(C, H) consists exactly of self-adjoint operators with positive trace on H.These identifications connect the categorical construction to standard finite-dimensional quantum processes and states.
  • CPM-construction: WProj(C) faithfully embeds in CPM(C), linking the projective pure-state category to the completely positive-map setting.The embedding is obtained by the construction described in the passage.
  • Later developments: The CPM-construction extends beyond strong compact closure to dagger symmetric monoidal categories, with separate axiomatic presentations of completely positive-map categories.These developments are attributed to Coecke [2007, 2008].

7.3 Generalised No-Cloning and No-Deleting theorems

The categorical and logical framework yields generalized axiomatics for No-Cloning, No-Deleting, and No-Broadcasting, sharply delimiting the classical–quantum boundary. Under the stated copying assumptions, the category collapses, while related basis structures remain consistent and correspond to orthonormal bases.

  • Generalised No-Cloning and No-Deleting theorems: The framework enables a subtle classical–quantum boundary through generalized No-Cloning and No-Deleting axiomatics.Similar generalizations also hold for No-Broadcasting.
  • Generalised No-Cloning and No-Deleting theorems: Co-commutativity and co-associativity express order- and iteration-independence of copying, while naturality corresponds essentially to basis-independence.These requirements are motivated by the diagonal of the usual cartesian product.
  • Generalised No-Cloning and No-Deleting theorems: Under these assumptions, every endomorphism is a scalar multiple of the identity, so the category trivializes through collapse of its structure.The result shows that the combined quantum and classical features are inconsistent under the stated hypotheses.
  • Generalised No-Cloning and No-Deleting theorems: These results strengthen Joyal’s trivialization theorem by weakening the assumption of a full categorical product in the presence of a classical duality.They are visibly in the same genre as the trivialization of a Boolean cartesian closed category.
  • Generalised No-Cloning and No-Deleting theorems: Commutative comonoid structures in strongly compact closed categories can remain consistent with Frobenius structure and correspond to orthonormal bases.A given Hilbert space may have many such bases, distinguishing these structures from the collapsing combination above.

7.4 Basis Structures and Classical Information

Basis structures axiomatize measurement bases and classical information through copying and deleting operations, with commutative comonoids recovering orthonormal bases in FdHilb. They also characterize projective measurements and support generalized measurements, multipartite states, protocols, and finite-dimensional C*-algebras.

  • Biproducts provide an approach to measurements and classical information that emphasizes branching from probabilistic outcomes.
  • A chosen orthonormal basis defines classical data whose basis vectors can be copied and deleted, while a basis structure is a commutative comonoid with additional axioms.
  • The Frobenius identity is the key additional axiom, and in FdHilb basis structures correspond exactly to orthonormal bases.
  • In FdHilb, measurements defined as self-adjoint Eilenberg-Moore coalgebras correspond exactly to projective spectra and generalize to POVMs and PMVMs via abstract Naimark dilation.
  • Basis structures capture GHZ states canonically and provide an elegant description of the state-transfer protocol.
  • Dropping co-commutativity in FdHilb yields exactly all finite-dimensional C*-algebras rather than only orthonormal bases.
  • Multiplicative basis structures express measurements without explicit branching, while explicit branching can still be advantageous for avoiding combinatorial unwieldiness.

7.5 Complementary observables and phases

The section develops abstract phase groups from basis structures and introduces complementary observables via scaled bialgebra laws. Together, these structures describe linear maps in FdHilb and support an abstract account of the quantum Fourier transform.

  • Phases: Basis structures induce actions of points on objects, providing abstract counterparts to relative phases.These actions are defined for a basis structure on X and a point ψ : I → X.
  • Phases: Unbiased actions form an abelian phase group, corresponding for qubits in FdHilb to the Bloch sphere’s equator.All actions on C(I, X) form a commutative monoid, while those from unbiassed points form an abelian group.
  • Complementary observables: Complementary observables are axiomatised through basis structures satisfying scaled bialgebra laws.The scaled bialgebra structure and phase group together describe all linear maps, including multipartite states and unitary operators, in FdHilb.
  • Applications: The framework provides an abstract description of the quantum Fourier transform, central to Shor’s factoring algorithm.The quantum Fourier transform is presented as the key ingredient of Shor’s algorithm and a prominent example of a quantum algorithm.

7.6 The quantum harmonic oscillator · 7.7 Automated quantum reasoning

The chapter presents a categorical treatment of the quantum harmonic oscillator using exponential-level structure corresponding to Fock space, while positioning categorical structures as foundations for automated quantum reasoning tools. These tools have been implemented in Oxford MSc projects, with a comprehensive approach initiated by Lucas Dixon and Ross Duncan [2008].

  • 7.6 The quantum harmonic oscillator: Vicary [2007] gave a purely categorical treatment of the quantum harmonic oscillator in strongly compact closed categories with biproducts.The treatment is directly formulated in the categorical setting developed in the article.
  • 7.6 The quantum harmonic oscillator: The treatment introduces an ‘exponential level’ of structure corresponding to Fock space.This extends the categorical framework with structure associated with the oscillator’s Fock-space description.
  • 7.6 The quantum harmonic oscillator: A monoidal adjunction encodes the raising and lowering operators into a cocommutative comonoid.The adjunction is part of the exponential-level structure used in the categorical oscillator treatment.
  • 7.6 The quantum harmonic oscillator: Generalised coherent states arise through the hom-set isomorphisms defining the categorical structure.The passage identifies these states as another consequence of the hom-set isomorphisms.
  • 7.7 Automated quantum reasoning: The structures developed by the research programme provide a basis for software tools that automate reasoning about quantum phenomena, protocols and algorithms.The proposed tools are grounded in the categorical structures described throughout the chapter.
  • 7.7 Automated quantum reasoning: Several MSc students at Oxford University Computing Laboratory designed and implemented such automated quantum-reasoning tools for Masters Thesis projects.The passage reports completed student projects rather than only a proposed design.
  • 7.7 Automated quantum reasoning: An ongoing high-level comprehensive approach to automated quantum reasoning was recently initiated by Lucas Dixon and Ross Duncan [2008].This approach is described as ongoing and comprehensive at a high level.

7.8 Diagrammatic reasoning · 7.9 Free constructions · 7.10 Temperley-Lieb algebra and connections to knot theory and topological quantum field theory

Diagrammatic calculi formalize and communicate the categorical structures used in quantum mechanics, with free-category constructions providing a conceptual combinatorial basis. Weakening symmetry connects the framework to Temperley–Lieb algebra, knot theory, topology, logic, and open questions about planar and braided quantum information.

  • 7.8 Diagrammatic reasoning: Strong compact closure, biproducts, dagger Frobenius comonoids, phase groups, scaled bialgebras, and exponential structures admit intuitive diagrammatic presentations.These structures arise throughout the categorical account, including the description of the quantum harmonic oscillator.
  • 7.8 Diagrammatic reasoning: Diagrammatic calculi provide effective tools for communicating structural ideas and are supported by software for presenting and manipulating diagrams.The calculi serve as user interfaces in the software tools discussed earlier.
  • 7.9 Free constructions: Free strongly compact closed and traced monoidal categories can be described synthetically and conceptually, recovering the Kelly–Laplaza free compact closed-category construction.These free constructions are presented over a dagger category in simple, structured terms.
  • 7.9 Free constructions: Simple combinatorial descriptions of free categories provide a basis for diagrammatic calculi.The free constructions connect directly to the diagrammatic methods of the preceding subsection.
  • 7.10 Temperley-Lieb algebra and connections to knot theory and topological quantum field theory: Weakening symmetry to braided or pivotal structure connects categorical quantum mechanics with knot theory, topology, topological quantum field theories, and quantum groups.The Temperley–Lieb algebra is connected to the categorical axiomatics and plays a central role in the Jones polynomial.
  • 7.10 Temperley-Lieb algebra and connections to knot theory and topological quantum field theory: The Temperley–Lieb algebra is essentially the free planar version of the quantum setting, yielding quotient-free descriptions, completeness results for non-commutative logics, and planarity as an invariant of cut-elimination information flow.Its cups and caps correspond diagrammatically to the units and counits used in the categorical framework.
  • 7.10 Temperley-Lieb algebra and connections to knot theory and topological quantum field theory: Open questions concern whether quantum informatics can be developed in the plane, whether braiding’s three-dimensional information has computational significance, and how topological quantum field theories relate to quantum information.Motivations include topological quantum computing and the interaction of quantum informatics with spatio-temporal structure in distributed computing and security protocols.

7.11 Logical syntax · 7.12 Completeness · 7.13 Toy quantum categories

These sections develop categorical quantum mechanics through proof-net and compact-category syntax, establish Hilbert-space equational completeness, and interpret Spekkens’ toy model categorically. Together, they connect formal reasoning about quantum processes with completeness and concrete toy-category constructions.

  • 7.11 Logical syntax: A strongly normalising proof-net calculus represents the logic of strongly compact closed categories with biproducts.It is presented in Abramsky and Duncan (2006).
  • 7.11 Logical syntax: The calculus is a full and faithful representation of the free strongly compact closed category with biproducts on a category with involution.This syntax represents and supports reasoning about quantum processes.
  • 7.11 Logical syntax: The syntax was extended to describe the free strongly compact category generated by a monoidal category.This extension was applied to the measurement calculus.
  • 7.12 Completeness: Finite-dimensional Hilbert spaces are equationally complete for strongly compact closed categories.Thus, equations expressed purely in that language can be verified by checking them for Hilbert spaces.
  • 7.13 Toy quantum categories: Spekkens’ toy model of quantum mechanics can be regarded as an instance of categorical quantum axiomatics.This result is given by Coecke and Edwards (2008).
  • 7.13 Toy quantum categories: Spek is the dagger symmetric monoidal subcategory of Rel generated using powers-of-4 objects, the symmetry group on 4 elements, and a copying-deleting pair.The copying-deleting pair is chosen for the 4 element set.
Loading 0808.1023v1…