Pith. sign in

REVIEW 3 major objections 5 minor 31 references

A Hierarchy of Anyon Models Realised by Twists in Stacked Surface Codes

T0 review · 3 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A self-inverse twist in a stack of $k$ surface codes whose localisable charges are all invariant under its symmetry realises a Tambara-Yamagami anyon model with base $(\mathbb{Z}_2)^k$, and braiding such twists implements tensor products…

desk verdict Strong F/R derivation of a Tambara-Yamagami hierarchy, but the Section 7 claim that H and CNOT generate all twists is asserted rather than proved. read the letter →

arxiv 1908.07353 v3 pith:HPMD2SEB submitted 2019-08-20 quant-ph

T. R. Scruby , D. E. Browne This is my paper · ORCID
classification quant-ph PACS 03.67.Pp
keywords twistdefectssurfacecodesTambara-YamagamicategoriesIsinganyonsCliffordgatesanyonbraidingdomainwallsfault-tolerantquantumcomputation
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper tries to establish that the well-known trick of braiding a twist in the surface code to obtain an S gate is the lowest rung of a whole ladder. The claim is that a twist in a stack of $k$ surface codes can be treated as a genuine anyon exactly when it is self-inverse and every charge it can localise is invariant under the twist's symmetry, and that in this case the twist plus its localisable charges form a Tambara-Yamagami anyon model with base group $(\mathbb{Z}_2)^k$---a hierarchy whose first level is the Ising anyons. If true, this means braiding those twists implements only Clifford operations, concretely tensor products of S gates or CZ gates, depending on the level and on the exchange statistics of the localisable charges. It would also mean that no braiding of twists in stacked surface codes, even of twists that cannot be viewed as anyons, can produce a non-Clifford logical gate. The reason to care is practical: fault-tolerant Clifford gates are the building blocks of surface-code quantum computing, and this paper explains exactly which Clifford gates twist braiding can supply.

What carries the argument

The load-bearing object is the Tambara-Yamagami (TY) category with base group $(\mathbb{Z}_2)^k$: a fusion category consisting of the $2^k$ Abelian charges of the code stack plus one extra non-Abelian charge $\beta$, with fusion $\beta\times\beta$ equal to the sum of all Abelian charges and every Abelian charge self-inverse. The argument runs through two identities. First, the pentagon equation forces the $F$ matrix for fusing three $\beta$s to be $\pm 2^{-k/2}$ times a symmetric Hadamard matrix $\varphi$; requiring $\varphi$ to be a bicharacter on $(\mathbb{Z}_2)^k$ restricts it to the Sylvester matrix $H_1^{\otimes k}$ up to symmetry-preserving permutations. Second, the hexagon equation fixes the $R$ matrix from $\varphi$ and the trace constraint $\pm (R^{\alpha_0}_{\beta\beta})^2 (a+ib)\,2^{-k/2}=1$, which forces the diagonal entries of $R$ to be $\pm1$, $\pm i$, or eighth roots of unity in counts determined by the trace of $\varphi$. On the code side, symmetries of the stacked-code anyon model are generated by Nielsen transformations restricted to braiding-preserving ones---$e\leftrightarrow m$ swaps within a layer, charge swaps between layers, and CNOT-like maps---which correspond to $H$ and CNOT gates in the code stack, and this is what carries the claim that every twist has Clifford braiding.

What would settle it

Exhaustively compute the braiding-preserving automorphism group of the anyon model of three stacked surface codes (charges generated by $e_1,m_1,e_2,m_2,e_3,m_3$ with within-layer braiding phase $-1$ and trivial between-layer braiding) and check whether every automorphism lies in the semigroup generated by equations (26)-(28); a single additional symmetry whose twist has invariant localisable charges but non-Clifford braiding would refute the classification. Alternatively, measure the self-exchange phase of a colour-code twist's localisable charges in the $k=2$ case: a twist assigned to the four-boson class showing a $-1$ fermionic self-exchange phase would contradict the $F$/$R$ derivation.

Watch

Extended reading notes

Core claim

