Pith. sign in

REVIEW 3 major objections 4 minor 55 references

Topological quantum compilation of metaplectic anyons based on the genetic optimized algorithms

T0 review · 3 major / 4 minor · reviewed 2026-08-10 · deepseek-v4-flash

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

Pith's one-line read SO(3)_2 metaplectic anyons compile the universal gate set H, T, CNOT with braiding plus fusion, reaching a CNOT distance below 10^-128.

desk verdict Z-anyon insertion gives new EBMs and strong gate numbers for SO(3)_2, but Section IV's admission that the EBMs violate Artin relations undercuts the topological protection claim. read the letter →

arxiv 2501.01745 v5 pith:55EX5B3S submitted 2025-01-03 quant-ph

Jiangwei Long , Jianxin Zhong , Lijun Meng This is my paper · ORCID
classification quant-ph MSC 81P6881T45
keywords quantumcompilationtopologicalcomputationmetaplecticanyonsSO(3)_2anyonmodelelementarybraidingmatricesgeneticalgorithmrecursivegateapproximationCNOT
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

The paper tries to establish that metaplectic anyons of type $SO(3)_2$ can compile the standard universal gate set $\{H,T,\mathrm{CNOT}\}$ using only braiding plus fusion, with no measurement step. The enabling device is an unconventional encoding: after a braid swaps an $X$ anyon with an $X'$ anyon, a pair of $Z$ anyons is fused in to restore the original anyon ordering, so the operation can be iterated as a gate. From the $F$-matrices, $R$-symbols, and fusion rules, the paper derives elementary braiding matrices for three three-anyon models, $V^{113}_3$, $V^{131}_3$, and $V^{133}_1$, and compiles $H$ and $T$ gates with a genetic-algorithm-enhanced recursive routine; $V^{131}_3$ gives the best accuracy of the models compared, while the other two become comparable to the Fibonacci anyon model at higher recursion levels. For two qubits, the paper reports that $V^{113}_3$ approximates the local equivalence class of CNOT to below $10^{-128}$ at length 30, and with inverse generators all three models reach a distance indistinguishable from zero at length 20. It also states explicitly that these unconventional-encoding operations do not satisfy the Artin braid group relations, so they are not topologically protected in the strict sense.

What carries the argument

The central object is the elementary braiding matrix (EBM), a unitary matrix assigned to a single exchange of neighboring anyons in a chosen encoding. For the one-qubit encodings, three anyons form the qubit and the EBMs are $2\times2$; for two qubits, six anyons give a $5\times5$ space with four computational states and one non-computational state. The novel mechanism is the Z-pair insertion followed by fusion: braiding the distinct anyon types $X$ and $X'$ swaps their positions, and creating a pair of $Z$ anyons from the vacuum and fusing one $Z$ into each anyon restores the original order, $X\otimes Z=X'$ and $X'\otimes Z=X$, so the encoding is reusable. The $F$-matrices and $R$-symbols of the metaplectic theory supply the numerical content of these EBMs, and the paper derives them analytically rather than numerically. The compilation machinery combines a genetic-algorithm-enhanced recursive routine for one-qubit gates with exhaustive plus genetic search for two-qubit gates, using the global phase invariant distance for one-qubit gates and local invariants for the CNOT equivalence class.

What would settle it

Measure the residual of the braid-group relation $\|\sigma_1\sigma_2\sigma_1-\sigma_2\sigma_1\sigma_2\|$ for the paper's EBMs, which the paper states is nonzero, and in a concrete $SO(3)_2$ realization test whether a braidword that supposedly compiles CNOT actually produces the predicted unitary with the stated fidelity; if $Z$-pair creation and fusion introduces uncontrolled phase or leakage into the non-computational subspace, the reported distances would not be realized experimentally.

Watch

Extended reading notes

Core claim

