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:1807.11399 · EPiC series in computing

Who Needs Category Theory?

Andreas R. Blass, Yuri G. Gurevich

Published Mar 7, 2020• 2 citations
arXivHTMLPDF

Abstract

In mathematical applications, category theory remains a contentious issue, with enthusiastic fans and a skeptical majority. In a muted form this split applies to the authors of this note. When we learned that the only mathematically sound foundation of topological quantum computing in the literature is based on category theory, the skeptical author suggested to "decategorize" the foundation. But we discovered, to our surprise, that category theory (or something like it) is necessary for the purpose, for computational reasons. The goal of this note is to give a high- level explanation of that necessity, which avoids details and which suggests that the case of topological quantum computing is far from unique.

DOI
10.29007/4dr3

Related papers

From categories to anyons: a travelogue

Kerstin Beer, Bondarenko, Dmytro, Alexander Hahn +8 more

In this paper we provide an overview of category theory, focussing on applications in physics. The route we follow is motivated by the final goal of understanding anyons and topological QFTs using category theory. This entails introducing modular tensor categories and fusion rings. Rather than providing an in-depth mathematical development we concentrate instead on presenting the "highlights for a physicist".

arXiv:1811.06670•Nov 14, 2018•20 citations

A (very) brief tour of quantum mechanics, computation, and category theory

Jennifer Chubb, Valentina Harizanov

Cambridge University Press eBooks•Feb 26, 2016•2 citations

Notes on Quantum Mechanics

Klaus J. Schulten

The following notes introduce Quantum Mechanics at an advanced level addressing students of Physics, Mathematics, Chemistry and Electrical Engineering. The aim is to put mathematical concepts and techniques like the path integral, algebraic techniques, Lie algebras and representation theory at the readers disposal. For this purpose we attempt to motivate the various physical and mathematical concepts as well as provide detailed derivations and complete sample calculations. We have made every effort to include in the derivations all assumptions and all mathematical steps implied, avoiding omission of supposedly ‘trivial’ information. Much of the author’s writing effort went into a web of cross references accompanying the mathematical derivations such that the intelligent and diligent reader should be able to follow the text with relative ease, in particular, also when mathematically difficult material is presented. In fact, the author’s driving force has been his desire to pave the reader’s way into territories unchartered previously in most introductory textbooks, since few practitioners feel obliged to ease access to their field. Also the author embraced enthusiastically the potential of the TEX typesetting language to enhance the presentation of equations as to make the logical pattern behind the mathematics as transparent as possible. Any suggestion to improve the text in the respects mentioned are most welcome. It is obvious, that even though these notes attempt to serve the reader as much as was possible for the author, the main effort to follow the text and to master

•Aug 28, 2014•7 citations

Quantum picturalism

Bob Coecke

Why did it take us 50 years since the birth of the quantum mechanical formalism to discover that unknown quantum states cannot be cloned? Yet, the proof of the ‘no-cloning theorem’ is easy, and its consequences and potential for applications are immense. Similarly, why did it take us 60 years to discover the conceptually intriguing and easily derivable physical phenomenon of ‘quantum teleportation’? We claim that the quantum mechanical formalism doesn't support our intuition, nor does it elucidate the key concepts that govern the behaviour of the entities that are subject to the laws of quantum physics. The arrays of complex numbers are kin to the arrays of 0s and 1s of the early days of computer programming practice. Using a technical term from computer science, the quantum mechanical formalism is ‘low-level’. In this review we present steps towards a diagrammatic ‘high-level’ alternative for the Hilbert space formalism, one which appeals to our intuition. The diagrammatic language as it currently stands allows for intuitive reasoning about interacting quantum systems, and trivialises many otherwise involved and tedious computations. It clearly exposes limitations such as the no-cloning theorem, and phenomena such as quantum teleportation. As a logic, it supports ‘automation’: it enables a (classical) computer to reason about interacting quantum systems, prove theorems, and design protocols. It allows for a wider variety of underlying theories, and can be easily modified, having the potential to provide the required step-stone towards a deeper conceptual understanding of quantum theory, as well as its unification with other physical theories. Specific applications discussed here are purely diagrammatic proofs of several quantum computational schemes, as well as an analysis of the structural origin of quantum non-locality. The underlying mathematical foundation of this high-level diagrammatic formalism relies on so-called monoidal categories, a product of a fairly recent development in mathematics. Its logical underpinning is linear logic, an even more recent product of research in logic and computer science. These monoidal categories do not only provide a natural foundation for physical theories, but also for proof theory, logic, programming languages, biology, cooking, … So the challenge is to discover the necessary additional pieces of structure that allow us to predict genuine quantum phenomena. These additional pieces of structure represent the capabilities nature has provided us with to manipulate entities subject to the laws of quantum theory.

arXiv:0908.1787•Contemporary Physics•Dec 15, 2009•219 citations

Introducing categories to the practicing physicist

Bob Coecke

We argue that category theory should become a part of the daily practice of the physicist, and more specific, the quantum physicist and/or informatician. The reason for this is not that category theory is a better way of doing mathematics, but that monoidal categories constitute the actual algebra of practicing physics. We will not provide rigorous definitions or anything resembling a coherent mathematical theory, but we will take the reader for a journey introducing concepts which are part of category theory in a manner that the physicist will recognize them.

