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:1405.1463 · Electronic Proceedings in Theoretical Computer Science

Mixed quantum states in higher categories

Chris Heunen, Jamie Vicary, Linde Wester

Published Dec 28, 2014• 20 citations
arXivHTMLPDF

Abstract

There are two ways to describe the interaction between classical and quantum information categorically: one based on completely positive maps between Frobenius algebras, the other using symmetric monoidal 2-categories. This paper makes a first step towards combining the two. The integrated approach allows a unified description of quantum teleportation and classical encryption in a single 2-category, as well as a universal security proof applicable simultaneously to both scenarios.

DOI
10.4204/eptcs.172.22

Related papers

Classical and quantum structures in computation

Linde Wester

Quantum mechanics exhibits many counter-intuitive features, which challenge our classical understanding of the world. This makes the theory simultaneously difficult to grasp, and a source of great potential for new technologies. We study various characteristics of classical and quantum mechanics and their respective roles in computation. This is interesting from a philosophical perspective, as it brings us a small step closer to understanding the nature of quantum mechanics. Furthermore, it leads us to discover scenarios where quantum resources provide a genuine advantage over classical resources, as well as more intuitive ways to model quantum protocols. Firstly, we explore the concept of quantum contextuality, which distinguishes uniquely-quantum experimental outcomes from outcomes that can be realised classically. In pursuit of a universal theory of contextuality, we unify two abstract frameworks: the sheaf-theoretic approach to contextuality by Abramsky and Brandenburger and the equivalence-based approach by Spekkens. We apply the sheaf-theoretic formalism to the field of communication complexity. We derive a bound on the success probability of a communication complexity protocol, based on the amount of contextuality present in its quantum resource. We provide a set of necessary conditions for distributed functions that allow a contextual advantage. Secondly, we consider a family of bicategorical models to describe the interaction of classical and quantum information in quantum protocols. We prove that this family is symmetric monoidal, and therefore suitable for describing compound and parallel protocols. This family serves as a mathematical foundation for the planar language for quantum protocols by Vi- cary. Important examples of this family are the bicategories 2Hilb and 2Vect. Additionally, we introduce the structure 2[CP∗[FHilb]], which contains a symmetric monoidal bicategory of mixed states and completely positive maps. This allows a unified description of quantum teleportation and classical encryption in a single 2-category, as well as a universal security proof applicable simultaneously to both scenarios. As part of the process, we develop extensive categorical machinery for constructing symmetric monoidal structures of bicategories, pseudo functors, pseudo transformations and modifications. We consider a method of constructing symmetric monoidal bicategories from symmetric monoidal double categories. We show that this method can be generalised to a functor from the locally cubical bicategory of monoidal double categories to the locally cubical bicategory of monoidal bicategories.

•Jan 1, 2018•0 citations

Higher Semantics of Quantum Protocols

Jamie Vicary

We propose a higher semantics for the description of quantum protocols, which deals with quantum and classical information in a unified way. Central to our approach is the modelling of classical data by information transfer to the environment, and the use of 2-category theory to formalize the resulting framework. This 2-categorical semantics has a graphical calculus, the diagrams of which correspond exactly to physically-implementable quantum procedures. Quantum teleportation in its most general sense is reformulated as the ability to remove correlations between a quantum system and its environment, and is represented by an elegant graphical identity. We use this new formalism to describe two new families of quantum protocols.

ACM/IEEE Symposium on Logic in Computer Science (LICS)•Jun 1, 2012•45 citations

Categories for Quantum Theory: An Introduction

Chris Heunen, Jamie Vicary

Abstract Monoidal category theory serves as a powerful framework for describing logical aspects of quantum theory, giving an abstract language for parallel and sequential composition and a conceptual way to understand many high-level quantum phenomena. Here, we lay the foundations for this categorical quantum mechanics, with an emphasis on the graphical calculus that makes computation intuitive. We describe superposition and entanglement using biproducts and dual objects, and show how quantum teleportation can be studied abstractly using these structures. We investigate monoids, Frobenius structures and Hopf algebras, showing how they can be used to model classical information and complementary observables. We describe the CP construction, a categorical tool to describe probabilistic quantum systems. The last chapter introduces higher categories, surface diagrams and 2-Hilbert spaces, and shows how the language of duality in monoidal 2-categories can be used to reason about quantum protocols, including quantum teleportation and dense coding. Previous knowledge of linear algebra, quantum information or category theory would give an ideal background for studying this text, but it is not assumed, with essential background material given in a self-contained introductory chapter. Throughout the text, we point out links with many other areas, such as representation theory, topology, quantum algebra, knot theory and probability theory, and present nonstandard models including sets and relations. All results are stated rigorously and full proofs are given as far as possible, making this book an invaluable reference for modern techniques in quantum logic, with much of the material not available in any other textbook.