On its own terms, the paper's central claim is that three $SO(3)_2$ metaplectic anyon models—$V^{113}_3$, $V^{131}_3$, and $V^{133}_1$—admit elementary braiding matrices, obtained analytically from $F$-matrix and $R$-symbol data, that compile the universal gate set $\{H,T,\mathrm{CNOT}\}$ to fault-tolerant accuracy. The compilation uses a genetic-algorithm-enhanced recursive search for one-qubit gates and a genetic or exhaustive search for two-qubit gates. The reported one-qubit results put $V^{131}_3$ ahead of the Fibonacci model on $H$ and $T$ gate accuracy, with the other two models reaching comparable or slightly inferior accuracy at higher recursion levels; the two-qubit results put $V^{113}_3$ at a CNOT local-equivalence distance below $10^{-128}$ at length 30 and, with inverse matrices included, all three models at distance zero (below $10^{-128}$) at length 20, with the non-computational block $M_{11}=1$ and unitarity error below $6\times10^{-15}$. The paper also claims that only fusion is required for the $Z$-pair insertion—no measurement—but acknowledges that the inserted $Z$ pair truncates the anyon worldlines, so the resulting matrices violate the Artin braid group relations and the corresponding braiding processes are not topologically protected.

Load-bearing premise

The load-bearing premise is that the unitary matrices obtained by braiding $X$ with $X'$ and then fusing in a $Z$ pair to restore the anyon order describe physically legitimate, repeatable gate operations whose error can be made arbitrarily small by longer sequences; the paper itself notes these operations violate the Artin braid group relations because the $Z$-pair insertion cuts the worldlines, so if topological protection requires those relations, the central claim of topological quantum compilation collapses.

Editorial extensions

If this is right

  • The $H$ and $T$ gates compiled from $V^{131}_3$ reach the roughly one-percent fault-tolerant threshold already at the first recursion level, reducing the braid length by a factor of five relative to the Fibonacci model at the same accuracy.
  • The two-qubit results mean an $SO(3)_2$ model can serve as a practical source of entangling gates: $V^{113}_3$ reaches a CNOT local-equivalence distance below $10^{-128}$ with only 30 elementary matrices, far better than the reported Fibonacci benchmark.
  • Because all three models reach a CNOT-class distance of zero (below $10^{-128}$) at length 20 when inverse EBMs are allowed, the generated matrices are functionally equivalent to CNOT up to single-qubit operations, with no leakage into the non-computational subspace ($M_{11}=1$).
  • The stated violation of the Artin braid relations means that if exact topological protection is required, the unconventional encoding does not qualify as a braiding-only scheme; the gates are operations of a fusion-assisted model, and their robustness must be assessed against the physical fidelity of $Z$-pair creation and fusion.

Reading between the lines

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

  • The $X\leftrightarrow X'$ exchange via $Z$-pair fusion is a generic trick: any pair of distinct anyon types whose fusion with an auxiliary charge interconverts them could support the same turnstile encoding, so the scheme may generalize beyond $SO(3)_2$ to other weakly integral anyon models.
  • The paper leaves open whether the compiled accuracy survives when the physical cost of creating and fusing $Z$ pairs is counted; a natural test is to rerun the same search with each $σ_2$-type EBM weighted by the fusion overhead and compare the effective error per logical gate.
  • The near-exact CNOT matches at length 20 suggest the generated EBMs may densely generate the two-qubit unitary group on the computational subspace; if so, the same genetic search could compile other two-qubit gates such as SWAP or controlled-phase with comparable accuracy.
  • The proposed $N$-qubit extension would require 14-dimensional three-qubit EBMs; a concrete next step is a numerical check of whether the direct-sum decomposition $B=M\oplus A$ holds with negligible off-diagonal blocks for the three-qubit generators, which the paper identifies as a critical open challenge.
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 / 4 minor

Summary. The paper studies quantum compilation in SO(3)_2 metaplectic anyon models. Using F-matrices and R-symbols, the authors derive elementary braiding matrices (EBMs) for three three-anyon encodings V113_3, V131_3, and V133_1, where the anyon order is restored after braiding by inserting a Z-anyon pair and fusing, without measurement. They then use a genetic-algorithm-enhanced Solovay-Kitaev algorithm to compile H and T gates from the one-qubit EBMs, and exhaustive search plus genetic algorithms to approximate the local equivalence class of CNOT from the two-qubit EBMs. They report that V113_3 achieves a CNOT local-equivalence distance below 10^-128 at length 30, with better accuracy than the Fibonacci model in several comparisons. The paper also compares conventional and unconventional encoding, and sketches a generalization to N qubits. Crucially, the authors acknowledge in Section IV that the EBMs for the three unconventional encodings violate the Artin braid-group relations because the Z-anyon insertion truncates worldlines.