The central discovery is a precise generalisation of the single-layer observation that a twist in the toric or surface code behaves like an Ising anyon. For a stack of $k$ surface codes, a twist is anyon-like if and only if (i) the twist is its own antiparticle and (ii) every anyonic charge that can be localised by the twist is invariant under the symmetry the twist implements. Under exactly these two conditions the twist and its localisable charges close under fusion and braiding, and the resulting fusion rules are those of a Tambara-Yamagami category with Abelian group $(\mathbb{Z}_2)^k$: the $k$th level of an extended Ising hierarchy in which the single non-Abelian charge $\beta$ has quantum dimension $\sqrt{2^k}$ and fuses as $\beta \times \beta = \sum_{\alpha} \alpha$ over all $2^k$ Abelian charges. The paper derives the $F$ and $R$ matrices for every level: up to gauge, $F_{\beta} = \pm 2^{-k/2} \varphi$ with $\varphi$ a symmetric Hadamard matrix whose entries form a bicharacter on $(\mathbb{Z}_2)^k$, and braiding two $\beta$ anyons gives a diagonal matrix whose entries are $\pm1$ or $\pm i$ (with eighth roots allowed for odd $k$). These matrices are Clifford operations: after choosing an encoding, they act as tensor products of $H$ gates, $S$ gates, or $CZ$ gates, with the trace-zero $F$ matrices giving $H^{\otimes k}$ and the exceptional trace-$2^k$ case giving $\mathrm{SWAP}\cdot(H\otimes H)$ for $k=2$. Finally, using Nielsen transformations, the paper argues that every braiding-preserving symmetry of stacked surface codes is generated by H-like swaps within a copy and CNOT-like maps between copies, so all twists in such stacks---not only the anyon-like ones---have Clifford braiding relations.

Load-bearing premise

The load-bearing premise is the unproved claim that every braiding-preserving symmetry of stacked surface codes is generated by the three moves in equations (26)-(28)---swapping the two charge types within a layer, swapping charges between layers, and the CNOT-like maps---so if any other symmetry exists, the list of twists and the Clifford conclusion are incomplete.

Editorial extensions

If this is right

  • For any $k$, a stack of $k$ surface codes contains a twist whose braiding implements a tensor product of $k$ S gates or $k/2$ CZ gates, and whose $F$ move implements $H^{\otimes k}$ (or the trace-$2^k$ variant), so twist braiding supplies a Clifford gate set that grows with stack height.
  • In the 2d colour code, the twist classes that are self-inverse with invariant localisable charges realise the first two levels of the hierarchy: the Ising-like S model, the $S\otimes S$ model, and the four-boson model whose braiding is CZ.
  • Because every braiding-preserving symmetry of stacked surface codes is generated by H-type and CNOT-type maps, all twists in such stacks---not only the anyon-like ones---have Clifford braiding relations, so braiding twists can never implement a non-Clifford logical gate.
  • Composing one $e\leftrightarrow m$ twist on each of $k$ layers produces a $\beta_k$ anyon with quantum dimension $\sqrt{2^k}$, realising the entire hierarchy up to level $k$ in a $k$-layer stack.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the symmetry-generation claim is supplied with a full proof, the paper's construction becomes a complete classification of anyon-realising twists in stacked surface codes; a direct check would be a computer enumeration of the braiding-preserving automorphism group for $k=3$.
  • The same $F$ and $R$ construction should extend to qudit surface codes with $\mathbb{Z}_d$ charges, where self-inverse twists would realise Tambara-Yamagami models with base $(\mathbb{Z}_d)^k$; for odd $d$ the S and CZ gates are non-Clifford, so twist braiding there might supply non-Clifford gates---the paper names this direction but leaves it open.
  • A measurable signature of which level of the hierarchy a twist sits in is the self-exchange phase of its localisable charges: all-bosonic models (trace $2^k$, even $k$) should show only $+1$ phases and CZ-type braiding, while models with fermionic charges show $-1$ phases and S-type braiding; measuring these phases for colour-code twists would test the assignment.
  • Because all twist braiding in surface-code stacks is Clifford, any scheme for universal fault-tolerant quantum computing built on such codes must import non-Clifford resources from elsewhere, such as magic-state distillation or measurement-based injection; the paper's result defines exactly how much Clifford power twist braiding can contribute.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper studies twist defects in stacks of k 2D surface codes and asks when a twist together with its localisable charges can be treated as an anyonic model. The authors define a hierarchy of extended Ising models, which are Tambara-Yamagami categories with base group (Z2)^k, derive the F and R matrices of these models from the pentagon and hexagon equations, and show that the resulting matrices correspond to Clifford gates, namely tensor products of H, S, and CZ gates. They then argue that such models are realised by self-inverse twists in stacks of k surface codes whose localisable charges are invariant under the associated symmetry, and they claim that H gates within a copy and CNOT gates between copies generate all possible twist symmetries, so all twist braidings in this setting are Clifford.