•Nov 19, 2019•171 citations

Axiomatizing complete positivity

Oscar Cunningham, Chris Heunen

There are two ways to turn a categorical model for pure quantum theory into one for mixed quantum theory, both resulting in a category of completely positive maps. One has quantum systems as objects, whereas the other also allows classical systems on an equal footing. The former has been axiomatized using environment structures. We extend this axiomatization to the latter by introducing decoherence structures.

arXiv:1506.02931•Electronic Proceedings in Theoretical Computer Science•Nov 3, 2015•26 citations

Classical and Quantum Structuralism

Bob Coecke, Éric Oliver Paquette, Duško Pavlović

In recent work, several researchers including the authors have developed a categorical formalization of quantum mechanics in terms of symmetric monoidal dagger categories. In this framework, classical data turned out to be represented by an algebraic structure, that of special commutative dagger Frobenius algebras. This structure captures the distinct capabilities that apply to classical data – that they can be copied and deleted. In the present paper, we provide categorical semantics and diagrammatic representations of deterministic, nondeterministic, and probabilistic operations over classical data represented in this way. Moreover, a combination of some fundamental categorical constructions (the Kleisli construction of the category of free algebras and the Grothendieck construction of the total category of an indexed category) with the specific categorical presentations of pure and mixed quantum states provides a resource-sensitive categorical account of classical control of quantum data and of classical data resulting from quantum measurements, as well as of the classical data processing that may happen in between measurements and controls. Along the way we also discover some apparently novel quantum typing structures. One of the salient features of categorical quantum mechanics is still its graphic calculus, which allows succinct presentations of diverse quantum protocols. The elements of an abstract stochastic calculus are beginning to emerge from it, pointing toward convenient refinements of resource-sensitive logics that are hoped to capture the probabilistic content and limited observability of quantum data.

arXiv:0904.1997•Cambridge University Press eBooks•Nov 30, 2009•97 citations

Higher Quantum Theory

Jamie Vicary

We propose a 2-categorical formalism for describing classical information, quantum systems, and their interactions, based on the principle that classical information can be encoded as correlations between quantum systems. Applying this in the 2-category of 2-Hilbert spaces recovers ordinary quantum theory. The formalism gives a simple, graphical way to describe the specification and implementation of certain quantum procedures, which we use to investigate quantum teleportation, dense coding, complementarity and quantum erasure, verifying our results computationally using a software package.

