{"id":"de687983-0e4d-4bca-add5-fc85f0b2b961","arxiv_id":"2412.20931","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Braiding two-strand cables of anyons gives a two-qubit controlled-phase gate with about 99 percent probability of staying in the computational space.","lead":"The authors propose building two-qubit entangling gates for a topological quantum computer by braiding cables of paired anyon strands, rather than individual strands. Their examples show that for chosen values of the Chern-Simons level k, the probability of leaking out of the computational space can be kept at about 99 percent with a nontrivial phase.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The claimed diagonal gate form O ≈ diag(1,1,1,e^{iφ}) is asserted, not derived; the adjoint-sector matrix elements for cases II and III are never computed, so the entangling gate is not actually established.","rationale":"The reader's weakest_assumption and my load-bearing concern coincide: Eq. (8) is stated without deriving the II/III matrix elements. I add one observation that strengthens this: Section 4 constructs B using only 3×3 matrices (Eqs. 9-10), which describe a braid of a single adjoint pair, yet case IV involves four adjoint cables; the paper never explains how the four-cable braid is reduced to this 3×3 picture, nor does it give the full operator for any of the four cases. Thus the gate matrix O ≈ diag(1,1,1,e^{iφ}) is doubly underived. The underlying framework is coherent and the case-IV numbers are plausibly correct, so this is not a fatal flaw; it is exactly the missing verification a CONDITIONAL verdict should demand. The proposed test—extract the braid word from Fig. 5, build the four-cable operator using the 3×3 R/S matrices plus identity on ∅ cables, and check all four diagonal entries—would settle whether the gate is genuinely of controlled-phase form. The paper's own Section 5 admits that for the SU(N) generalization 'there will be codependent phase shifts... therefore it should be checked that the resulting operation will indeed be entangling'; the same check is needed for SU(2) here. The reader's verdict remains CONDITIONAL, so no adjustment is needed.","tokens_in":7699,"tokens_out":19166,"duration_ms":151975,"concrete_test":"Extract the braid word from a Fig. 5 diagram. Represent each cable by its fusion channel ∅ (dimension 1) or adj (dimension 3). Use the 3×3 R-matrix (Eq. 9) for adjoint-adjoint crossings, identity for crossings with ∅, and the 3×3 S-matrix (Eq. 10) for basis changes. Multiply in braid order to get the four-cable operator. Compute its matrix elements in the four-dimensional basis of Eq. (7), projecting onto the subspace where each qubit's two cables fuse to ∅. Check whether the 4×4 matrix equals diag(1,1,1,e^{iφ}) to the quoted precision, with P=0.99 leakage in the relevant entries. If II/III entries are not 1 (up to global phase), the gate form (8) is wrong. This test needs only Fig. 5 and Eqs. (9)-(10).","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's central claim (abstract and Eq. 8) is that a cable braid realizes a two-qubit gate O ≈ diag(1,1,1,e^{iφ}), i.e., identity on cases I, II, III and a phase on case IV. The paper explicitly computes only case IV, using the 3×3 matrices R and S in Eqs. (9)-(10), and asserts in Section 3 that cases II and III 'also do not change as long as cables do not change the position'. This is the load-bearing premise: if the effective operator on the two adjoint cables in case II (or III) is not the identity up to an irrelevant phase, the full 4×4 matrix is not of controlled-phase type, and the gate may fail to be entangling. The assertion is plausible—trivial cables decouple—but the paper never computes the matrix element for the adjoint pair in cases II/III, nor shows that the phase is identical to case IV, nor gives the relative phase between the trivial and adjoint sectors. Moreover, B is built solely from 3×3 matrices, which describe a braid of a single adjoint pair; case IV involves four adjoint cables, and the paper does not explain how the four-cable braid reduces to this 3×3 picture. The examples in Fig. 5 report only P=|B_{1,1}|^2 and φ=Arg(B_{1,1}) for the 'case IV' element; no full operator is given. Thus the central claim that the operation is a non-trivial entangling two-qubit gate with high fidelity is not demonstrated; it rests on an unverified decoupling/identity assumption and an unexplained reduction. This is an internal-completeness gap, not a disagreement with consensus.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","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)).","tokens_in":8051,"tokens_out":8392,"duration_ms":92549,"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":[{"comment":"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.","section":"Section 3, Eq. (8)"},{"comment":"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.","section":"Section 4, Eqs. (9)–(12)"},{"comment":"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.","section":"Section 4, Fig. 5"}],"minor_comments":[{"comment":"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.","section":"Section 2, Eq. (3)"},{"comment":"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.","section":"Section 3, Eq. (7)"},{"comment":"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.","section":"Section 4, Eq. (11)"},{"comment":"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.","section":"Section 5"},{"comment":"The abstract contains a typo: 'allows oneto construct' should be 'allows one to construct'.","section":"Abstract"}],"recommendation":"major_revision","confidential_remarks":"The stress-test concern raised by the reader is genuine: the manuscript's central gate form is asserted rather than derived. I do not see evidence of circularity, since the construction uses standard R- and S-matrices and the numerical search is not fitted to a pre-existing gate. The paper's contribution would be solid if the authors supply the missing full-operator computation and make the examples reproducible. The topic fits the journal's scope, and with these revisions it could become acceptable."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Read this one with a pencil. The cabling idea is genuinely new: instead of braiding individual strands of two 4-plats, braid two-strand cables, which effectively places the strands in higher representations. The four-case leakage classification (I-IV) is clean, and the claim that trivial cables decouple is physically sensible. That much is a real contribution and a modest but useful extension of the authors' earlier one-qubit formalism. Credit where due: the U_q(SU(2)) R and S matrices used are standard, and the examples show high P with nontrivial phases, which is what you want for a controlled-phase gate.\n\nThe soft spot is the load-bearing one. The paper asserts the two-qubit operator is O ≈ diag(1,1,1,e^{iφ}) without ever computing the matrix elements for cases II and III. The sentence 'Cases II. and III. also do not change as long as cables do not change the position' is plausible, but it is not a derivation; there may be induced one-qubit phases on the adjoint pair, and those phases need to be computed and shown to be 1 (or at least absorbed). More importantly, the phase for case IV is extracted from a 3×3 R/S matrix algebra that describes the exchange of two adjoint strands, but case IV has four adjoint cables. The paper never explains how the four-cable braid reduces to this two-strand picture, or how B_{1,1} is obtained from the full braid product. That is a genuine internal-completeness gap, not a nitpick.\n\nThe examples in Fig.5 make matters worse: they report only rounded P and φ, with no explicit braid word and no exact matrix product. A referee cannot reproduce the numbers. The rounded values do not even show which braid corresponds to which k, apart from the captions. This is fixable, but as it stands the central claim is not established.\n\nAll that said, the idea is good enough to deserve a serious referee. It is a short paper from a group with a track record in this exact formalism, and the construction is likely valid with some work. I would send it to review, but ask the referee to push for the missing sector computations and at least one fully specified example. If the authors fill those gaps, this becomes a useful paper for the TQC subfield.","headline":"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.","tokens_in":8601,"tokens_out":6279,"would_cite":false,"duration_ms":64895,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P68","17B37","57K10"],"pacs":["03.67.Lx"],"model":"deepseek-v4-flash","headline":"Cabling from knot theory produces high-fidelity two-qubit entangling gates for topological quantum computers.","keywords":["topological quantum computation","knot theory","cabling","quantum R-matrix","Uq(SU(2))","braid group representation","two-qubit entangling gate","anyons"],"falsifier":"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.","tokens_in":7454,"feed_emoji":"🪢","tokens_out":6885,"duration_ms":60857,"temperature":0.7,"pith_summary":"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.","feed_headline":"Knot cabling gives two-qubit gates with 99% fidelity","feed_subtitle":"Braiding two-strand cables keeps anyon qubits in their computational space while adding a controlled phase.","key_machinery":"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.","core_discovery":"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.","pith_inferences":["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."],"forward_implications":["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."],"supporting_citations":[{"why":"Defines the 4-plat computational space of a qubit and identifies the leakage problem that motivates the two-qubit construction.","marker":"[11]"},{"why":"Supplies the universal set of one-qubit gates from quantum R-matrices and the braid-matrix formalism used throughout.","marker":"[13]"},{"why":"Provides the detailed one-qubit setup and the braiding/mixing matrices that the two-qubit cable construction extends.","marker":"[14]"},{"why":"One of the sources for the braiding and mixing matrix formulas used in the $U_q(\\mathrm{SU}(2))$ section.","marker":"[19]"},{"why":"Justifies treating a two-strand cable as a strand in a higher representation, the key reduction of the paper.","marker":"[21]"},{"why":"Counts the trivial representations in $\\mathrm{adj}\\otimes\\mathrm{adj}\\otimes\\mathrm{adj}\\otimes\\mathrm{adj}$, fixing the dimension of the space in which the adjoint-case braiding acts.","marker":"[22]"},{"why":"Another reference for the $R$ and $S$ matrices in $U_q(\\mathrm{SU}(2))$ used in the explicit braid calculations.","marker":"[24]"}],"fun_headline_variants":["Knot cabling entangles anyon qubits","99% fidelity from cable braids","Two-qubit gates via knot cabling","Cable braids make entangling gates","Topological gates from knot cabling"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"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.","fun_headline_variants_meta":{"raw":{"variants":["Knot cabling entangles anyon qubits","99% fidelity from cable braids","Two-qubit gates via knot cabling","Cable braids make entangling gates","Topological gates from knot cabling"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00094,"raw_usage":{"total_tokens":4002,"prompt_tokens":912,"completion_tokens":3090,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":528,"completion_tokens_details":{"reasoning_tokens":3024}},"tokens_in":528,"tokens_out":3090,"duration_ms":22123,"temperature":1.0,"reasoning_tokens":3024,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-10T23:06:39.002786+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"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.","supporting_citations":[{"cited_title":"Alekseev, An","cited_arxiv_id":null,"evidence_quote":"Another reference for the $R$ and $S$ matrices in $U_q(\\mathrm{SU}(2))$ used in the explicit braid calculations."}],"review_version":1}