Significance. If the main claims hold, this is a significant and useful result: it gives a systematic hierarchy of non-Abelian anyon models obtainable from Abelian stabiliser codes, generalises Bombin's Ising-anyon construction to arbitrary numbers of surface-code layers, and connects twist braiding to Clifford gates. The derivations in Appendices A and C are detailed and internally consistent, and the explicit construction of level-k models via per-layer e/m swaps is a genuine existence result. The paper also correctly identifies the F and R matrices as realising Clifford operations and clarifies the role of the encoding choice. The principal weakness is that the universality claim, and the associated statement that all twists in stacked surface codes have Clifford braiding, rests on an unproved classification of braiding-preserving symmetries in Section 7.

major comments (3)
  1. [Section 7, first paragraph] The anyon charge group of k stacked surface codes is (Z2)^{2k}, not a finitely generated free group. The statement that the charges are 'elements of a finitely-generated free group' is incorrect, and the subsequent Nielsen-transformation argument for the automorphism group of a free group is therefore not applicable. This step is load-bearing because the conclusion that the transformations (26)-(28) generate all symmetries, and hence that H gates within a copy and CNOT gates between copies generate all possible twists, rests on it.
  2. [Section 7, equations (26)-(28)] The constraints 'if xi→xj then x'i→x'j' and 'we cannot map ei→eimi within a layer' are asserted without derivation. A complete proof should show that any braiding-preserving automorphism of the (Z2)^{2k} charge group with the topological-spin quadratic form q=Σ x_i y_i is an orthogonal transformation, and that the transformations (26)-(28) generate the full orthogonal group O^+(2k,2). As written, the classification of all symmetries is an assumption rather than a theorem. This gap directly affects the abstract's claim that H within a copy and CNOT between copies are sufficient to generate all possible twists, and the summary's claim that all twists in stacked surface codes have Clifford braiding.
  3. [Section 2.3 and Section 7] The abstract states necessary and sufficient conditions for a twist to be treated as an anyon. The paper shows the necessity of self-inverseness in Section 7, but the sufficiency direction is only sketched: it should be stated as a lemma that for a self-inverse twist whose localisable charges are all invariant under the symmetry, the fusion of two twists gives the sum of the localisable charges and the TY bicharacter is non-degenerate, so that the F and R matrices from Sections 4 and 5 apply. Currently the argument relies on informal closure and on equation (10) without a precise proof.
minor comments (5)
  1. [Throughout] There are several typos and infelicities: 'permissable' should be 'permissible', 'asymptoticlly' should be 'asymptotically', and 'rigourous' should be 'rigorous'. The paper should be carefully proofread.
  2. [Section 7, first paragraph] The phrase 'finitely-generated free group' should be replaced by the correct description of the charge group as a free module over Z2, i.e., (Z2)^{2k}.
  3. [Table 2] The column headers 'Number of ±1' and 'Number of ±i' are ambiguous. It should be stated explicitly whether these are the numbers of +1 and -1 entries separately, their totals, or the signed differences, since the derivation in Appendix C uses these counts.
  4. [Section 6] The notation 'trace-√2kF matrices' should be clarified as the trace of F being √(2^k) for even k; the current notation is confusing because the trace of the Hadamard matrix φ is 2^k, not √(2^k).
  5. [Section 3] When defining the hierarchy, the paper states that only specific values of n yield valid extended Ising models but does not give a direct reference for the classification of Tambara-Yamagami categories with base (Z2)^k. A precise citation to Tambara-Yamagami or a short argument would help.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the F- and R-matrix results are derived from consistency equations, and the Section 7 symmetry classification is an unproved premise rather than a circular input.

full rationale

The paper does not fit parameters to data and does not rely on load-bearing self-citations. The central technical content is the derivation of the F matrix for the extended Ising (Tambara-Yamagami) hierarchy from the pentagon equation (Appendix A) and the R matrix from the hexagon equation (Appendix C), with the resulting matrices then identified, after the derivation, as tensor products of Hadamard, S, and CZ gates. The conditions under which a twist can be treated as an anyon are stated and then shown to imply the fusion rules of the hierarchy; this is an implication, not a definitional collapse, because the hierarchy is defined independently by fusion rules. The abstract's broader claim that H gates within a copy and CNOT gates between copies generate all possible twists rests on the Section 7 classification of braiding-preserving symmetries as generated by equations (26)-(28). That classification is asserted with only a sketch (Nielsen transformations plus stated constraints), so the universality claim is not fully proved; however, this is a proof gap or correctness risk, not circularity, since the classification is not derived from the Clifford-braiding conclusion and no external benchmark is being relabelled. All external citations (Bombin, Kesselring et al., Webster and Bartlett) are used as background or as independent prior classifications, not as self-referential justification. Therefore no circular step can be exhibited, and the honest finding is score 0.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