Significance. If the compiled operations were genuine braiding gates, the paper would contribute a family of analytically derived anyonic gate sets with excellent numerical compilation results, including a concrete benchmark against Fibonacci anyons and explicit braidwords. The paper also has the merit of being explicit about the algebraic caveat: Section IV states that the unconventional EBMs do not satisfy the braid-group relations. The numerical compilation results are outputs of search procedures rather than fitted parameters, so they are not circular in that sense. However, because the central advertised contribution is 'topological quantum compilation with global anti-interference ability,' and because the paper itself concedes that the operations used for the universal gate constructions are not braid-group representations, the main claim as stated is not established. The paper is better viewed as a compilation study over a particular set of fusion-assisted unitary operations in an anyonic encoding, without topological protection.

major comments (3)
  1. [Section IV, Eq. (8)] The paper's central claim, repeated in the title and abstract, is topological quantum compilation with global anti-interference. Topological protection of gates in anyonic computation is normally predicated on the operations being representations of the Artin braid group. Section IV states explicitly that none of the EBMs for V113_3, V131_3, or V133_1 satisfy the Artin relations, because the insertion of a Z-anyon pair after braiding X with X' truncates the worldlines. This is a load-bearing issue: the unitary matrices used for the H/T/CNOT compilations are therefore not braids, and the argument that errors are suppressed by topology does not apply. The authors should either reframe the contribution as compilation with fusion-assisted, non-topological operations in an anyonic encoding, or provide a rigorous argument that the truncated operations nevertheless inherit the relevant error-suppression properties. Without one of these changes, the claim of topological quantum compilation is unsupported.
  2. [Appendix B, F^{332}_2] The F-matrix listed as F^{332}_2 = (1/sqrt(2)) [[1, -1], [-1, 1]] is singular (it has determinant zero) and therefore cannot be a valid unitary F-matrix. This matrix and its inverse are used in Appendix C to derive sigma^(6)_3 for V113_3 and V133_1, so the derivation as printed cannot be checked and may be incorrect. Please correct the matrix entry and re-verify the affected EBMs and the numerical results that depend on them.
  3. [Appendix C, V133_1 and V131_3 calculations] The displayed derivations contain several verification-blocking typos: for V133_1, both lines are labeled sigma^(3)_2 |0>, while the second should be sigma^(3)_2 |1>; the same labeling error appears for V111_1. For V131_3, the formulas use the undefined symbol F^{131}_{1;22}, F^{131}_{1;42}, etc., whereas Appendix B defines F^{131}_3 with entries 22, 24, 42, 44. Additionally, V111_1 uses R11_1 in sigma^(6)_3 |10>, but R11_1 is not defined in Appendix B. These typographical errors make the analytical derivation impossible to verify as printed and should be corrected.
minor comments (4)
  1. [Equation (7)] The notation dU = Tr(sqrt(a†a)) is ambiguous: the trace of a matrix is conventionally written tr or Tr, and writing 'T r' is nonstandard. Please use consistent notation, e.g., dU = tr(sqrt(A†A - I)^† (A†A - I)).
  2. [Abstract and Introduction] The abstract says 'V^{131}_3 giving the best performance of these four models'; since the comparison includes the Fibonacci model, it would be clearer to say 'of the four models considered' and to specify that the comparison is for the specific distances and lengths reported.
  3. [Appendix D] In the definition of crossover, the example braidwords CBABC and ADBDD are said to produce CBADD and ADBBC after a crossover at point 3; the second offspring appears to be ADBBC, which is consistent if the crossover exchanges the first three characters, but the text should explicitly state the convention to avoid confusion.
  4. [References] Reference [6] contains a typo in the journal name ('physica status soli(di)'), and reference [2] appears to be a proceedings volume rather than a primary source; please check the citation details against the original publications.

Circularity Check

0 steps flagged · score 2.0 of 10

