Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0506134 · Electronic Notes in Theoretical Computer Science

De-linearizing Linearity: Projective Quantum Axiomatics From Strong Compact Closure

Bob Coecke

Published Mar 1, 2007• 60 citations
arXivHTMLPDF

Abstract

Elaborating on our joint work with Abramsky in [S. Abramsky, B. Coecke, B. (2004) A categorical semantics of quantum protocols. Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LiCS'04), IEEE Computer Science Press. Extended version including proofs at arXiv:quant-ph/0402130, S. Abramsky, B. Coecke, (2005) Abstract physical traces. Theory and Applications of Categories 14, 111–124] we further unravel the linear structure of Hilbert spaces into several constituents. Some prove to be very crucial for particular features of quantum theory while others obstruct the passage to a formalism which is not saturated with physically insignificant global phases. First we show that the bulk of the required linear structure is purely multiplicative, and arises from the strongly compact closed tensor which, besides providing a variety of notions such as scalars, trace, unitarity, self-adjointness and bipartite projectors [S. Abramsky, B. Coecke, B. (2004) A categorical semantics of quantum protocols. Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LiCS'04), IEEE Computer Science Press. Extended version including proofs at arXiv:quant-ph/0402130, S. Abramsky, B. Coecke, (2005) Abstract physical traces. Theory and Applications of Categories 14, 111–124], also provides Hilbert-Schmidt norm, Hilbert-Schmidt inner-product, and in particular, the preparation-state agreement axiom which enables the passage from a formalism of the vector space kind to a rather projective one, as it was intended in the (in)famous Birkhoff & von Neumann paper [G. Birkhoff, J. von Neumann, (1936) The logic of quantum mechanics. Annals of Mathematics 37, 823–843]. Next we consider additive types which distribute over the tensor, from which measurements can be build, and the correctness proofs of the protocols discussed in [S. Abramsky, B. Coecke, (2004) A categorical semantics of quantum protocols. Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LiCS'04), IEEE Computer Science Press. Extended version including proofs at arXiv:quant-ph/0402130] carry over to the resulting weaker setting. A full probabilistic calculus is obtained when the trace is moreover linear and satisfies the diagonal axiom, which brings us to a second main result, characterization of the necessary and sufficient additive structure of a both qualitatively and quantitatively effective categorical quantum formalism without redundant global phases. Along the way we show that if in a category a (additive) monoidal tensor distributes over a strongly compact closed tensor, then this category is always enriched in commutative monoids.

DOI
10.1016/j.entcs.2006.12.011

Related papers

Strongly Compact Closed Semantics

Bob Coecke

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.

Electronic Notes in Theoretical Computer Science•May 1, 2006•4 citations

A Hierarchy of Quantum Semantics

Simon Perdrix

Several domains [S. Abramsky. A Cook's tour of a simple quantum programming language. 3rd International Symposium on Domain Theory, Xi'an, China, May 2004; B. Coecke and K. Martin. A partial order on classical and quantum states. Technical report, PRG-RR-02-07, 2002; Ph. Jorrand and S. Perdrix. Towards a quantum calculus. In To appear in Proceedings of the 4th International Workshop on Quantum Programming Languages, ENTCS, 2006; P. Selinger. Towards a quantum programming language. Mathematical Structures in Computer Science, 14(4):527–586, 2004] can be used to define the semantics of quantum programs. Among them Abramsky [S. Abramsky. A Cook's tour of a simple quantum programming language. 3rd International Symposium on Domain Theory, Xi'an, China, May 2004] has introduced a semantics based on probabilistic power domains, whereas the one by Selinger [P. Selinger. Towards a quantum programming language. Mathematical Structures in Computer Science, 14(4):527–586, 2004] associates with every program a completely positive map. In this paper, we mainly introduce a semantical domain based on admissible transformations, i.e. multisets of linear operators. In order to establish a comparison with existing domains, we introduce a simple quantum imperative language (QIL), equipped with three different denotational semantics, called pure, observable, and admissible respectively. The pure semantics is a natural extension of probabilistic (classical) semantics and is similar to the semantics proposed by Abramsky [S. Abramsky. A Cook's tour of a simple quantum programming language. 3rd International Symposium on Domain Theory, Xi'an, China, May 2004]. The observable semantics, à la Selinger [P. Selinger. Towards a quantum programming language. Mathematical Structures in Computer Science, 14(4):527–586, 2004], associates with any program a superoperator over density matrices. Finally, we introduce an admissible semantics which associates with any program an admissible transformation. These semantics are not equivalent, but exact abstraction [P. Cousot. Types as abstract interpretations. In POPL, pages 316–331, 1997] or interpretation relations are established between them, leading to a hierarchy of quantum semantics.

Electronic Notes in Theoretical Computer Science•Nov 1, 2008•6 citations

Axiomatic Description of Mixed States From Selinger's CPM-construction

Bob Coecke

We recast Selinger's CPM-construction of mixed states completely positive maps [P. Selinger (2007) Dagger compact closed categories and completely positive maps. In: Proceedings of the 3rd International Workshop on Quantum Programming Languages (QPL 2005), Electronic Notes in Theoretical Computer Science 170, 139–163. Available from Peter Selinger's homepage] as an axiomatization of maximally mixed states. This axiomatization also guarantees categories of completely positive maps to satisfy the preparation-state agreement axiom of [Coecke, B. (2007) De-linearizing linearity: projective quantum axiomatics from strong compact closure. In: Proceedings of the 3rd International Workshop on Quantum Programming Languages (QPL 2005), Electronic Notes in Theoretical Computer Science 170, 49–72. E-print: arXiv:quant-ph/0506134], and admits a physical interpretation in terms of purification of mixed states and CPMs. Internal traces, which are crucial in quantum information theory, are the adjoints to these maximally mixed states.