The central results rest on standard anyon consistency equations plus three substantive assumptions: the standard anyon data of stacked surface codes, the validity of treating self-inverse invariant twists as anyons, and the as-yet-unproved generation claim for all braiding-preserving symmetries. No free parameters are fitted and no new physical entities are postulated.

assumptions (4)
  • domain assumption The anyon model of a surface code is the quantum double of Z2 with charges 1, e, m, epsilon, and for k stacked codes the charges form (Z2)^{2k} with the standard Pauli braiding.
    Invoked throughout Section 7 to define the symmetries and localisable charges of twists in stacked surface codes; this is standard surface code anyon data.
  • domain assumption Twists are described by G-crossed braided tensor categories, but when a twist is self-inverse and all its localisable charges are invariant under the associated symmetry, the subset of twist plus localisable charges closes under fusion and can be analysed as an anyon model.
    This is the physical premise of the paper, argued in Section 2.3 and used to restrict to the extended Ising hierarchy.
  • ad hoc to paper All braiding-preserving symmetries of the anyon model of k stacked surface codes are generated by the transformations (26)-(28) from Section 7.
    The generation claim is stated with a sketch using Nielsen transformations; if false, the 'all twists are Clifford' and 'H and CNOT generate all twists' results fail. It is not an established theorem cited from the literature.
  • standard math Symmetric non-degenerate bicharacters on (Z2)^k, and hence the F matrices of the hierarchy, are exactly the Sylvester Hadamard matrices up to symmetry-preserving row and column permutations, with trace constraints as analysed in Appendix B.
    This classification draws on standard results on Hadamard matrices and bicharacters (Hedayat and Wallis; Rozanski; Craigen). The paper uses it to restrict possible F matrices.

how reviews work

0 comments
Cite this review

Pith. "Pith review of A Hierarchy of Anyon Models Realised by Twists in Stacked Surface Codes." pith.science (2026). https://pith.science/paper/HPMD2SEB

@misc{pith2026190807353,
  author       = {Pith},
  title        = {Pith review of: A Hierarchy of Anyon Models Realised by Twists in Stacked Surface Codes},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/HPMD2SEB}},
  note         = {Machine review of arXiv:1908.07353}
}
read the original abstract

Braiding defects in topological stabiliser codes can be used to fault-tolerantly implement logical operations. Twists are defects corresponding to the end-points of domain walls and are associated with symmetries of the anyon model of the code. We consider twists in multiple copies of the 2d surface code and identify necessary and sufficient conditions for considering these twists as anyons: namely that they must be self-inverse and that all charges which can be localised by the twist must be invariant under its associated symmetry. If both of these conditions are satisfied the twist and its set of localisable anyonic charges reproduce the behaviour of an anyonic model belonging to a hierarchy which generalises the Ising anyons. We show that the braiding of these twists results in either (tensor products of) the S gate or (tensor products of) the CZ gate. We also show that for any number of copies of the 2d surface code the application of H gates within a copy and CNOT gates between copies is sufficient to generate all possible twists.

Figures

Figures reproduced from arXiv: 1908.07353 by the authors.

