Pith. sign in

REVIEW 3 major objections 5 minor 24 references

Entangling gates from cabling of knots

T0 review · 3 major / 5 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 Cabling from knot theory produces high-fidelity two-qubit entangling gates for topological quantum computers.

desk verdict Cabling is a plausible new route to suppressed-leakage two-qubit gates in TQC, but the paper asserts its central diagonal-gate form instead of deriving it, and the examples lack the data needed to check them. read the letter →

arxiv 2412.20931 v2 pith:N4AQCWDJ submitted 2024-12-30 quant-ph hep-th

Sergey Mironov , Andrey Morozov This is my paper · ORCID
classification quant-phhep-th MSC 81P6817B3757K10 PACS 03.67.Lx
keywords topologicalquantumcomputationknottheorycablingR-matrixUq(SU(2))braidgrouprepresentationtwo-qubitentanglinggateanyons
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 aims to show that the hard part of topological quantum computation—making a two-qubit gate without leaking out of the computational space—can be handled by braiding two-strand cables instead of individual anyon strands. The main claim is that in the $U_q(\mathrm{SU}(2))$ Chern–Simons theory there are explicit cable braids with return probability $P=|B_{1,1}|^2=0.99$ to the two-qubit computational space, while the gate is a controlled-phase operation $O\approx\mathrm{diag}(1,1,1,e^{i\varphi})$. Four sample braids are given, for $k=42,26,26,33$, with phase shifts $0.14\pi$, $0.29\pi$, $-0.87\pi$, and $-0.24\pi$. If the construction works, it provides a parameter-dependent blueprint for entangling anyons with controlled leakage.

What carries the argument

The central object is the cable braid: two strands belonging to one qubit are tied together as a cable, and the two-qubit operation is obtained by braiding cables, which is interpreted as braiding strands in higher representations. The calculation is carried by the braiding and mixing matrices $R$, $S$, $\bar S$, $T$, $\bar T$, $T_i$ of formulas (9)–(11), acting on the three-dimensional space spanned by the representations $\varnothing$, $[2]$ (the adjoint), and $[4]$. The load-bearing quantity is the matrix element $B_{1,1}$ of the whole braid word: its squared modulus is the fidelity of staying in the computational space, and its argument is the phase $\varphi$ of the gate.

What would settle it

Compute the full $4\times 4$ matrix of one of the proposed cable braids in the basis $|\varnothing\varnothing\rangle, |\varnothing\,\mathrm{adj}\rangle, |\mathrm{adj}\,\varnothing\rangle, |\mathrm{adj}\,\mathrm{adj}\rangle$. If the blocks mixing or phase-rotating the second and third basis states are not proportional to the identity, the gate is not the claimed controlled-phase form. A second check is to multiply the explicit matrices (9)–(11) for one of the braids in Fig. 5 and verify $|B_{1,1}|^2=0.99$ and the listed phase.

Watch

Extended reading notes

Core claim

On the paper's own terms, the discovery is that the leakage caused by a two-qubit braid can be made small by choosing the braid at the level of cables: each cable contains the two strands of one anyon pair, and the two-qubit gate is built by braiding these cables while never separating the two strands inside a cable. In $U_q(\mathrm{SU}(2))$, each cable carries either the trivial or the adjoint representation, and the paper argues that only the case of four adjoint cables is non-trivial; there the braid acts on the three-dimensional space $\varnothing,[2],[4]$, and the matrix element $B_{1,1}$ for returning to the computational sector gives fidelity $P=|B_{1,1}|^2=0.99$ and phase $\varphi=\mathrm{Arg}(B_{1,1})$. The four explicit braids presented have phases $0.14\pi$, $0.29\pi$, $-0.87\pi$, and $-0.24\pi$ for $k=42,26,26,33$. The conclusion is that the corresponding two-qubit operator is close to $\mathrm{diag}(1,1,1,e^{i\varphi})$, i.e. an entangling gate.

Load-bearing premise

The load-bearing premise is that a cable in the trivial representation does not affect the other cables, so cases II and III of the four-cable system undergo no change; if that fails, the two-qubit operator is not $\mathrm{diag}(1,1,1,e^{i\varphi})$ and the entangling property is not established.