arXiv:0808.1032•Aug 7, 2008•61 citations

The ribbon category framework for topological quantum computing

Willie Aboumrad

This expository article supplies the mathematical background underpinning the braid representation calculator introduced in arXiv:2212.00831; those representations describe the sets of logic gates available to a topological quantum computer for processing encoded qubits. Assuming little background in category theory, we first recall the notion of a ribbon fusion category (RFC), collecting most of the necessary definitions. Then we discuss how certain RFCs arise from the representation theory of quantum groups. We explore the braiding in these categories in detail, since it is essential for the quantum computing application.

arXiv:2212.02921•Dec 6, 2022•0 citations
In mathematical applications, category theory remains a contentious issue, with enthusiastic fans and a skeptical majority. In a muted form this split applies to the authors of this note. When we learned that the only mathematically sound foundation of topological quantum computing in the literature is based on category theory, the skeptical author suggested to "decategorize" the foundation. But we discovered, to our surprise, that category theory (or something like it) is necessary for the purpose, for computational reasons. The goal of this note is to give a high- level explanation of that necessity, which avoids details and which suggests that the case of topological quantum computing is far from unique.
The following notes introduce Quantum Mechanics at an advanced level addressing students of Physics, Mathematics, Chemistry and Electrical Engineering. The aim is to put mathematical concepts and techniques like the path integral, algebraic techniques, Lie algebras and representation theory at the readers disposal. For this purpose we attempt to motivate the various physical and mathematical concepts as well as provide detailed derivations and complete sample calculations. We have made every effort to include in the derivations all assumptions and all mathematical steps implied, avoiding omission of supposedly ‘trivial’ information. Much of the author’s writing effort went into a web of cross references accompanying the mathematical derivations such that the intelligent and diligent reader should be able to follow the text with relative ease, in particular, also when mathematically difficult material is presented. In fact, the author’s driving force has been his desire to pave the reader’s way into territories unchartered previously in most introductory textbooks, since few practitioners feel obliged to ease access to their field. Also the author embraced enthusiastically the potential of the TEX typesetting language to enhance the presentation of equations as to make the logical pattern behind the mathematics as transparent as possible. Any suggestion to improve the text in the respects mentioned are most welcome. It is obvious, that even though these notes attempt to serve the reader as much as was possible for the author, the main effort to follow the text and to master
Why did it take us 50 years since the birth of the quantum mechanical formalism to discover that unknown quantum states cannot be cloned? Yet, the proof of the ‘no-cloning theorem’ is easy, and its consequences and potential for applications are immense. Similarly, why did it take us 60 years to discover the conceptually intriguing and easily derivable physical phenomenon of ‘quantum teleportation’? We claim that the quantum mechanical formalism doesn't support our intuition, nor does it elucidate the key concepts that govern the behaviour of the entities that are subject to the laws of quantum physics. The arrays of complex numbers are kin to the arrays of 0s and 1s of the early days of computer programming practice. Using a technical term from computer science, the quantum mechanical formalism is ‘low-level’. In this review we present steps towards a diagrammatic ‘high-level’ alternative for the Hilbert space formalism, one which appeals to our intuition. The diagrammatic language as it currently stands allows for intuitive reasoning about interacting quantum systems, and trivialises many otherwise involved and tedious computations. It clearly exposes limitations such as the no-cloning theorem, and phenomena such as quantum teleportation. As a logic, it supports ‘automation’: it enables a (classical) computer to reason about interacting quantum systems, prove theorems, and design protocols. It allows for a wider variety of underlying theories, and can be easily modified, having the potential to provide the required step-stone towards a deeper conceptual understanding of quantum theory, as well as its unification with other physical theories. Specific applications discussed here are purely diagrammatic proofs of several quantum computational schemes, as well as an analysis of the structural origin of quantum non-locality. The underlying mathematical foundation of this high-level diagrammatic formalism relies on so-called monoidal categories, a product of a fairly recent development in mathematics. Its logical underpinning is linear logic, an even more recent product of research in logic and computer science. These monoidal categories do not only provide a natural foundation for physical theories, but also for proof theory, logic, programming languages, biology, cooking, … So the challenge is to discover the necessary additional pieces of structure that allow us to predict genuine quantum phenomena. These additional pieces of structure represent the capabilities nature has provided us with to manipulate entities subject to the laws of quantum theory.
We argue that category theory should become a part of the daily practice of the physicist, and more specific, the quantum physicist and/or informatician. The reason for this is not that category theory is a better way of doing mathematics, but that monoidal categories constitute the actual algebra of practicing physics. We will not provide rigorous definitions or anything resembling a coherent mathematical theory, but we will take the reader for a journey introducing concepts which are part of category theory in a manner that the physicist will recognize them.
This expository article supplies the mathematical background underpinning the braid representation calculator introduced in arXiv:2212.00831; those representations describe the sets of logic gates available to a topological quantum computer for processing encoded qubits. Assuming little background in category theory, we first recall the notion of a ribbon fusion category (RFC), collecting most of the necessary definitions. Then we discuss how certain RFCs arise from the representation theory of quantum groups. We explore the braiding in these categories in detail, since it is essential for the quantum computing application.