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

Classical and quantum structures in computation

Linde Wester

Published Jan 1, 2018• 0 citations
Publisher

Abstract

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.

DOI
10.5287/ora-0o91vdgjp

Related papers

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

Sheaf-Theoretic Methods in Quantum Mechanics and Quantum Information Theory

Constantin, Carmen Maria

In this thesis we use the language of sheaf theory in order to develop a deeper understanding of some of the fundamental differences - such as entanglement, contextuality and non-locality - between quantum and classical physics. We first present, based on the work of Abramsky and Brandenburger, how sheaves, defined over certain posets of physically meaningful contexts, give a natural setting for capturing and analysing important quantum mechanical phenomena, such as quantum non-locality and contextuality. We also describe how this setting naturally leads to a three level hierarchy of quantum contextuality: weak contextuality, logical non-locality and strong contextuality. We use these insights in order to classify certain multipartite entangled states. Almost all of these turn out to be at least logically non-local, and a number of them even turn out to be strongly contextual. We further extend this result by showing that all n-qubit entangled states, with the exception of tensor products of single-qubit and bipartite maximally-entangled states, are logically non-local. Our proof is constructive: given any n-qubit state, we present an algorithm which produces n+2 local observables witnessing its logical non-locality. In the second half of the thesis we use the same basic principle of sheaves defined over physically meaningful contexts, in order to present an elegant mathematical language, known under the name of the Topos Approach, in which many quantum mechanical concepts, such as states, observables, and propositions about these, can be expressed. We then show that the language of the Topos Approach is as least as expressive, in logical terms, as traditional quantum logic. Finally, starting from a topos-theoretic perspective, we develop the construction of contextual entropy in order to give a unified treatment of classical and quantum notions of information theoretic entropy.

arXiv:1510.02561•Jan 1, 2015•7 citations

Categorical Semantics for Quantum Vector Spaces

PAULO SÉRGIO DE ANDRADE

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.

•Nov 22, 2025•0 citations

Categorical quantum computation

Paquette, Éric Oliver

Quantum computation is a sub-discipline of computer science that studies computation performed using quantum-mechanical phenomena such as entanglement and the principle of quantum superposition. The work presented in this dissertation is part of a program of research initiated by S. Abramsky and B. Coecke that aims to establish a categorical foundation for quantum computation. The usual axiomatisation of quantum computation uses the biproduct structure to express the classical fragment of the theory that comprises, for instance, the result of a measurement or classical control. Following the work of S. Abramsky and B. Coecke, that of P. Selinger for the quantum aspect, and that of B. Coecke and D. Pavlovic for the classical aspect, we will introduce a complete categorical semantics for quantum computation that includes bath the classical and the quantum fragments of the theory. In order to do so, we will introduce the notion of classical-quantum interface, which is sufficiently general to include the two fragments of the theory. Moreover, the classical fragment will be axiomatised exclusively with respect to the tensorial structure, i.e., without using biproducts. In particular, such an approach enables the use of an intuitive and rigorous graphical calculus as a proof technique which is often easier to use than the usual algebraic techniques. Moreover, we will see that the axiomatisation of basis structures from which is derived the notion of classical transformation also enables the definition of many families of classical transformations such as relations, functions, bijections, and stochastic and bistochastic transformations; the latter three being especially suitable in the context of quantum computation. Finally, we will present some quantum protocols and prove some results concerning these, using a graphical calculus developed for the categorical semantics in order to illustrates the usefulness and the well-foundedness of the theory. Key words: Quantum computation. Classical control. Category theory. Compact closed categories. †-monoidal categories. †-compact categories. Classical-quantum interfaces.

•Jan 1, 2008•7 citations

Bicategorical Semantics for Nondeterministic Computation

Mike Stay, Jamie Vicary

We present a topological bicategorical syntax for the interaction between public and private information in classical information theory. This allows high-level graphical definitions of encrypted communication and secret sharing, including a characterization of their security properties, which are automatically satisfied with no extra axioms required. This analysis shows that these protocols have an identical abstract form to the quantum teleportation and dense coding procedures, giving a concrete mathematical analogy between quantum and classical computing. Specific implementations of these protocols as nondeterministic classical procedures are recovered by applying our formalism in a symmetric monoidal bicategory of matrices of relations. http://www.elsevier.nl/locate/entcs.