Editorial extensions

If this is right

  • For $U_q(\mathrm{SU}(2))$ anyons, entangling gates can be implemented with $99\%$ probability of remaining in the computational space, for the explicit parameters $k=42,26,26,33$.
  • Because the gate is approximately $\mathrm{diag}(1,1,1,e^{i\varphi})$, it is entangling: it creates entanglement from product states without moving out of the qubit space.
  • The same cable construction can be applied between any pair of qubits in a larger topological quantum computer, giving multiqubit computation from a two-qubit gate.
  • The good braid word depends on the coupling constant $k$, so the gate design is tied to the particular realization of the topological theory, not universal.

Reading between the lines

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

  • Editorial inference: the decisive open check is the full $4\times 4$ matrix of the cable braid, not just the $B_{1,1}$ amplitude; if the blocks for cases II and III are not proportional to the identity, the gate deviates from $\mathrm{diag}(1,1,1,e^{i\varphi})$.
  • Editorial inference: for $U_q(\mathrm{SU}(N))$ with parallel strands in a cable, all four sectors interact, so fidelity would be governed by the worst sector; the paper's single-sector argument would need to be repeated per sector.
  • Editorial inference: the phase values listed are probably not the only ones; a practical implementation could search longer braid words to raise $P$ further or to tune $\varphi$, but that requires a systematic optimization not attempted here.
Share X Bluesky LinkedIn Reddit HN

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 proposes a construction of two-qubit entangling gates in a topological quantum computer by braiding composite cables made of pairs of anyon strands. The authors argue that braiding cables rather than individual strands strongly suppresses leakage out of the computational space, and they claim that in the U_q(SU(2)) case the resulting gate is of the form O ≈ diag(1,1,1,e^{iφ}), i.e. a controlled-phase gate with high fidelity. They illustrate the construction with four example braids for different values of k, reporting P = |B_{1,1}|^2 = 0.99 and various phase shifts φ. The manuscript also sketches a generalization to U_q(SU(N)).

Significance. The cabling idea is attractive and potentially significant: it addresses a real obstacle in topological quantum computation, namely the leakage out of the computational subspace during two-qubit operations, and it offers concrete candidate braids with high survival probability at finite k. The paper is also commendably concrete in using explicit R- and S-matrices and in presenting numerical examples for several values of k. However, the central claim that the resulting two-qubit operator is of controlled-phase form is not yet established, because the full operator is not computed and the reduction from four-cable braiding to the displayed 3×3 matrices is not explained. If the missing derivation is supplied, the construction would be a useful contribution to the TQC literature.

major comments (3)
  1. [Section 3, Eq. (8)] The claimed operator form O ≈ diag(1,1,1,e^{iφ}) is asserted, not derived. The paper computes only the case IV sector (adj⊗adj⊗adj⊗adj) and states without proof that cases II and III 'do not change'. This is not automatic: in case II (and similarly III), the two adjoint cables on one side can undergo nontrivial braiding even if both cables return to their initial positions. A one-qubit braid on the adjoint pair would produce a nontrivial 2×2 unitary in that sector, so the full 4×4 matrix would not be of the claimed diagonal form. The authors need to either restrict the cable braid so that no same-side adjoint-adjoint crossing occurs, and prove that no nontrivial phase is accumulated, or compute the 2×2 blocks for cases II and III explicitly. Without this, the controlled-phase form and hence the entangling property are not demonstrated.
  2. [Section 4, Eqs. (9)–(12)] The reduction from a braid on four adjoint cables to the 3×3 matrices R and S is not explained. Equations (9) and (10) are the braiding and mixing matrices for the tensor product of two adjoint representations, [2]⊗[2] = [0]+[2]+[4]. The case IV state lives in ([2]⊗[2])⊗([2]⊗[2]), which contains three trivial representations, not the single three-dimensional space on which R and S are written. The statement that the picture 'becomes similar to the one-qubit state' is not sufficient: the paper must specify the tensor-product decomposition, the identification of the computational state, and the way a product of pairwise cable crossings is assembled into the operator B. In particular, Eq. (12) defines P and φ from B_{1,1}, but it is not shown that B_{1,1} is the correct matrix element of the four-cable operator in the computational basis.
  3. [Section 4, Fig. 5] The numerical examples are not reproducible as presented. The figure gives only rounded values P = 0.99 and φ to two decimals, but no explicit braid word and no explicit product of R/S matrices or resulting B matrix for any of the four cases. Since the central quantitative claim is the existence of high-fidelity, non-trivial entangling gates, the authors should provide exact or high-precision values of B_{1,1} and a clear braid-word encoding (or an explicit sequence of crossings) for each example. This would also allow the reader to verify that the diagrams in Fig. 5 do not contain same-side adjoint-adjoint crossings, which is essential for the case II/III argument.
