Exact correctability of fusion-space codes is equivalent to fibrewise Knill–Laflamme conditions on syndrome-admissible footprint algebras, with a conditional Peierls threshold for growing families and explicit Ising examples of diagnostic versus syndrome measurements.
TQFTs and quantum computing
1 Pith paper cite this work, alongside 2 external citations. Polarity classification is still indexing.
abstract
Quantum computing is captured in the formalism of the monoidal subcategory of $\textbf{Vect}_{\mathbb C}$ generated by $\mathbb C^2$ -- in particular, quantum circuits are diagrams in $\textbf{Vect}_{\mathbb C}$ -- while topological quantum field theories, in the sense of Atiyah, are diagrams in $\textbf{Vect}_{\mathbb C}$ indexed by cobordisms. We initiate a program that formalizes this connection. In doing so, we equip cobordisms with machinery for producing linear maps by parallel transport along curves under a connection and then assemble these structures into a double category. Finite-dimensional complex vector spaces and linear maps between them are given a suitable double categorical structure which we call $\mathbb F\textbf{Vect}_{\mathbb C}$. We realize quantum circuits as images of cobordisms under monoidal double functors from these modified cobordisms to $\mathbb F\textbf{Vect}_{\mathbb C}$, which are computed by taking parallel transports of vectors and then combining the results in a pattern encoded in the domain double category.
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A diagrammatic field theory of quantum error correction
Exact correctability of fusion-space codes is equivalent to fibrewise Knill–Laflamme conditions on syndrome-admissible footprint algebras, with a conditional Peierls threshold for growing families and explicit Ising examples of diagnostic versus syndrome measurements.