arXiv:1207.4563•Jul 19, 2012•40 citations
There are two ways to describe the interaction between classical and quantum information categorically: one based on completely positive maps between Frobenius algebras, the other using symmetric monoidal 2-categories. This paper makes a first step towards combining the two. The integrated approach allows a unified description of quantum teleportation and classical encryption in a single 2-category, as well as a universal security proof applicable simultaneously to both scenarios.
Quantum mechanics exhibits many counter-intuitive features, which challenge our classical understanding of the world. This makes the theory simultaneously difficult to grasp, and a source of great potential for new technologies. We study various characteristics of classical and quantum mechanics and their respective roles in computation. This is interesting from a philosophical perspective, as it brings us a small step closer to understanding the nature of quantum mechanics. Furthermore, it leads us to discover scenarios where quantum resources provide a genuine advantage over classical resources, as well as more intuitive ways to model quantum protocols. Firstly, we explore the concept of quantum contextuality, which distinguishes uniquely-quantum experimental outcomes from outcomes that can be realised classically. In pursuit of a universal theory of contextuality, we unify two abstract frameworks: the sheaf-theoretic approach to contextuality by Abramsky and Brandenburger and the equivalence-based approach by Spekkens. We apply the sheaf-theoretic formalism to the field of communication complexity. We derive a bound on the success probability of a communication complexity protocol, based on the amount of contextuality present in its quantum resource. We provide a set of necessary conditions for distributed functions that allow a contextual advantage. Secondly, we consider a family of bicategorical models to describe the interaction of classical and quantum information in quantum protocols. We prove that this family is symmetric monoidal, and therefore suitable for describing compound and parallel protocols. This family serves as a mathematical foundation for the planar language for quantum protocols by Vi- cary. Important examples of this family are the bicategories 2Hilb and 2Vect. Additionally, we introduce the structure 2[CP∗[FHilb]], which contains a symmetric monoidal bicategory of mixed states and completely positive maps. This allows a unified description of quantum teleportation and classical encryption in a single 2-category, as well as a universal security proof applicable simultaneously to both scenarios. As part of the process, we develop extensive categorical machinery for constructing symmetric monoidal structures of bicategories, pseudo functors, pseudo transformations and modifications. We consider a method of constructing symmetric monoidal bicategories from symmetric monoidal double categories. We show that this method can be generalised to a functor from the locally cubical bicategory of monoidal double categories to the locally cubical bicategory of monoidal bicategories.
We propose a higher semantics for the description of quantum protocols, which deals with quantum and classical information in a unified way. Central to our approach is the modelling of classical data by information transfer to the environment, and the use of 2-category theory to formalize the resulting framework. This 2-categorical semantics has a graphical calculus, the diagrams of which correspond exactly to physically-implementable quantum procedures. Quantum teleportation in its most general sense is reformulated as the ability to remove correlations between a quantum system and its environment, and is represented by an elegant graphical identity. We use this new formalism to describe two new families of quantum protocols.
Abstract Monoidal category theory serves as a powerful framework for describing logical aspects of quantum theory, giving an abstract language for parallel and sequential composition and a conceptual way to understand many high-level quantum phenomena. Here, we lay the foundations for this categorical quantum mechanics, with an emphasis on the graphical calculus that makes computation intuitive. We describe superposition and entanglement using biproducts and dual objects, and show how quantum teleportation can be studied abstractly using these structures. We investigate monoids, Frobenius structures and Hopf algebras, showing how they can be used to model classical information and complementary observables. We describe the CP construction, a categorical tool to describe probabilistic quantum systems. The last chapter introduces higher categories, surface diagrams and 2-Hilbert spaces, and shows how the language of duality in monoidal 2-categories can be used to reason about quantum protocols, including quantum teleportation and dense coding. Previous knowledge of linear algebra, quantum information or category theory would give an ideal background for studying this text, but it is not assumed, with essential background material given in a self-contained introductory chapter. Throughout the text, we point out links with many other areas, such as representation theory, topology, quantum algebra, knot theory and probability theory, and present nonstandard models including sets and relations. All results are stated rigorously and full proofs are given as far as possible, making this book an invaluable reference for modern techniques in quantum logic, with much of the material not available in any other textbook.
In recent work, several researchers including the authors have developed a categorical formalization of quantum mechanics in terms of symmetric monoidal dagger categories. In this framework, classical data turned out to be represented by an algebraic structure, that of special commutative dagger Frobenius algebras. This structure captures the distinct capabilities that apply to classical data – that they can be copied and deleted. In the present paper, we provide categorical semantics and diagrammatic representations of deterministic, nondeterministic, and probabilistic operations over classical data represented in this way. Moreover, a combination of some fundamental categorical constructions (the Kleisli construction of the category of free algebras and the Grothendieck construction of the total category of an indexed category) with the specific categorical presentations of pure and mixed quantum states provides a resource-sensitive categorical account of classical control of quantum data and of classical data resulting from quantum measurements, as well as of the classical data processing that may happen in between measurements and controls. Along the way we also discover some apparently novel quantum typing structures. One of the salient features of categorical quantum mechanics is still its graphic calculus, which allows succinct presentations of diverse quantum protocols. The elements of an abstract stochastic calculus are beginning to emerge from it, pointing toward convenient refinements of resource-sensitive logics that are hoped to capture the probabilistic content and limited observability of quantum data.
We propose a 2-categorical formalism for describing classical information, quantum systems, and their interactions, based on the principle that classical information can be encoded as correlations between quantum systems. Applying this in the 2-category of 2-Hilbert spaces recovers ordinary quantum theory. The formalism gives a simple, graphical way to describe the specification and implementation of certain quantum procedures, which we use to investigate quantum teleportation, dense coding, complementarity and quantum erasure, verifying our results computationally using a software package.