minor comments (5)
  1. [Section 2, Eq. (3)] The notation is hard to follow: S and \bar S are described as two-dimensional operators, but the displayed matrices are typeset in a way that makes their dimensions and entries ambiguous. Please define [n]_q explicitly (used in Eq. (10)) and state the dimensions of all matrices.
  2. [Section 3, Eq. (7)] The sentence 'There is no case which includes ∅⊗adj on one side' should be expanded: the reason is that such a sector would not arise from the two-qubit computational basis, but this is stated rather than shown.
  3. [Section 4, Eq. (11)] The relation between T, \bar T, T_i and the powers q^{-4}, q^{-8} is presented without derivation or a precise reference. Since these coefficients enter the braiding product, a short justification or a pointer to the exact formula in [9] would help.
  4. [Section 5] The concluding claim that the gate can be used 'between any pair of qubits' to obtain multiqubit computations is too quick. It should be stated that the gate must be a controlled-phase gate up to local unitary operations and that repeated application preserves the computational subspace; this depends on the missing full-operator computation.
  5. [Abstract] The abstract contains a typo: 'allows oneto construct' should be 'allows one to construct'.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the cabling gate and its fidelity are computed directly from standard U_q(SU(2)) R/S matrices; the asserted diagonal form (8) is an unproven sector-decoupling step, not a circular reduction.

full rationale

The paper's derivation chain is not circular. The one-qubit framework (Eqs. 2-3) is taken from prior work [12-20], but the R/S and T matrices are standard, parameter-free quantum-group data, externally checkable, and do not include the target two-qubit result. The two-qubit construction is new: cables are treated as higher representations, and the case-IV amplitude B_{1,1} is computed explicitly from the 3x3 matrices (9)-(10); P and phi in Eq. (12) are direct outputs of this computation, not fitted inputs. The examples in Fig. 5 are existence demonstrations obtained by choosing braids with P=0.99, which is selection, not circular prediction. The main logical weakness is that Eq. (8) O ~ diag(1,1,1,e^{i phi}) is asserted from the qualitative statement that cases II and III "do not change", and the matrix elements for those sectors are never computed; this is an internal-completeness gap, not a circularity, because the assertion is not equivalent by definition to the computed B_{1,1} and no self-citation is doing the work. Self-citations appear, but they support background formalism and standard matrices, so per rule 4 they count as independent evidence and do not raise the circularity score.

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

No fitted parameters appear in the derivation; the only inputs are k and N from Chern-Simons theory. The paper introduces no new entities: cables are composite strands. The main liability is the unproved assumption that sectors with one trivial pair and one adjoint pair are unaffected, listed above as an ad hoc axiom.