Figure 1
Figure 1. Diagrammatic representation of the pentagon [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 4
Figure 4. Braiding an anyon in a loop around a twist to [PITH_FULL_IMAGE:figures/full_fig_p004_4.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

31 extracted references · 15 canonical work pages

  1. [1]

    Nielsen and Isaac L

    Michael A. Nielsen and Isaac L. Chuang. Quantum Computation and Quantum Infor- mation: 10th Anniversary Edition . Cam- bridge University Press, New York, NY, Accepted in Quantum 2020-03-02, click title to verify. Published under CC-BY 4.0. 15 USA, 10th edition, 2011. ISBN 978-1-107- 00217-3

    work page 2020

  2. [2]

    Clas- sification of topologically protected gates for local stabilizer codes

    Sergey Bravyi and Robert Koenig. Clas- sification of topologically protected gates for local stabilizer codes. Physical Review Letters, 110(17):170503, April 2013. ISSN 0031-9007, 1079-7114. DOI: 10.1103/Phys- RevLett.110.170503. arXiv: 1206.1609

    arXiv 2013

  3. [3]

    Bartlett

    Paul Webster and Stephen D. Bartlett. Locality-preserving logical operators in topological stabilizer codes.Physical Review A, 97(1):012330, January 2018. DOI: 10.1103/PhysRevA.97.012330

    doi:10.1103/physreva.97.012330 2018

  4. [4]

    Jonathan E. Moussa. Transversal Clifford gates on folded surface codes. Physical Re- view A, 94(4):042316, October 2016. DOI: 10.1103/PhysRevA.94.042316

    doi:10.1103/physreva.94.042316 2016

  5. [5]

    Brown, Katharina Laubscher, Markus S

    Benjamin J. Brown, Katharina Laubscher, Markus S. Kesselring, and James R. Woot- ton. Poking Holes and Cutting Corners to Achieve Clifford Gates with the Surface Code. Physical Review X, 7(2):021029, May

    work page

  6. [6]

    Kesselring, Fernando Pastawski, Jens Eisert, and Benjamin J

    Markus S. Kesselring, Fernando Pastawski, Jens Eisert, and Benjamin J. Brown. The boundaries and twist defects of the color code and their applications to topological quantum computation.Quantum, 2:101, Oc- tober 2018. DOI: 10.22331/q-2018-10-19- 101

    work page doi:10.22331/q-2018-10-19- 2018

  7. [7]

    H. Bombin. Topological Order with a Twist: Ising Anyons from an Abelian Model.Physi- cal Review Letters, 105(3):030403, July 2010. DOI: 10.1103/PhysRevLett.105.030403

    work page doi:10.1103/physrevlett.105.030403 2010

  8. [9]

    Stabilizer Codes and Quantum Error Correction

    Daniel Gottesman. Stabilizer Codes and Quantum Error Correction. arXiv:quant- ph/9705052, May 1997. URL http:// arxiv.org/abs/quant-ph/9705052. arXiv: quant-ph/9705052

    arXiv 1997

Show all 31 references
  1. [10]

    Bombin and M

    H. Bombin and M. A. Martin-Delgado. Topological Quantum Distillation. Physi- cal Review Letters , 97(18):180501, October

  2. [11]

    The ABCs of the Color Code: A Study of Topological Quantum Codes as Toy Models for Fault- Tolerant Quantum Computation and Quan- tum Phases Of Matter

    Aleksander Marek Kubica. The ABCs of the Color Code: A Study of Topological Quantum Codes as Toy Models for Fault- Tolerant Quantum Computation and Quan- tum Phases Of Matter. 2018. DOI: 10.7907/059V-MG69

    2018 doi

  3. [12]

    H. Bombin. An Introduction to Topological Quantum Codes. arXiv:1311.0277 [quant- ph], November 2013. URL http://arxiv. org/abs/1311.0277. arXiv: 1311.0277

    2013 arXiv

  4. [13]

    Fowler, Matteo Mariantoni, John M

    Austin G. Fowler, Matteo Mariantoni, John M. Martinis, and Andrew N. Cle- land. Surfacecodes: Towardspracticallarge- scale quantum computation. Physical Re- view A, 86(3):032324, September 2012. DOI: 10.1103/PhysRevA.86.032324

    2012 doi

  5. [14]

    F. A. Bais and J. K. Slingerland. Con- densate induced transitions between topo- logically ordered phases. Physical Re- view B, 79(4):045316, January 2009. ISSN 1098-0121, 1550-235X. DOI: 10.1103/Phys- RevB.79.045316. arXiv: 0808.0627

    2009 arXiv

  6. [15]

    Conformal Field Theory

    Philippe Francesco, Pierre Mathieu, and David Sénéchal. Conformal Field Theory . Graduate Texts in Contemporary Physics. Springer-Verlag, New York, 1997. ISBN 978-0-387-94785-3. URL https://www. springer.com/gp/book/9780387947853

    1997

  7. [16]

    Jiannis K. Pachos. Introduction to Topo- logical Quantum Computation by Jiannis K. Pachos, April 2012

    2012

  8. [17]

    Wootton, and Daniel Loss

    Adrian Hutter, James R. Wootton, and Daniel Loss. Parafermions in a Kagome Lattice of Qubits for Topological Quan- tum Computation. Physical Review X, 5(4):041040, December 2015. DOI: 10.1103/PhysRevX.5.041040

    2015 doi

  9. [18]

    Tensor Categories with Fusion Rules of Self- Duality for Finite Abelian Groups

    Daisuke Tambara and Shigeru Yamagami. Tensor Categories with Fusion Rules of Self- Duality for Finite Abelian Groups. Jour- nal of Algebra , 209(2):692–707, Novem- ber 1998. ISSN 0021-8693. DOI: 10.1006/jabr.1998.7558

    1998

  10. [19]

    J. J. Sylvester. LX. Thoughts on inverse orthogonal matrices, simultaneous signsuc- cessions, and tessellated pavements in two or more colours, with applications to New- ton’s rule, ornamental tile-work, and the theory of numbers. The London, Edin- Accepted in Quantum 2020-03-...

    2020 doi

  11. [20]

    Hedayat and W

    A. Hedayat and W. D. Wallis. Hadamard Matrices and Their Applications. The An- nals of Statistics , 6(6):1184–1238, Novem- ber 1978. ISSN 0090-5364, 2168-8966. DOI: 10.1214/aos/1176344370

    1978

  12. [21]

    Galois theory: lectures delivered at the University of Notre Dame / by Dr

    Emil Artin. Galois theory: lectures delivered at the University of Notre Dame / by Dr. Emil Artin ; edited and supplemented with a section on applications by Dr. Arthur N. Mil- gram. Notre Dame mathematical lectures ; no. 2. University of Notre Dame, University of Notre Dame P...

    1959

  13. [22]

    Bicharacters, braids and Ja- cobi identity

    Jerzy Rozanski. Bicharacters, braids and Ja- cobi identity. arXiv:q-alg/9611029, Novem- ber 1996. URL http://arxiv.org/abs/ q-alg/9611029. arXiv: q-alg/9611029

    1996 arXiv

  14. [23]

    R. Craigen. Trace, Symmetry and Orthogo- nality. Canadian Mathematical Bulletin , 37 (4):461–467, December 1994. ISSN 0008- 4395, 1496-4287. DOI: 10.4153/CMB-1994- 067-1

    1994 doi

  15. [25]

    Unfolding the color code

    Aleksander Kubica, Beni Yoshida, and Fer- nando Pastawski. Unfolding the color code. New Journal of Physics , 17(8):083026, August 2015. ISSN 1367-2630. DOI: 10.1088/1367-2630/17/8/083026. arXiv: 1503.02065

    2015 arXiv

  16. [26]

    Combinatorial Group The- ory: Presentations of Groups in Terms of Generators and Relations

    Wilhelm Magnus, Abraham Karrass, and Donald Solitar. Combinatorial Group The- ory: Presentations of Groups in Terms of Generators and Relations. Courier Corpora- tion, January2004. ISBN978-0-486-43830-6. Google-Books-ID: 1LW4s1RDRHQC

  17. [28]

    Bartlett

    Paul Webster and Stephen D. Bartlett. Fault-Tolerant Quantum Gates with De- fects in Topological Stabiliser Codes. arXiv:1906.01045 [quant-ph] , June 2019. URL http://arxiv.org/abs/1906.01045. arXiv: 1906.01045

    1906 arXiv

  18. [29]

    Anyons in an exactly solved model and beyond

    Alexei Kitaev. Anyons in an exactly solved model and beyond. Annals of Physics , 321 (1):2–111, January 2006. ISSN 0003-4916. DOI: 10.1016/j.aop.2005.10.005. Accepted in Quantum 2020-03-02, click title to verify. Published under CC-BY 4.0. 17

    2006 doi

  19. [2000]

    arXiv: math/0011037

    URL http://arxiv.org/abs/math/ 0011037. arXiv: math/0011037

    arXiv

  20. [2006]

    DOI: 10.1103/PhysRevLett.97.180501

    ISSN 0031-9007, 1079-7114. DOI: 10.1103/PhysRevLett.97.180501. arXiv: quant-ph/0605138

    arXiv

  21. [2014]

    arXiv: 1410.4540

    DOI: 10.1103/PhysRevB.100.115147. arXiv: 1410.4540

    arXiv

  22. [2017]

    DOI: 10.1103/PhysRevX.7.021029

    doi

  23. [2018]

    URL http://arxiv.org/abs/1811. 11789. arXiv: 1811.11789

    arXiv

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.