No significant circularity; the only mild issue is one companion-paper citation used as a computational tool, while the admitted Artin-relation violation is a non-circular scope limitation.

full rationale

The derivation chain is not circular. The F-matrices and R-symbols are imported from independent prior work (Cui and Wang [29], Cui et al. [37]) and listed in Appendix B; the EBMs are obtained by explicit F/R algebra in Appendix C, not by imposing the target gates. The one- and two-qubit gate distances are outputs of exhaustive/GA searches over braidwords (Tables I-II; Figs. 2, 4, 5), so the reported accuracies are optimization results, not fitted parameters later relabeled as predictions. The only self-citation is ref. [44], the authors' companion paper on GA-enhanced SKA; it supplies the optimizer, is described in Appendix D, and is not used to prove a physical result, so it is not load-bearing in a circular sense. Section IV honestly states that none of the EBMs for V113_3, V131_3, and V133_1 satisfy the Artin braid relations because inserting Z pairs cuts worldlines. That is a serious limitation for the label "topological quantum compilation" and should be weighed as a correctness risk, but it is not circularity: the unitary matrices are still derived from the F/R data and the searches evaluate those matrices, so no result reduces to its own input. The model selection in Appendix A (choosing V113_3, V131_3, V133_1 after comparing all six models on the same CNOT metric) is selection, not fitting, and does not construct the EBMs from the target gates. Overall: no circular step; the score reflects only the single minor, non-load-bearing self-citation.

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

The paper relies on standard SO(3)_2 anyon data and on its own companion GA-enhanced SKA algorithm. No new physical entities are invented. The main unstated assumptions are the physical realizability of Z-pair creation and the validity of the heuristic search.

free parameters (3)
  • GA hyperparameters = not specified
    Population size, mutation probability, crossover probability, and number of generations are said to be the same across runs but never listed, and the reported distances are the best of three runs.
  • Basic length L0 = 30
    The one-qubit 0-level approximation in GA-enhanced SKA uses L0=30, chosen by the authors; the results depend on this choice.
  • Two-qubit search length cutoffs = 13 (without inverses), 7 (with inverses) for exhaustive; GA for longer
    The transition from exhaustive search to GA is an algorithmic choice that affects the reported distances.
assumptions (4)
  • domain assumption F-matrices and R-symbols for SO(3)_2 metaplectic anyons are taken from Cui and Wang (2015) and Cui et al. (2019).
    Used throughout Appendices B and C to derive all EBMs; if these data are wrong, the EBMs are wrong.
  • domain assumption Fusion rules for SO(3)_2, including X⊗X' = Y⊕Z and Z⊗Z=1.
    Stated in Eq. (2) and used to justify the Z-pair insertion restoring the anyon order.
  • ad hoc to paper A Z-Z pair can be created from vacuum and fused with X and X' via two trivial F-moves, without affecting the computational state.
    Figure 10 asserts this process is trivial; the paper gives no derivation of the phase or of how pair creation is performed physically.
  • domain assumption GA-enhanced SKA, as defined in the companion paper [44], produces valid approximations.
    The compilation results for H and T gates depend on this algorithm, which is not reproduced in this paper.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Topological quantum compilation of metaplectic anyons based on the genetic optimized algorithms." pith.science (2026). https://pith.science/paper/55EX5B3S

@misc{pith2026250101745,
  author       = {Pith},
  title        = {Pith review of: Topological quantum compilation of metaplectic anyons based on the genetic optimized algorithms},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/55EX5B3S}},
  note         = {Machine review of arXiv:2501.01745}
}
abstract