assumptions (5)
  • domain assumption Crossings of anyon worldlines are represented by the quantum R-matrices of U_q(SU(N)) with q = exp(2 pi i / (k + N)).
    Section 1, Eq.(1) and following; standard result cited to [9,10].
  • domain assumption A 4-plat with two anyon-anti-anyon pairs encodes a qubit whose computational states are the trivial and adjoint representations of the pair.
    Section 2, Eq.(2) and refs [11-16]; the paper builds on this prior construction.
  • domain assumption While braided as cables, each pair of strands stays in [1] tensor [1bar] = empty + adj, and representations inside a cable do not change unless strands are separated.
    Section 3, around Eq.(6)-(7); needed for the four-case classification.
  • ad hoc to paper Cases II and III acquire only trivial, or locally irrelevant, phases under the proposed cabling braid.
    Section 3, before Eq.(8): 'Since interactions for all the cases, but IV. is trivial... operator will have form O approximately diag(1,1,1,e^{i phi})'. This is asserted, not derived.
  • standard math The U_q(SU(2)) R- and S-matrices in Eqs.(9)-(10) from prior refs [14,19,23,24] correctly describe braiding of adjoint cables.
    Section 4, Eqs.(9)-(10); standard quantum group result.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Entangling gates from cabling of knots." pith.science (2026). https://pith.science/paper/N4AQCWDJ

@misc{pith2026241220931,
  author       = {Pith},
  title        = {Pith review of: Entangling gates from cabling of knots},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/N4AQCWDJ}},
  note         = {Machine review of arXiv:2412.20931}
}
read the original abstract

While there is a general consensus about the structure of one qubit operations in topological quantum computer, two qubits are as usual a more difficult and complex story of different attempts with varying approaches, problems and effectiveness. In this paper we discuss how to construct an efficient realization of a two qubit gate in topological quantum computer, by using principle of cabling from the knot theory. This allows to construct a braiding of cables dependent on the parameters of the theory where there is a low probability of moving out of computational space (high fidelity of operation) while there is a non-trivial entangling two-qubit operation. We also present some examples of these operations for different parameters of the theory.

Figures

Figures reproduced from arXiv: 2412.20931 by the authors.