arXiv:1301.3393•Electronic Notes in Theoretical Computer Science•Nov 1, 2013•14 citations

Mixed quantum states in higher categories

Chris Heunen, Jamie Vicary, Linde Wester

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.

arXiv:1405.1463•Electronic Proceedings in Theoretical Computer Science•Dec 28, 2014•20 citations
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.
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 this thesis we use the language of sheaf theory in order to develop a deeper understanding of some of the fundamental differences - such as entanglement, contextuality and non-locality - between quantum and classical physics. We first present, based on the work of Abramsky and Brandenburger, how sheaves, defined over certain posets of physically meaningful contexts, give a natural setting for capturing and analysing important quantum mechanical phenomena, such as quantum non-locality and contextuality. We also describe how this setting naturally leads to a three level hierarchy of quantum contextuality: weak contextuality, logical non-locality and strong contextuality. We use these insights in order to classify certain multipartite entangled states. Almost all of these turn out to be at least logically non-local, and a number of them even turn out to be strongly contextual. We further extend this result by showing that all n-qubit entangled states, with the exception of tensor products of single-qubit and bipartite maximally-entangled states, are logically non-local. Our proof is constructive: given any n-qubit state, we present an algorithm which produces n+2 local observables witnessing its logical non-locality. In the second half of the thesis we use the same basic principle of sheaves defined over physically meaningful contexts, in order to present an elegant mathematical language, known under the name of the Topos Approach, in which many quantum mechanical concepts, such as states, observables, and propositions about these, can be expressed. We then show that the language of the Topos Approach is as least as expressive, in logical terms, as traditional quantum logic. Finally, starting from a topos-theoretic perspective, we develop the construction of contextual entropy in order to give a unified treatment of classical and quantum notions of information theoretic entropy.
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.
Quantum computation is a sub-discipline of computer science that studies computation performed using quantum-mechanical phenomena such as entanglement and the principle of quantum superposition. The work presented in this dissertation is part of a program of research initiated by S. Abramsky and B. Coecke that aims to establish a categorical foundation for quantum computation. The usual axiomatisation of quantum computation uses the biproduct structure to express the classical fragment of the theory that comprises, for instance, the result of a measurement or classical control. Following the work of S. Abramsky and B. Coecke, that of P. Selinger for the quantum aspect, and that of B. Coecke and D. Pavlovic for the classical aspect, we will introduce a complete categorical semantics for quantum computation that includes bath the classical and the quantum fragments of the theory. In order to do so, we will introduce the notion of classical-quantum interface, which is sufficiently general to include the two fragments of the theory. Moreover, the classical fragment will be axiomatised exclusively with respect to the tensorial structure, i.e., without using biproducts. In particular, such an approach enables the use of an intuitive and rigorous graphical calculus as a proof technique which is often easier to use than the usual algebraic techniques. Moreover, we will see that the axiomatisation of basis structures from which is derived the notion of classical transformation also enables the definition of many families of classical transformations such as relations, functions, bijections, and stochastic and bistochastic transformations; the latter three being especially suitable in the context of quantum computation. Finally, we will present some quantum protocols and prove some results concerning these, using a graphical calculus developed for the categorical semantics in order to illustrates the usefulness and the well-foundedness of the theory. Key words: Quantum computation. Classical control. Category theory. Compact closed categories. †-monoidal categories. †-compact categories. Classical-quantum interfaces.
We present a topological bicategorical syntax for the interaction between public and private information in classical information theory. This allows high-level graphical definitions of encrypted communication and secret sharing, including a characterization of their security properties, which are automatically satisfied with no extra axioms required. This analysis shows that these protocols have an identical abstract form to the quantum teleportation and dense coding procedures, giving a concrete mathematical analogy between quantum and classical computing. Specific implementations of these protocols as nondeterministic classical procedures are recovered by applying our formalism in a symmetric monoidal bicategory of matrices of relations. http://www.elsevier.nl/locate/entcs.