Topological quantum computing holding global anti-interference ability is realized by braiding some anyons, such as well-known Fibonacci anyons. Here, based on $SO(3)_2 $ theory we obtain a total of 6 anyon models utilizing \textit{F}-matrices, \textit{R}-symbols, and fusion rules of metaplectic anyon.We obtain the elementary braiding matrices (EBMs) by means of unconventional encoding. After braiding \textit{X} and $X^\prime$, we insert a pair of \textit{Z} anyons into them to ensure that the initial order of anyons remains unchanged. In this process only fusion is required, and measurement is not necessary. Three of them $\{V^{113}_3,V^{131}_3,V^{133}_1\}$ are studied in detail. We study systematically the compilation of these three models through EBMs obtained analytically. For one-qubit case, the classical \textit{H}- and \textit{T}-gate can be well constructed using the genetic algorithm enhanced Solovay-Kitaev algorithm (GA-enhanced SKA) by $\{V^{113}_3,V^{131}_3,V^{133}_1\}$. The obtained accuracy of the \textit{H}/\textit{T}-gate by $\{V^{113}_3,V^{133}_1\}$ is slightly inferior to the corresponding gates of the Fibonacci anyon model, but it also can meet the requirements of fault-tolerant quantum computing, $V^{131}_3$ giving the best performance of these four models. For the two-qubit case, we use the exhaustive method for short lengths and the GA for long lengths to obtain braidword for $\{V^{113}_3,V^{131}_3,V^{133}_1\}$ models. The resulting matrices can well approximate the local equivalence class of the CNOT-gate, while demonstrating a much smaller error than the Fibonacci model, especially for the $V^{113}_3$.The braiding processes of conventional encoding (using identical anyons) and unconventional encoding (using distinct anyons) are compared. Finally, we attempt to generalize the model to the \textit{N}-qubit case.

Figures

Figures reproduced from arXiv: 2501.01745 by the authors.

