Abelian topological code 

Description

Code whose codewords realize topological order associated with an Abelian anyon theory, equivalently, a unitary braided fusion category which is also an Abelian group under fusion [1].

A theory is defined by an Abelian group \(A\) of anyon types whose multiplication relations define the fusion rules, and a set of exchange statistics \(\theta(a)\in U(1)\) obtained by exchanging two anyons of type \(a\in A\). The exchange statistics in turn define braiding relations, \begin{align} B(a,b) = \frac{\theta(ab)}{\theta(a)\theta(b)}~, \tag*{(1)}\end{align} between all anyon pairs \(a,b\).

All 2D abelian topological orders can be understood within the subsystem stabilizer formalism [2]. As such, many of the operations one can perform on such codes have both a stabilizer and a topological-phase interpretation. Stabilizer generators of 2D topological codes acting on 1D loops of qubits can be interpreted as one-form symmetries of the underlying phase realized by the code. Identification of an anyon \(a\) with the vacuum is equivalent to adding string excitation operators corresponding to \(a\) to the stabilizer group and taking the center to get another stabilizer group. Code states of this new stabilizer code correspond to a condensed phase of the parent topological phase. The remaining unidentified parent-phase anyons behave differently with respect to the new condensed-phase state. Some become confined while the remaining ones pick up new braiding relations.

Protection

Topological order cannot be stabilized via weight-two or weight-three stabilizer generators on nearly Euclidean geometries of qubits or qutrits [3,4].

Encoding

Any local quantum circuit connecting ground states of topological orders with non-isomorphic Abelian groups must have depth that is at least linear in the diameter of the system [5].

Gates

Clifford gates can be implemented by braiding defects; for qubit-based stabilizer codes realizing Abelian topological phases, see Refs. [6,7]. Most of such designs focus on the surface code [8–13].

Fault Tolerance

Fault-tolerant logical operations can be interpreted as anyon condensation events [14].Modular decoding applicable to all fault-tolerant protocols based on topological qubit stabilizer codes [15].

Code Capacity Threshold

Noise thresholds can be formulated as anyon condensation transitions in a topological field theory [16], generalizing the mapping of the effect of noise on a code state to a statistical mechanical model [17–20].

Parents

  • Subsystem modular-qudit stabilizer code — All Abelian topological orders can be realized as modular-qudit subsystem stabilizer codes by starting with an abelian quantum double model (slightly different from that of Ref. [21]) along with a family of Abelian TQDs that generalize the double semion anyon theory and gauging out certain bosonic anyons [2]. The stabilizer generators of the new subsystem code may no longer be geometrically local.
  • Topological code — All Abelian topological orders can be realized as modular-qudit subsystem stabilizer codes [2]. Nonabelian topological orders are purported not to be realizable with Pauli stabilizer codes [22].

Children

  • Tetron Majorana code — When treated as ground states of the code Hamiltonian, surface codewords realize, codewords of a single Kitaev chain realize \(\mathbb{Z}_2\) fermionic topological order. The MZMs used to define the tetron code act as Ising anyons, which are nonabelian.
  • Three-fermion (3F) model code — When treated as ground states of the code Hamiltonian, 3F model code states realize 3F topological order, which is chiral and modular.
  • Three-fermion (3F) subsystem code — The 3F code is a subsystme code characterized by 3F topological order [2], which is chiral and modular.
  • \(\mathbb{Z}_q^{(1)}\) subsystem code — The \(\mathbb{Z}_q^{(1)}\) subsystem code is characterized by the \(\mathbb{Z}_q^{(1)}\) anyon theory [23]. The anyon theory has a single generator \(a \in \mathbb Z_N\) with \(\theta(a) =e^{\frac{2\pi i}{N}a^2}\). It is modular for odd prime \(q\) and non-modular otherwise.
  • Chiral semion subsystem code — The semion code is a subsystem code characterized by the chiral semion topological phase.
  • \(\mathbb{Z}_3\times\mathbb{Z}_9\)-fusion subsystem code — The \(\mathbb{Z}_q^{(1)}\) subsystem code is characterized by a non-modular anyon theory with \(\mathbb{Z}_3\times\mathbb{Z}_9\) fusion rules.
  • Abelian TQD stabilizer code — Abelian TQDs realize all modular gapped Abelian topological orders [21]. Conversely, every abelian anyon theory is a subtheory of some TQD [2; Sec. 6.2]. Any abelian anyon theory \(A\) can be realized at one of the surfaces of a 3D Walker-Wang model whose underlying theory is an abelian TQD containing \(A\) as a subtheory [24,25][2; Appx. H].

Cousins

  • Hamiltonian-based code — Subsystem stabilizer code Hamiltonians described by an Abelian anyon theory do not always realize the corresponding anyonic topological order in their ground-state subspace and may exhibit a rich phase diagram. For example, the Kitaev honeycomb Hamiltonian admits the anyon theories of the 16-fold way, i.e., all minimal modular extensions of the \(\mathbb{Z}_2^{(1)}\) abelian non-chiral non-modular anyon theory [26][2; Footnote 25].
  • Walker-Wang model code — Any abelian anyon theory \(A\) can be realized at one of the surfaces of a 3D Walker-Wang model whose underlying theory is an abelian TQD containing \(A\) as a subtheory [24,25][2; Appx. H].
  • Analog surface code — The analog surface code realizes a straightforward extension of the modular-qudit surface code to infinite local dimension, \(q\to\infty\). There are two types of anyons, \(e\) and \(m\), with each type being valued in \(U(1)\) as opposed to \(\mathbb{Z}_q\) for the qudit surface code.
  • Dynamical automorphism (DA) code — Useful measurement sequences of DA Floquet codes can be extracted from topological quantum field theory [27].