Electronic Notes in Theoretical Computer Science•Jul 1, 2008•38 citations

Quantum information-flow, concretely, and axiomatically

Bob Coecke

This paper surveys joint work with Samson Abramsky. I will somewhat informally discuss the main results of a series of papers in a pedestrian not too technical way. These include: . 'The logic of entanglement', that is, the identification and abstract axiomatization of the 'quantum information-flow' which enables protocols such as quantum teleportation. To this means we define strongly compact closed categories which abstractly capture the behavioral properties of quantum entanglement. . 'Postulates for an abstract quantum formalism' in which classical information-flow (e.g. token exchange) is part of the formalism. As an example, we provide a purely formal description of quantum teleportation and prove correctness in abstract generality. In this formalism types reflect kinds contra the essentially typeless von Neumann formalism. Hence even concretely this formalism manifestly improves on the usual one. .'Towards a high-level approach to quantum informatics'. Indeed the above discussed work can be conceived as aiming to solve: ???/von Neumann quantum formalism ≈ high-level language/low-level language

arXiv:quant-ph/0506132•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jun 1, 2005•18 citations

Kindergarten Quantum Mechanics

Bob Coecke

These lecture notes survey some joint work with Samson Abramsky as it was presented by me at several conferences in the summer of 2005. It concerns `doing quantum mechanics using only pictures of lines, squares, triangles and diamonds'. This picture calculus can be seen as a very substantial extension of Dirac's notation, and has a purely algebraic counterpart in terms of so-called Strongly Compact Closed Categories (introduced by Abramsky and I in quant-ph/0402130 and [4]) which subsumes my Logic of Entanglement quant-ph/0402014. For a survey on the `what', the `why' and the `hows' I refer to a previous set of lecture notes quant-ph/0506132. In a last section we provide some pointers to the body of technical literature on the subject.

arXiv:quant-ph/0510032•Oct 4, 2005•65 citations

Types for Quantum Computing

Duncan, Ross

This thesis is a study of the construction and representation of typed models of quantum mechanics for use in quantum computation. We introduce logical and graphical syntax for quantum mechanical processes and prove that these formal systems provide sound and complete representations of abstract quantum mechanics. In addition, we demonstrate how these representations may be used to reason about the behaviour of quantum computational processes. Quantum computation is presently mired in low-level formalisms, mostly derived directly from matrices over Hilbert spaces. These formalisms are an obstacle to the full understanding and exploitation of quantum effects in informatics since they obscure the essential structure of quantum states and processes. The aim of this work is to introduce higher level tools for quantum mechanics which will be better suited to computation than those presently employed in the field. Inessential details of Hilbert space representations are removed and the informatic structures are presented directly. Entangled states are particularly important in this treatment, as is appropriate, since entanglement is a fundamental driver of quantum computation. The benefits two-fold: as well as producing foundational tools for the study of quantum computation this work also connects quantum mechanics to mainstream areas of computer science such as categorical logic, type theory, program language semantics, and rewriting. We describe, following Abramsky and Coecke, how quantum mechanics may be carried out without reference to Hilbert space, in a strongly compact closed category. In particular we show how to freely construct a categorical model of abstract quantum mechanics from an arbitrary category. We introduceMultiplicative Categorical Quantum Logic (mCQL), a sequent calculus whose proof rules capture the structure of compact closed categories. This sequent calculus is interpreted in a freely generated compact closed category, and its semantics is sound with respect to cut elimination. We define an equivalent graphical syntax, similar to linear logic’s proof-nets, and prove that these proof-nets provide a full and faithful representation of any freely generated compact closed category. Further analysis of the structure of quantum states which correspond to mCQL proofs using multiplicative linear logic shows that the linear type system describes the quantum entanglement found in such states. We show that the entanglement present in these states is always of a particularly simple form: collections of entangled pairs. In order to tackle arbitrary entanglement, we generalise the work of Kelly and Laplaza to give a representation theorem for the free compact closed category by a polycategory. Such categories are shown to be equivalent to a generalised system of proof-nets whose axioms may have more than one premise

•Jan 1, 2006•34 citations
Elaborating on our joint work with Abramsky in [S. Abramsky, B. Coecke, B. (2004) A categorical semantics of quantum protocols. Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LiCS'04), IEEE Computer Science Press. Extended version including proofs at arXiv:quant-ph/0402130, S. Abramsky, B. Coecke, (2005) Abstract physical traces. Theory and Applications of Categories 14, 111–124] we further unravel the linear structure of Hilbert spaces into several constituents. Some prove to be very crucial for particular features of quantum theory while others obstruct the passage to a formalism which is not saturated with physically insignificant global phases. First we show that the bulk of the required linear structure is purely multiplicative, and arises from the strongly compact closed tensor which, besides providing a variety of notions such as scalars, trace, unitarity, self-adjointness and bipartite projectors [S. Abramsky, B. Coecke, B. (2004) A categorical semantics of quantum protocols. Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LiCS'04), IEEE Computer Science Press. Extended version including proofs at arXiv:quant-ph/0402130, S. Abramsky, B. Coecke, (2005) Abstract physical traces. Theory and Applications of Categories 14, 111–124], also provides Hilbert-Schmidt norm, Hilbert-Schmidt inner-product, and in particular, the preparation-state agreement axiom which enables the passage from a formalism of the vector space kind to a rather projective one, as it was intended in the (in)famous Birkhoff & von Neumann paper [G. Birkhoff, J. von Neumann, (1936) The logic of quantum mechanics. Annals of Mathematics 37, 823–843]. Next we consider additive types which distribute over the tensor, from which measurements can be build, and the correctness proofs of the protocols discussed in [S. Abramsky, B. Coecke, (2004) A categorical semantics of quantum protocols. Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LiCS'04), IEEE Computer Science Press. Extended version including proofs at arXiv:quant-ph/0402130] carry over to the resulting weaker setting. A full probabilistic calculus is obtained when the trace is moreover linear and satisfies the diagonal axiom, which brings us to a second main result, characterization of the necessary and sufficient additive structure of a both qualitatively and quantitatively effective categorical quantum formalism without redundant global phases. Along the way we show that if in a category a (additive) monoidal tensor distributes over a strongly compact closed tensor, then this category is always enriched in commutative monoids.
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.
Several domains [S. Abramsky. A Cook's tour of a simple quantum programming language. 3rd International Symposium on Domain Theory, Xi'an, China, May 2004; B. Coecke and K. Martin. A partial order on classical and quantum states. Technical report, PRG-RR-02-07, 2002; Ph. Jorrand and S. Perdrix. Towards a quantum calculus. In To appear in Proceedings of the 4th International Workshop on Quantum Programming Languages, ENTCS, 2006; P. Selinger. Towards a quantum programming language. Mathematical Structures in Computer Science, 14(4):527–586, 2004] can be used to define the semantics of quantum programs. Among them Abramsky [S. Abramsky. A Cook's tour of a simple quantum programming language. 3rd International Symposium on Domain Theory, Xi'an, China, May 2004] has introduced a semantics based on probabilistic power domains, whereas the one by Selinger [P. Selinger. Towards a quantum programming language. Mathematical Structures in Computer Science, 14(4):527–586, 2004] associates with every program a completely positive map. In this paper, we mainly introduce a semantical domain based on admissible transformations, i.e. multisets of linear operators. In order to establish a comparison with existing domains, we introduce a simple quantum imperative language (QIL), equipped with three different denotational semantics, called pure, observable, and admissible respectively. The pure semantics is a natural extension of probabilistic (classical) semantics and is similar to the semantics proposed by Abramsky [S. Abramsky. A Cook's tour of a simple quantum programming language. 3rd International Symposium on Domain Theory, Xi'an, China, May 2004]. The observable semantics, à la Selinger [P. Selinger. Towards a quantum programming language. Mathematical Structures in Computer Science, 14(4):527–586, 2004], associates with any program a superoperator over density matrices. Finally, we introduce an admissible semantics which associates with any program an admissible transformation. These semantics are not equivalent, but exact abstraction [P. Cousot. Types as abstract interpretations. In POPL, pages 316–331, 1997] or interpretation relations are established between them, leading to a hierarchy of quantum semantics.
We recast Selinger's CPM-construction of mixed states completely positive maps [P. Selinger (2007) Dagger compact closed categories and completely positive maps. In: Proceedings of the 3rd International Workshop on Quantum Programming Languages (QPL 2005), Electronic Notes in Theoretical Computer Science 170, 139–163. Available from Peter Selinger's homepage] as an axiomatization of maximally mixed states. This axiomatization also guarantees categories of completely positive maps to satisfy the preparation-state agreement axiom of [Coecke, B. (2007) De-linearizing linearity: projective quantum axiomatics from strong compact closure. In: Proceedings of the 3rd International Workshop on Quantum Programming Languages (QPL 2005), Electronic Notes in Theoretical Computer Science 170, 49–72. E-print: arXiv:quant-ph/0506134], and admits a physical interpretation in terms of purification of mixed states and CPMs. Internal traces, which are crucial in quantum information theory, are the adjoints to these maximally mixed states.
This paper surveys joint work with Samson Abramsky. I will somewhat informally discuss the main results of a series of papers in a pedestrian not too technical way. These include: . 'The logic of entanglement', that is, the identification and abstract axiomatization of the 'quantum information-flow' which enables protocols such as quantum teleportation. To this means we define strongly compact closed categories which abstractly capture the behavioral properties of quantum entanglement. . 'Postulates for an abstract quantum formalism' in which classical information-flow (e.g. token exchange) is part of the formalism. As an example, we provide a purely formal description of quantum teleportation and prove correctness in abstract generality. In this formalism types reflect kinds contra the essentially typeless von Neumann formalism. Hence even concretely this formalism manifestly improves on the usual one. .'Towards a high-level approach to quantum informatics'. Indeed the above discussed work can be conceived as aiming to solve: ???/von Neumann quantum formalism ≈ high-level language/low-level language
These lecture notes survey some joint work with Samson Abramsky as it was presented by me at several conferences in the summer of 2005. It concerns `doing quantum mechanics using only pictures of lines, squares, triangles and diamonds'. This picture calculus can be seen as a very substantial extension of Dirac's notation, and has a purely algebraic counterpart in terms of so-called Strongly Compact Closed Categories (introduced by Abramsky and I in quant-ph/0402130 and [4]) which subsumes my Logic of Entanglement quant-ph/0402014. For a survey on the `what', the `why' and the `hows' I refer to a previous set of lecture notes quant-ph/0506132. In a last section we provide some pointers to the body of technical literature on the subject.
This thesis is a study of the construction and representation of typed models of quantum mechanics for use in quantum computation. We introduce logical and graphical syntax for quantum mechanical processes and prove that these formal systems provide sound and complete representations of abstract quantum mechanics. In addition, we demonstrate how these representations may be used to reason about the behaviour of quantum computational processes. Quantum computation is presently mired in low-level formalisms, mostly derived directly from matrices over Hilbert spaces. These formalisms are an obstacle to the full understanding and exploitation of quantum effects in informatics since they obscure the essential structure of quantum states and processes. The aim of this work is to introduce higher level tools for quantum mechanics which will be better suited to computation than those presently employed in the field. Inessential details of Hilbert space representations are removed and the informatic structures are presented directly. Entangled states are particularly important in this treatment, as is appropriate, since entanglement is a fundamental driver of quantum computation. The benefits two-fold: as well as producing foundational tools for the study of quantum computation this work also connects quantum mechanics to mainstream areas of computer science such as categorical logic, type theory, program language semantics, and rewriting. We describe, following Abramsky and Coecke, how quantum mechanics may be carried out without reference to Hilbert space, in a strongly compact closed category. In particular we show how to freely construct a categorical model of abstract quantum mechanics from an arbitrary category. We introduceMultiplicative Categorical Quantum Logic (mCQL), a sequent calculus whose proof rules capture the structure of compact closed categories. This sequent calculus is interpreted in a freely generated compact closed category, and its semantics is sound with respect to cut elimination. We define an equivalent graphical syntax, similar to linear logic’s proof-nets, and prove that these proof-nets provide a full and faithful representation of any freely generated compact closed category. Further analysis of the structure of quantum states which correspond to mCQL proofs using multiplicative linear logic shows that the linear type system describes the quantum entanglement found in such states. We show that the entanglement present in these states is always of a particularly simple form: collections of entangled pairs. In order to tackle arbitrary entanglement, we generalise the work of Kelly and Laplaza to give a representation theorem for the free compact closed category by a polycategory. Such categories are shown to be equivalent to a generalised system of proof-nets whose axioms may have more than one premise