Figure 1
Figure 1. FIG. 1. (a) The model [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. FIG. 2. The [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. FIG. 3. The top/bottom figures correspond to the [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figures from the paper (9 more)
Figure 4
Figure 4. Figure 4: FIG. 4. The distance of local equivalence class [CNOT] and [PITH_FULL_IMAGE:figures/full_fig_p006_4.png]
Figure 6
Figure 6. Figure 6: FIG. 6. (a) The one-qubit model of [PITH_FULL_IMAGE:figures/full_fig_p007_6.png]
Figure 8
Figure 8. Figure 8: FIG. 8. (a) Three-qubit system of the [PITH_FULL_IMAGE:figures/full_fig_p008_8.png]
Figure 9
Figure 9. Figure 9: FIG. 9. The process of introducing a pair of [PITH_FULL_IMAGE:figures/full_fig_p010_9.png]
Figure 10
Figure 10. Figure 10: FIG. 10. Producing a pair of [PITH_FULL_IMAGE:figures/full_fig_p010_10.png]
Figure 11
Figure 11. Figure 11: FIG. 11. (a) Definition of [PITH_FULL_IMAGE:figures/full_fig_p011_11.png]
Figure 12
Figure 12. Figure 12: FIG. 12. Braiding Operations in the [PITH_FULL_IMAGE:figures/full_fig_p012_12.png]
Figure 13
Figure 13. Figure 13: FIG. 13. Braiding Operations in the [PITH_FULL_IMAGE:figures/full_fig_p013_13.png]
Figure 14
Figure 14. Figure 14: FIG. 14. Braiding Operations in the [PITH_FULL_IMAGE:figures/full_fig_p013_14.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

55 extracted references · 36 canonical work pages

  1. [1]

    For example, the braidword ABAD corresponds to the matrix resulting from the product σ1σ2σ1σ−1 2

    Individual: A matrix formed by multiplying a sequence of specified EBMs. For example, the braidword ABAD corresponds to the matrix resulting from the product σ1σ2σ1σ−1 2

    work page

  2. [2]

    Population: A collection of individuals, each represented by a distinct braidword

    work page

  3. [3]

    For instance, given braid words CBABC and ADBDD, a random integer (e.g., 3) is selected as the crossover point

    Crossover: An operation where two braidwords are randomly selected from the population and combined to generate two new braidwords. For instance, given braid words CBABC and ADBDD, a random integer (e.g., 3) is selected as the crossover point. The resulting offspring are CBADD and ADBBC. 15

    work page

  4. [4]

    If mutation occurs, a random position within the braidword is selected (e.g., position 2)

    Mutation: Following crossover, newly generated braidwords undergo mutation with a defined probability. If mutation occurs, a random position within the braidword is selected (e.g., position 2). The EBM at this position is replaced by another valid EBM (e.g., B in CBADD could be replaced by A/C/D)

    work page

  5. [5]

    Hybridization Generation: The total number (G) of offspring populations generated through successive hy- bridization operations, starting from the initial population (generation 0). Specifically, population 1 is generated by hybridizing population 0, population 2 is generated by hybridizing population 1, and so forth, until population G is generated by hy...

    work page

  6. [6]

    J. M. Leinaas and J. Myrheim, On the theory of identical particles, Il Nuovo Cimento B Series 11 37, 1 (2007)

    work page 2007

  7. [7]

    Jacobsen, S

    J. Jacobsen, S. Ouvry, V. Pasquier, D. Serban, and L. Cugliandolo, Exact Methods in low-dimensional sta- tistical physics and quantum computing: Lecture notes of the les houches summer school: Volume 89, July 2008 (OUP Oxford, 2010)

    2008

  8. [8]

    Das Sarma, M

    S. Das Sarma, M. Freedman, and C. Nayak, Topological quantum computation, Physics Today 59, 32 (2006)

    work page 2006

Show all 55 references
  1. [9]

    Nayak, S

    C. Nayak, S. H. Simon, A. Stern, M. Freedman, and S. Das Sarma, Non-abelian anyons and topological quan- tum computation, Reviews of Modern Physics 80, 1083 (2008)

    2008

  2. [10]

    J. K. Pachos, Introduction to topological quantum com- putation (Cambridge University Press, 2012)

    2012

  3. [11]

    Y. Bao, Y. Li, K. Xia, and L. Meng, Magnetic-field reg- ulation of nodal topological superconducting states in monolayer ising superconductor nbse2, physica status so- lidi (RRL)–Rapid Research Letters 17, 2300135 (2023)

    2023

  4. [12]

    Y. Li, Q. Gao, Y. Li, J. Zhong, and L. Meng, Long- range pairing in monolayer nbse2 facilitates the emer- gence of topological superconducting states, New Journal of Physics 26, 053042 (2024)

    2024

  5. [13]

    Nayak and F

    C. Nayak and F. Wilczek, 2n-quasihole states realize 2n- 1-dimensional spinor braiding statistics in paired quan- tum hall states, Nuclear Physics B 479, 529 (1996)

    1996

  6. [14]

    L. S. Georgiev, Ultimate braid-group generators for coordinate exchanges of ising anyons from the multi- anyon pfaffian wavefunctions, Journal of Physics A: Mathematical and Theoretical 42, 10.1088/1751- 8113/42/22/225203 (2009)

    2009 doi

  7. [15]

    J. K. Slingerland and F. A. Bais, Quantum groups and non-abelian braiding in quantum hall systems, Nuclear Physics B 612, 229 (2001)

    2001

  8. [16]

    Bravyi, Universal quantum computation with the ν = 5/2 fractional quantum hall state, Physical Review A 73, 10.1103/PhysRevA.73.042313 (2006)

    S. Bravyi, Universal quantum computation with the ν = 5/2 fractional quantum hall state, Physical Review A 73, 10.1103/PhysRevA.73.042313 (2006)

    2006 doi

  9. [17]

    Zilberberg, B

    O. Zilberberg, B. Braunecker, and D. Loss, Controlled- not gate for multiparticle qubits and topological quantum computation based on parity measurements, Physical Re- view A 77, 10.1103/PhysRevA.77.012327 (2008)

    2008 doi

  10. [18]

    M. H. Freedman, M. Larsen, and Z. Wang, A mod- 16 ular functor which is universal ¶for quantum computa- tion, Communications in Mathematical Physics 227, 605 (2002)

    2002

  11. [19]

    Burrello, H

    M. Burrello, H. Xu, G. Mussardo, and X. Wan, Topolog- ical quantum hashing with the icosahedral group, Phys Rev Lett 104, 160502 (2010)

    2010

  12. [20]

    C. M. Dawson and M. A. Nielsen, The solovay-kitaev algorithm, arXiv preprint quant-ph/0505030 (2005)

    2005 arXiv

  13. [21]

    G´ enetay Johansen and T

    E. G´ enetay Johansen and T. Simula, Fibonacci anyons versus majorana fermions: A monte carlo approach to the compilation of braid circuits in su(2)k anyon mod- els, PRX Quantum 2, 10.1103/PRXQuantum.2.010334 (2021)

    2021 doi

  14. [22]

    Y. H. Zhang, P. L. Zheng, Y. Zhang, and D. L. Deng, Topological quantum compiling with reinforce- ment learning, Phys Rev Lett 125, 170501 (2020)

    2020

  15. [24]

    Hormozi, G

    L. Hormozi, G. Zikos, N. E. Bonesteel, and S. H. Simon, Topological quantum compiling, Physical Review B 75, 10.1103/PhysRevB.75.165310 (2007)

    2007 doi

  16. [25]

    Xu and X

    H. Xu and X. Wan, Constructing functional braids for low-leakage topological quantum computing, Physical Review A 78, 10.1103/PhysRevA.78.042325 (2008)

    2008 doi

  17. [26]

    S. X. Cui, K. T. Tian, J. F. Vasquez, Z. Wang, and H. M. Wong, The search for leakage-free entangling fibonacci braiding gates, Journal of Physics A: Mathematical and Theoretical 52, 10.1088/1751-8121/ab488e (2019)

    2019 doi

  18. [29]

    Tounsi, N

    A. Tounsi, N. E. Belaloui, M. M. Louamri, A. Benslama, and M. T. Rouabah, Optimized topological quantum compilation of three-qubit controlled gates in the fi- bonacci anyon model: A controlled-injection approach, Physical Review A 110, 10.1103/PhysRevA.110.012603 (2024)

    2024 doi

  19. [30]

    S. X. Cui, S.-M. Hong, and Z. Wang, Universal quan- tum computation with weakly integral anyons, Quantum Information Processing 14, 2687 (2015)

    2015

  20. [31]

    Naidu and E

    D. Naidu and E. C. Rowell, A finiteness property for braided fusion categories, Algebras and Representation Theory 14, 837 (2010)

    2010

  21. [33]

    M. B. Hastings, C. Nayak, and Z. Wang, On metaplectic modular categories and their applications, Communica- tions in Mathematical Physics 330, 45 (2014)

    2014

  22. [34]

    S. X. Cui and Z. Wang, Universal quantum computa- tion with metaplectic anyons, Journal of Mathematical Physics 56, 10.1063/1.4914941 (2015)

    2015 doi

  23. [35]

    Read and E

    N. Read and E. Rezayi, Beyond paired quantum hall states: Parafermions and incompressible states in the first excited landau level, Physical Review B 59, 8084 (1999)

    1999

  24. [36]

    Barkeshli and X

    M. Barkeshli and X. G. Wen, Anyon condensation and continuous topological phase transitions in non-abelian fractional quantum hall states, Phys Rev Lett 105, 216804 (2010)

    2010

  25. [37]

    D. J. Clarke, J. Alicea, and K. Shtengel, Exotic non- abelian anyons from conventional fractional quantum hall states, Nat Commun 4, 1348 (2013)

    2013

  26. [38]

    L´ eonard, S

    J. L´ eonard, S. Kim, J. Kwan, P. Segura, F. Grusdt, C. Repellin, N. Goldman, and M. Greiner, Realization of a fractional quantum hall state with ultracold atoms, Nature 619, 495 (2023)

    2023

  27. [39]

    J. Cai, E. Anderson, C. Wang, X. Zhang, X. Liu, W. Holtzmann, Y. Zhang, F. Fan, T. Taniguchi, K. Watanabe, et al. , Signatures of fractional quantum anomalous hall states in twisted mote2, Nature 622, 63 (2023)

    2023

  28. [40]

    Z. Lu, T. Han, Y. Yao, A. P. Reddy, J. Yang, J. Seo, K. Watanabe, T. Taniguchi, L. Fu, and L. Ju, Fractional quantum anomalous hall effect in multilayer graphene, Nature 626, 759 (2024)

    2024

  29. [41]

    Fuchs, Affine Lie algebras and quantum groups: An Introduction, with applications in conformal field theory (Cambridge university press, 1995)

    J. Fuchs, Affine Lie algebras and quantum groups: An Introduction, with applications in conformal field theory (Cambridge university press, 1995)

    1995

  30. [42]

    S. X. Cui, K. T. Tian, J. F. Vasquez, Z. Wang, and H. M. Wong, The search for leakage-free entangling fibonacci braiding gates, Journal of Physics A: Mathematical and Theoretical 52, 455301 (2019)

    2019

  31. [43]

    P. O. Boykin, T. Mor, M. Pulver, V. Roychowdhury, and F. Vatan, On universal and fault-tolerant quantum com- puting: a novel basis and a new constructive proof of uni- versality for shor’s basis, in 40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039) ...

    1999

  32. [44]

    Nagy and S

    M. Nagy and S. G. Akl, Quantum computation and quan- tum information, International Journal of Parallel, Emer- gent and Distributed Systems 21, 1 (2006)

    2006

  33. [45]

    C. Levaillant, Topological quantum computation within the anyonic system the kauffman–jones version of su (2) chern–simons theory at level 4, Quantum Information Processing 15, 1135 (2016)

    2016

  34. [46]

    Field and T

    B. Field and T. Simula, Introduction to topological quan- tum computation with non-abelian anyons, Quantum Science and Technology 3, 10.1088/2058-9565/aacad2 (2018)

    2018 doi

  35. [47]

    N. E. Bonesteel, L. Hormozi, G. Zikos, and S. H. Si- mon, Braid topologies for quantum computation, Phys Rev Lett 95, 140503 (2005)

    2005

  36. [48]

    Levaillant, B

    C. Levaillant, B. Bauer, M. Freedman, Z. Wang, and P. Bonderson, Universal gates via fusion and measure- ment operations onsu(2)4anyons, Physical Review A 92, 10.1103/PhysRevA.92.012301 (2015)

    2015 doi

  37. [49]

    J. Long, X. Huang, J. Zhong, and L. Meng, Genetic al- gorithm enhanced solovay-kitaev algorithm for quantum compiling, arXiv:2501.01746 (2025)

    2025

  38. [50]

    Raussendorf and J

    R. Raussendorf and J. Harrington, Fault-tolerant quan- tum computation with high threshold in two dimensions, Phys Rev Lett 98, 190504 (2007)

    2007

  39. [51]

    A. G. Fowler, A. M. Stephens, and P. Groszkowski, High-threshold universal quantum computation on the surface code, Physical Review A 80, 10.1103/Phys- RevA.80.052312 (2009)

    2009 doi

  40. [52]

    A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, Surface codes: Towards practical large- scale quantum computation, Physical Review A 86, 17 10.1103/PhysRevA.86.032324 (2012)

    2012 doi

  41. [53]

    E. T. Campbell, B. M. Terhal, and C. Vuillot, Roads towards fault-tolerant universal quantum computation, Nature 549, 172 (2017)

    2017

  42. [54]

    Webster and S

    P. Webster and S. D. Bartlett, Fault-tolerant quantum gates with defects in topological stabilizer codes, Physical Review A 102, 10.1103/PhysRevA.102.022403 (2020)

    2020 doi

  43. [55]

    S. J. Lomonaco et al., Quantum Information Science and Its Contributions to Mathematics: American Mathemat- ical Society Short Course, January 3-4, 2009, Washing- ton, DC , Vol. 68 (American Mathematical Soc., 2010)

    2009

  44. [56]

    Makhlin, Nonlocal properties of two-qubit gates and mixed states, and the optimization of quantum compu- tations, Quantum Information Processing 1, 243 (2002)

    Y. Makhlin, Nonlocal properties of two-qubit gates and mixed states, and the optimization of quantum compu- tations, Quantum Information Processing 1, 243 (2002)

    2002

  45. [57]

    Zhang, J

    J. Zhang, J. Vala, S. Sastry, and K. B. Whaley, Geometric theory of nonlocal two-qubit operations, Physical Review A 67, 042313 (2003)

    2003

  46. [58]

    Artin, Theory of braids, Annals of Mathematics 48, 101 (1947)

    E. Artin, Theory of braids, Annals of Mathematics 48, 101 (1947)

    1947

  47. [59]

    M. Ezawa, Systematic construction of topological- nontopological hybrid universal quantum gates based on many-body majorana fermion interactions, Physical Re- view B 110, 045417 (2024)

    2024

Pith tools

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