References

[1]
L. Wang and Z. Wang, “In and around abelian anyon models \({}^{\text{*}}\)”, Journal of Physics A: Mathematical and Theoretical 53, 505203 (2020) arXiv:2004.12048 DOI
[2]
T. D. Ellison et al., “Pauli topological subsystem codes from Abelian anyon theories”, (2022) arXiv:2211.03798
[3]
S. Bravyi and M. Vyalyi, “Commutative version of the k-local Hamiltonian problem and common eigenspace problem”, (2004) arXiv:quant-ph/0308021
[4]
D. Aharonov and L. Eldar, “On the complexity of Commuting Local Hamiltonians, and tight conditions for Topological Order in such systems”, (2011) arXiv:1102.0770
[5]
J. Haah, “An Invariant of Topologically Ordered States Under Local Unitary Transformations”, Communications in Mathematical Physics 342, 771 (2016) arXiv:1407.2926 DOI
[6]
M. Barkeshli, C.-M. Jian, and X.-L. Qi, “Theory of defects in Abelian topological states”, Physical Review B 88, (2013) arXiv:1305.7203 DOI
[7]
Y. D. Lensky et al., “Graph gauge theory of mobile non-Abelian anyons in a qubit stabilizer code”, Annals of Physics 452, 169286 (2023) arXiv:2210.09282 DOI
[8]
H. Bombin, “Topological Order with a Twist: Ising Anyons from an Abelian Model”, Physical Review Letters 105, (2010) arXiv:1004.1838 DOI
[9]
A. Kitaev and L. Kong, “Models for Gapped Boundaries and Domain Walls”, Communications in Mathematical Physics 313, 351 (2012) arXiv:1104.5047 DOI
[10]
A. G. Fowler et al., “Surface codes: Towards practical large-scale quantum computation”, Physical Review A 86, (2012) arXiv:1208.0928 DOI
[11]
H. Zheng, A. Dua, and L. Jiang, “Demonstrating non-Abelian statistics of Majorana fermions using twist defects”, Physical Review B 92, (2015) arXiv:1508.04166 DOI
[12]
B. J. Brown et al., “Poking Holes and Cutting Corners to Achieve Clifford Gates with the Surface Code”, Physical Review X 7, (2017) arXiv:1609.04673 DOI
[13]
A. Benhemou, J. K. Pachos, and D. E. Browne, “Non-Abelian statistics with mixed-boundary punctures on the toric code”, Physical Review A 105, (2022) arXiv:2103.08381 DOI
[14]
M. S. Kesselring et al., “Anyon condensation and the color code”, (2022) arXiv:2212.00042
[15]
H. Bombín et al., “Modular decoding: parallelizable real-time decoding for quantum computers”, (2023) arXiv:2303.04846
[16]
Y. Bao et al., “Mixed-state topological order and the errorfield double formulation of decoherence-induced transitions”, (2023) arXiv:2301.05687
[17]
E. Dennis et al., “Topological quantum memory”, Journal of Mathematical Physics 43, 4452 (2002) arXiv:quant-ph/0110143 DOI
[18]
A. A. Kovalev and L. P. Pryadko, “Fault tolerance of quantum low-density parity check codes with sublinear distance scaling”, Physical Review A 87, (2013) arXiv:1208.2317 DOI
[19]
A. A. Kovalev and L. P. Pryadko, “Spin glass reflection of the decoding transition for quantum error correcting codes”, (2014) arXiv:1311.7688
[20]
C. T. Chubb and S. T. Flammia, “Statistical mechanical models for quantum codes with correlated noise”, Annales de l’Institut Henri Poincaré D 8, 269 (2021) arXiv:1809.10704 DOI
[21]
T. D. Ellison et al., “Pauli Stabilizer Models of Twisted Quantum Doubles”, PRX Quantum 3, (2022) arXiv:2112.11394 DOI
[22]
A. C. Potter and R. Vasseur, “Symmetry constraints on many-body localization”, Physical Review B 94, (2016) arXiv:1605.03601 DOI
[23]
P. H. Bonderson, Non-Abelian Anyons and Interferometry, California Institute of Technology, 2007 DOI
[24]
J. Haah, “Clifford quantum cellular automata: Trivial group in 2D and Witt group in 3D”, Journal of Mathematical Physics 62, 092202 (2021) arXiv:1907.02075 DOI
[25]
W. Shirley et al., “Three-Dimensional Quantum Cellular Automata from Chiral Semion Surface Topological Order and beyond”, PRX Quantum 3, (2022) arXiv:2202.05442 DOI
[26]
A. Kitaev, “Anyons in an exactly solved model and beyond”, Annals of Physics 321, 2 (2006) arXiv:cond-mat/0506438 DOI
[27]
M. Davydova et al., “Quantum computation from dynamic automorphism codes”, (2023) arXiv:2307.10353
Page edit log

Your contribution is welcome!

on github.com (edit & pull request)

edit on this site

Zoo Code ID: topological_abelian

Cite as:
“Abelian topological code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/topological_abelian
BibTeX:
@incollection{eczoo_topological_abelian,
  title={Abelian topological code},
  booktitle={The Error Correction Zoo},
  year={2022},
  editor={Albert, Victor V. and Faist, Philippe},
  url={https://errorcorrectionzoo.org/c/topological_abelian}
}
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/topological_abelian

Cite as:

“Abelian topological code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/topological_abelian

Github: https://github.com/errorcorrectionzoo/eczoo_data/tree/main/codes/quantum/qudits/subsystem/topological/topological_abelian.yml.