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/0003128 · Foundations of Computational Mathematics

Quantum Computation and the Localization of Modular Functors

Michael Hartley Freedman

Published Jan 1, 2001• 65 citations
arXivHTMLPDF
DOI
10.1007/s102080010006

Related papers

A Modular Functor Which is Universal¶for Quantum Computation

Michael Hartley Freedman, Michael Larsen, Zhenghan Wang

arXiv:quant-ph/0001108•Communications in Mathematical Physics•Jun 1, 2002•583 citations

Models of quantum computation

Mingsheng Ying

Elsevier eBooks•Jan 1, 2024•0 citations

Quantum Computation and Its Perspective

Craig S. Lent

FEDジャ-ナル•Mar 1, 1997•2 citations

Topological Quantum Computation

Michael Hartley Freedman, Alexei Kitaev, Larsen, Michael J. +1 more

The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones polynomial and arise in Witten-Chern-Simons theory. The braiding and fusion of anyonic excitations in quantum Hall electron liquids and 2D-magnets are modeled by modular functors, opening a new possibility for the realization of quantum computers. The chief advantage of anyonic computation would be physical error correction: An error rate scaling like $e^{-\ał}$, where $ł$ is a length scale, and $α$ is some positive constant. In contrast, the $\q$presumptive" qubit-model of quantum computation, which repairs errors combinatorically, requires a fantastically low initial error rate (about $10^{-4}$) before computation can be stabilized.

arXiv:quant-ph/0101025•Jan 4, 2001•3 citations

Topological quantum computation

Michael Hartley Freedman, Alexei Kitaev, Michael Larsen +1 more

The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones polynomial and arise in Witten-Chern-Simons theory. The braiding and fusion of anyonic excitations in quantum Hall electron liquids and 2D-magnets are modeled by modular functors, opening a new possibility for the realization of quantum computers. The chief advantage of anyonic computation would be physical error correction: An error rate scaling like e − α ℓ e^{-\alpha \ell } , where ℓ \ell is a length scale, and α \alpha is some positive constant. In contrast, the “presumptive" qubit-model of quantum computation, which repairs errors combinatorically, requires a fantastically low initial error rate (about 10 − 4 10^{-4} ) before computation can be stabilized.

Bulletin of the American Mathematical Society•Oct 10, 2002•669 citations

A categorical semantics for topological quantum computation

Eric Olive Paquette

The aim of this thesis is to develop an abstract categorical setup in order to show that C -colored manifolds (i.e. compact closed manifolds with boundary where each boundary component is colored with an object of a semisimple strongly ribbon category) behaves basically in a similar manner as quantum circuits under the action of a unitary modular functor. There, the set of gates is composed only of braid operations, rotations and Dehn-twists. We first introduce the basic mathematical structure of a quantum circuit. We then provide a complete development of a 2-dimensional CW-complex over an extended surface. Furthermore, we provide a complete development of the categorical framework in order to construct a C -extended unitary modular functor (UMF) acting from the category of C -colored surfaces and morphisms of C -colored surfaces to the category of finite-dimensional vector spaces and linear isomorphisms. We then conclude by giving a complete semantics for topological quantum computation including an abstract version of the inner product, basic data units, basic data transformations, projectors and the notion of topological invariance of the algorithms.

•Jan 1, 2004•1 citation
The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones polynomial and arise in Witten-Chern-Simons theory. The braiding and fusion of anyonic excitations in quantum Hall electron liquids and 2D-magnets are modeled by modular functors, opening a new possibility for the realization of quantum computers. The chief advantage of anyonic computation would be physical error correction: An error rate scaling like $e^{-\ał}$, where łłł is a length scale, and ααα is some positive constant. In contrast, the $\q$presumptive" qubit-model of quantum computation, which repairs errors combinatorically, requires a fantastically low initial error rate (about 10−410^{-4}10−4) before computation can be stabilized.
The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones polynomial and arise in Witten-Chern-Simons theory. The braiding and fusion of anyonic excitations in quantum Hall electron liquids and 2D-magnets are modeled by modular functors, opening a new possibility for the realization of quantum computers. The chief advantage of anyonic computation would be physical error correction: An error rate scaling like e − α ℓ e^{-\alpha \ell } , where ℓ \ell is a length scale, and α \alpha is some positive constant. In contrast, the “presumptive" qubit-model of quantum computation, which repairs errors combinatorically, requires a fantastically low initial error rate (about 10 − 4 10^{-4} ) before computation can be stabilized.
The aim of this thesis is to develop an abstract categorical setup in order to show that C -colored manifolds (i.e. compact closed manifolds with boundary where each boundary component is colored with an object of a semisimple strongly ribbon category) behaves basically in a similar manner as quantum circuits under the action of a unitary modular functor. There, the set of gates is composed only of braid operations, rotations and Dehn-twists. We first introduce the basic mathematical structure of a quantum circuit. We then provide a complete development of a 2-dimensional CW-complex over an extended surface. Furthermore, we provide a complete development of the categorical framework in order to construct a C -extended unitary modular functor (UMF) acting from the category of C -colored surfaces and morphisms of C -colored surfaces to the category of finite-dimensional vector spaces and linear isomorphisms. We then conclude by giving a complete semantics for topological quantum computation including an abstract version of the inner product, basic data units, basic data transformations, projectors and the notion of topological invariance of the algorithms.