Figure 1
Figure 1. Description of one-qubit operations using anyons. Two pairs of anyons are created then they are entangled [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Operation, which entangles two qubits, can be constructed by braiding cables of two strands to form a more [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. Entangling of two qubits with the cables on the left can be interpreted as a braid in higher representations [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figures from the paper (2 more)
Figure 4
Figure 4. Figure 4: Unknotting property of T and T¯ operators. are initially in a computational space (case IV. from (7)) and are kept there in the end. Therefore, probability of two qubits to remain in computable space P and phase shift ϕ are given by P = |B1,1| 2 , ϕ = Arg(B1,1). (12) k…
Figure 5
Figure 5. Figure 5: Several examples of braidings that correspond to entangling operators with high fidelity. [PITH_FULL_IMAGE:figures/full_fig_p006_5.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

24 extracted references · 1 canonical work pages

  1. [2]

    Nayak, S

    C. Nayak, S. H. Simon, A. Stern, M. Freedman, S. Das Sarma, Rev. Mod. Phys. 80 (2008), 1083, [arXiv:0707.1889 [hep-th]]

    arXiv 2008

  2. [4]

    D. Zou, N. Pan, T. Chen, H. Sun, X. Zhang, Adv. Intell. Syst. 2300354 (2023) [arXiv:2309.04896 [cond-mat]]

    arXiv 2023

  3. [1]

    A. Y. Kitaev, Russian Mathematical Surveys, 52 (1997), 1191

    1997

  4. [3]

    R. S. Souto, A. Tsintzis, M. Leijnse, J. Danon, Phys. Rev. Research 5, 043182 (2023) doi:10.1103/PhysRevResearch.5.043182 [arXiv:2308.14751 [cond-mat]]

    arXiv 2023

  5. [5]

    Winblad, H

    A. Winblad, H. Chen, [arXiv:2309.11607 [cond-mat]]

    arXiv

  6. [6]

    Bonderson, A

    P. Bonderson, A. Kitaev, K. Shtengel, Phys. Rev. Lett. 96, 016803 (2006) [arXiv:cond-mat/0508616]

    arXiv 2006

  7. [7]

    Nakamura, S

    J. Nakamura, S. Liang, G. C. Gardner, M. J. Manfra, Nat. Phys. 16, 931–936 (2020), doi:10.1038/s41567-020- 1019-1 [arXiv:2006.14115 [cond-mat]]

    arXiv 2020

  8. [8]

    Dom ´ ınguez, F

    F. Dom ´ ınguez, F. Hassler, G. Platero, [arXiv:1202.0642 [cond-mat]]

    arXiv

Show all 24 references
  1. [9]

    and Schm¨ udgen, K

    Klimyk, A. and Schm¨ udgen, K. Quantum groups and their representations. Springer Science & Business Media (2012)

    2012

  2. [10]

    Kauffman, S

    L. Kauffman, S. Lomonaco, New Journal of Physics, 4 (2002) 73.1-18; 6 (2004) 134.1-40, [arXiv:quant- ph/0401090]

    2002

  3. [11]

    S. H. Simon, Topological Quantum (Oxford, 2023; online edn, Oxford Academic, 14 Dec. 2023)

    2023

  4. [12]

    Melnikov, A

    D. Melnikov, A. Mironov, S. Mironov, A. Morozov and A. Morozov, Nucl. Phys. B 926 (2018), 491-508 doi:10.1016/j.nuclphysb.2017.11.016 [arXiv:1703.00431 [hep-th]]

    2018 arXiv

  5. [13]

    Kolganov and A

    N. Kolganov and A. Morozov, JETP Lett. 111 (2020) no.9, 519-524 doi:10.1134/S0021364020090027 [arXiv:2004.07764 [hep-th]]

    2020 arXiv

  6. [14]

    Kolganov, S

    N. Kolganov, S. Mironov and A. Morozov, Nucl. Phys. B 987 (2023), 116072 doi:10.1016/j.nuclphysb.2023.116072 [arXiv:2105.03980 [hep-th]]. 7

    2023

  7. [15]

    Morozov, Probl.Info.Transm

    A. Morozov, Probl.Info.Transm. 60 (2024) 28-34 doi:10.1134/S0032946024010046 [arXiv:2403.07847 [hep-th]]

    2024 arXiv

  8. [16]

    Mironov and A

    S. Mironov and A. Morozov, Phys. Rev. D 110, 126020, 2024 doi:10.1103/PhysRevD.110.126020 [arXiv:2404.12222 [hep-th]]

    2024 arXiv

  9. [17]

    Mironov, A

    A. Mironov, A. Morozov, A. Morozov, P. Ramadevi, V. K. Singh and A. Sleptsov, J. Phys. A 50 (2017) no.8, 085201 doi:10.1088/1751-8121/aa5574 [arXiv:1601.04199 [hep-th]]

    2017 arXiv

  10. [18]

    Mironov, A

    A. Mironov, A. Morozov, A. Morozov, P. Ramadevi and V. K. Singh, JHEP 07 (2015), 109 doi:10.1007/JHEP07(2015)109 [arXiv:1504.00371 [hep-th]]

    2015 arXiv

  11. [19]

    Nawata, P

    S. Nawata, P. Ramadevi, Zodinmawia, Letters in Mathematical Physics 103, pp. 1389–1398 (2013), [arXiv:1302.5143 [hep-th]]

    2013 arXiv

  12. [20]

    Mironov, A

    A. Mironov, A. Morozov, A. Sleptsov, JHEP 07 (2015) 069, [arXiv:1412.8432 [hep-th]]

    2015 arXiv

  13. [21]

    Anokhina and An

    A. Anokhina and An. Morozov, Teor. Mat. Fiz. 178 (2014), 3-68 doi:10.1007/s11232-014-0129-2 [arXiv:1307.2216 [hep-th]]

    2014 arXiv

  14. [22]

    Mironov and A

    A. Mironov and A. Morozov, Physics Letters B755 (2016) 47-57 doi:10.1016/j.physletb.2016.01.063 [arXiv:1511.09077 [hep-th]]

    2016 arXiv

  15. [23]

    Mironov, A

    A. Mironov, A. Morozov and A. Sleptsov, JETP Lett. 106 (2017) no.10, 630-636, doi:10.1134/S0021364017220040 [arXiv:1709.02290 [hep-th]]

    2017 arXiv

  16. [24]

    Alekseev, An

    V. Alekseev, An. Morozov and A. Sleptsov, Nucl. Phys. B 960 (2020), 115164, doi:10.1016/j.nuclphysb.2020.115164 [arXiv:1912.13325 [hep-th]] 8

    2020

Pith tools

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