Pith. sign in

REVIEW 3 major objections 4 minor 25 references

On the Realization of quantum gates coming from the Tracy-Singh product

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

Pith's one-line read Two 2-qudit gates realized by an exactly universal set give a realized Tracy-Singh gate via two swaps, and the Turaev link invariant of the product factors as the product of the individual invariants for primitive enhanced pairs.

desk verdict A correct and honestly self-flagged compilation rule for Tracy-Singh gates, with a product formula for link invariants that is proved only in the non-swapped primitive case. read the letter →

arxiv 2412.02345 v1 pith:TKWNXHE4 submitted 2024-12-03 quant-ph math-phmath.GRmath.MPmath.QA

classification quant-phmath-phmath.GRmath.MPmath.QA MSC 16T2581P6820F3615A69
keywords Tracy-SinghproductYang-Baxterequationgatesquantumexactlyuniversalsetbraidgrouprepresentationslinkinvariantsentanglinggate
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 addresses how to realize gates built from the Tracy-Singh (block Kronecker) product of two 2-qudit Yang-Baxter gates. It proves that a Tracy-Singh gate $c \boxtimes c'$ always equals $(\mathrm{Id} \otimes P \otimes \mathrm{Id})(c \otimes c')(\mathrm{Id} \otimes P \otimes \mathrm{Id})$, where $P$ is the swap, so a realization of $c$ and $c'$ by an exactly universal gate set immediately gives a realization of $c \boxtimes c'$ by the same set plus swap layers. This iterates, so every gate built by repeated Tracy-Singh products on $(\mathbb{C}^d)^{\otimes 2^k}$ inherits a realization. The paper also proves that the Tracy-Singh product of two enhanced Yang-Baxter pairs is enhanced, and that for primitive non-swapped factors the Turaev link invariant factors as $I_{c \boxtimes c'}(b)=I_c(b)I_{c'}(b)$. This matters because entangling Yang-Baxter gates are exactly universal, so the construction turns known gates into new entangling gates that come with explicit circuits.

What carries the argument

The machinery is the Tracy-Singh product with the canonical block partition, a block-wise Kronecker product that satisfies $(A\boxtimes B)(C\boxtimes D)=AC\boxtimes BD$. The load-bearing identities are the swap sandwich $c \boxtimes c'=(\mathrm{Id}\otimes P\otimes\mathrm{Id})(c\otimes c')(\mathrm{Id}\otimes P\otimes\mathrm{Id})$, the imported factorization $c \boxtimes c'=(c_1\otimes d_1)\otimes(c_2\otimes d_2)$ for primitive $c=c_1\otimes c_2$ and $c'=d_1\otimes d_2$, and the partial-trace identity $\mathrm{Tr}_2(A\boxtimes B)=\mathrm{Tr}_2(A)\otimes\mathrm{Tr}_2(B)$. These identities let the proof reduce circuit realization of the product to realization of the factors, and reduce the braid representation of the product to two independent representations whose traces multiply.

What would settle it

Choose concrete matrices $c_1,c_2,d_1,d_2$ and enhanced pairs $(c,\mu)$, $(c',\eta)$, form $c \boxtimes c'$ directly from the definition, and compare $I_{c \boxtimes c'}(b)$ with $I_c(b)I_{c'}(b)$ for a braid word with at least one crossing; a single mismatch, or a failure of $c \boxtimes c'=(c_1\otimes d_1)\otimes(c_2\otimes d_2)$ on those matrices, would refute the theorem.

Watch

Extended reading notes

Core claim

In the paper's own terms, the discovery is an exact realization identity and an invariant product identity for the Tracy-Singh product. Theorem A says that if two 2-qudit gates $c,c'$ are each realized by gates from an exactly universal set $U$, then $c \boxtimes c'$ is also realized by $U$, because $c \boxtimes c' = (\mathrm{Id} \otimes P \otimes \mathrm{Id})(c \otimes c')(\mathrm{Id} \otimes P \otimes \mathrm{Id})$ and the tensor product on the right decomposes as a product of tensor products of the same gates. Theorem B says that when $(c,\mu)$ and $(c',\eta)$ are enhanced Yang-Baxter pairs with $c=c_1\otimes c_2$ and $c'=d_1\otimes d_2$ primitive, the pair $(c \boxtimes c',\mu\otimes\eta)$ is enhanced and the Turaev invariant satisfies $I_{c \boxtimes c'}(b)=I_c(b)I_{c'}(b)$ for every braid $b$, using the factorization $c \boxtimes c'=(c_1\otimes d_1)\otimes(c_2\otimes d_2)$ from prior work.

Load-bearing premise

Two load-bearing gaps are flagged in the paper itself: the factorization $c \boxtimes c'=(c_1\otimes d_1)\otimes(c_2\otimes d_2)$ for primitive factors is imported from earlier work [3] without proof here, and the passage at the end of the proof of Theorem B says the swapped primitive case $c=(c_1\otimes c_2)P$, $c'=(d_1\otimes d_2)P$ is not proved.

Editorial extensions

If this is right

  • Any circuit for $c$ and $c'$ from an exactly universal set becomes a circuit for $c \boxtimes c'$ by inserting two swap layers around $c \otimes c'$.
  • Iterating the process realizes every Tracy-Singh product on $(\mathbb{C}^d)^{\otimes 2^k}$ from realizations of the base gates, because the same swap sandwich applies at each stage.
  • The Tracy-Singh product of two enhanced Yang-Baxter pairs is again an enhanced Yang-Baxter pair, so the Turaev invariant construction applies to the product gate.
  • For primitive non-swapped factors $c=c_1\otimes c_2$ and $c'=d_1\otimes d_2$, $I_{c \boxtimes c'}(b)=I_c(b)I_{c'}(b)$ for every braid $b$.
  • When the total dimension is $2^\ell$, the single entangling gate in the universal set can be taken to be the CNOT gate, so the realization is expressed in standard qubit gates.

Reading between the lines

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

  • A natural next test is the swapped primitive case $c=(c_1\otimes c_2)P$, $c'=(d_1\otimes d_2)P$; the author notes the same computation does not prove the product formula there, so that case likely needs a new argument rather than the tensor-product factorization.
  • If the product formula for Turaev invariants extended beyond primitive factors, the Tracy-Singh product would provide a systematic way to construct new link invariants from old ones; the present proof reaches only primitive non-swapped factors.
  • The appendix's partial-trace identity $\mathrm{Tr}_2(A\boxtimes B)=\mathrm{Tr}_2(A)\otimes\mathrm{Tr}_2(B)$ is a general matrix fact and could be applied independently of the Yang-Baxter equation, for instance to analyze how entangling power behaves under the Tracy-Singh product.
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 / 4 minor

Summary. The paper studies the Tracy--Singh product c ⊠ c' of two 2-qudit gates. It proves Proposition 2.3, the identity c ⊠ c' = (Id ⊗ P ⊗ Id)(c ⊗ c')(Id ⊗ P ⊗ Id), and uses it to argue (Theorem A) that a realization of c and c' in terms of an exactly universal set yields a realization of c ⊠ c'. It then proves Lemma 3.1 that (c ⊠ c', µ ⊗ η) is an enhanced Yang--Baxter pair when (c, µ) and (c', η) are enhanced pairs, and proves Theorem B that for primitive gates of the tensor-product form c = c1 ⊗ c2 and c' = d1 ⊗ d2 the Turaev invariant satisfies I_{c⊠c'}(b) = I_c(b) I_c'(b). The final paragraph of Section 3 explicitly concedes that the swapped primitive case c = (c1 ⊗ c2)P, c' = (d1 ⊗ d2)P is not proved.

Significance. The identity in Proposition 2.3 is correct and gives a clean conceptual circuit realization, so Theorem A is a useful observation if the proof is tightened. Lemma 3.1 validly extends enhanced Yang--Baxter pairs to the Tracy--Singh product. The product formula in the tensor-product primitive case is a nice structural result connecting the Tracy--Singh product with link invariants, and the proof strategy via factorization of ρ into single-site operators is sound. However, the paper advertises the product formula for all primitive gates in the introduction, while the proof only covers the non-swapped tensor-product case; this is a real, self-flagged gap. The proof of Theorem A is also not written at the level of generality stated.

major comments (3)
  1. [Introduction and Section 3] The introduction claims that if c and c' are 'both primitive of some kind' then I_{c⊠c'}(b) = I_c(b) I_c'(b), but Theorem B as stated and proved covers only the case c = c1 ⊗ c2 and c' = d1 ⊗ d2. The closing paragraph of Section 3 explicitly states that for primitive gates of the form c = (c1 ⊗ c2)P and c' = (d1 ⊗ d2)P the product formula could not be proved 'although it seems that is should be true'. Since a primitive 2-qudit gate is, according to [3], either a tensor product or a swap of a tensor product, the advertised result is strictly broader than what is established. This is a load-bearing gap: either provide a proof for the swapped case, or amend the abstract, introduction, and Theorem B to state only the tensor-product case and present the swapped case as an open problem.
  2. [Proof of Theorem A, Section 2.2] The proof assumes that every 2-qudit gate L_i in a circuit realization is either of the form S_i ⊗ T_i or equal to a single distinguished gate U, and that the universal set may be taken to have a single 2-qudit gate. This is not justified by Definition 2.1, which allows an exactly universal set to contain several 2-qudit gates. The conclusion is nevertheless obtainable directly from Proposition 2.3: c ⊠ c' = (Id ⊗ P ⊗ Id)(c ⊗ c')(Id ⊗ P ⊗ Id), and c ⊗ c' is realized by running the given circuits for c and c' in parallel on the two pairs of qudits. The proof should be rewritten along these lines, or the reduction to the single-gate case should be justified explicitly.
  3. [Proof of Theorem B, Section 3] The proof imports the factorization c ⊠ c' = (c1 ⊗ d1) ⊗ (c2 ⊗ d2) from [3, Theorem 6.3] without proof. Although this can be recovered from Proposition 1.4, the dependency should be stated explicitly and a short derivation included. In addition, the 'schematic form' of ρ^c_n(b) and ρ^{c⊠c'}_n(b) is the crux of the trace-factorization argument and should be justified as a lemma: because each local gate is a tensor product of single-site operators, the global braid representation operator is a tensor product over sites, so its trace factors as a product of single-site traces. This is true, but the current proof leaves too much to a schematic display.
minor comments (4)
  1. [Theorem A statement, Section 2.2] The statement says 'the realisation of c ⊠ d' but the symbol d is not defined; it should be c ⊠ c'.
  2. [Equation (2.3)] The product over i = 1 to l leaves L_i undefined for i > k when k < l; define L_i = Id_2 for i > k.
  3. [Introduction and Section 3] There are typos: 'L.H. Kaufman' should be 'L.H. Kauffman', and 'although it seems that is should be true' should be 'although it seems that it should be true'.
  4. [Theorem 1.3] Item (vi) has a missing parenthesis: c(A ⊠ B = A ⊠ (cB) should read c(A ⊠ B) = A ⊠ (cB).

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: Theorem A is immediate from the Tracy-Singh identity and Theorem B is a trace computation; the unproved swapped case is a scope gap, not a circular step.

full rationale

I walked the derivation chain and found no circular reduction. Theorem A is a direct application of Proposition 1.4: c ⊠ c′ = (Id ⊗ P ⊗ Id)(c ⊗ c′)(Id ⊗ P ⊗ Id), so a known circuit for c and c′ composes to a circuit for c ⊠ c′; no fitted parameter is renamed as a prediction. Theorem B is a trace computation: for primitive c = c1 ⊗ c2 and c′ = d1 ⊗ d2, the factorization c ⊠ c′ = (c1 ⊗ d1) ⊗ (c2 ⊗ d2) is quoted from the author's prior [3, Theorem 6.3], but it is also immediately recoverable from Proposition 1.4 (the F23 conjugation), so the reliance on the self-citation is not load-bearing in a circular way. The enhanced-YBE part is proved in the text using standard Tracy-Singh identities and the appendix identities (3.3) and (3.4). The one genuine limitation is self-flagged in the closing paragraph of Section 3: for swapped primitive gates c = (c1 ⊗ c2)P and c′ = (d1 ⊗ d2)P, the paper concedes 'we could not prove, using the same kind of computation as in the proof of Theorem B, that Ic⊠c′(b) = Ic(b) · Ic′(b), although it seems that is should be true.' This is a completeness or scope gap, not a circularity, because the proved statement itself is restricted to the non-swapped case and the admitted failure is an unproved extension rather than a hidden assumption of the result. Overall the derivation chain is self-contained apart from standard prior results that are explicitly stated and independently recoverable.

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

The paper introduces no free parameters. The mathematical load is carried by standard Tracy-Singh product identities (Theorem 1.3 and Proposition 1.4) and by three domain theorems imported from outside this paper: Brylinski-Brylinski exact universality of entangling gates, Turaev's enhanced YBE link invariant construction, and the author's own [3] factorization theorem for primitive Tracy-Singh products. The most fragile imported item is [3, Theorem 6.3], because Theorem B's factorization depends on it and no independent proof is given here.

assumptions (6)
  • standard math Tracy-Singh product properties, including (A boxtimes B)(C boxtimes D) = AC boxtimes BD and inverse properties (Theorem 1.3, items (v) and (vii)).
    Taken from [19] without proof; used throughout Sections 2 and 3.
  • standard math Representation c boxtimes c' = (In tensor Kmn tensor Im)(c tensor c')(Ip tensor Kpq tensor Iq) (Proposition 1.4).
    Cited to [11,14,18]; the entire realization Theorem A rests on this identity.
  • domain assumption For primitive gates of the same kind, the Tracy-Singh product c boxtimes c' is primitive and factorizes as (c1 tensor d1) tensor (c2 tensor d2) ([3, Theorem 6.3]).
    Theorem B depends on this companion-paper theorem; it is not proved or independently verified here.
  • domain assumption An entangling 2-qudit gate together with all 1-qudit gates is exactly universal ([2]).
    Used in Theorem A to define the universal set U and to argue that any gate can be realized.
  • standard math Enhanced YBE pairs (c, mu) yield Turaev link invariants ([20]).
    Basis for the definition of I_c(b) and for the claim that these are link invariants.
  • domain assumption Primitive YBE gates yield trivial link invariants ([1]).
    Used in the introduction to motivate Theorem B and to compare with the known triviality result.

how reviews work

0 comments
Cite this review

Pith. "Pith review of On the Realization of quantum gates coming from the Tracy-Singh product." pith.science (2026). https://pith.science/paper/TKWNXHE4

@misc{pith2026241202345,
  author       = {Pith},
  title        = {Pith review of: On the Realization of quantum gates coming from the Tracy-Singh product},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/TKWNXHE4}},
  note         = {Machine review of arXiv:2412.02345}
}
abstract

The Tracy-Singh product of matrices permits to construct a new gate $c \boxtimes c'$ from two $2$-qudit gates $c$ and $c'$. If $c$ and $c'$ are both Yang-Baxter gates, then $c \boxtimes c'$ is also a Yang-Baxter gate, and if at least one of them is entangling, then $c \boxtimes c'$ is also entangling. A natural question arises about the realisation of these gates, $c \boxtimes c'$, in terms of local and universal gates. In this paper, we consider this question and describe this realisation.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

25 extracted references · 24 canonical work pages

  1. [3]

    Chouraqui, The Yang-Baxter equation, quantum computing and quantum en tanglement,Physica Scripta 99 (2024), n

    F. Chouraqui, The Yang-Baxter equation, quantum computing and quantum en tanglement,Physica Scripta 99 (2024), n. 11,115-215

  2. [1]

    Alagic, M

    G. Alagic, M. Jarret, S.P. Jordan, Yang-Baxter operators need quantum entanglement to distin guish knots, J. of Physics A: Mathematical and Theoretical, 49(2016), n.7

  3. [2]

    Brylinski, R

    J.L. Brylinski, R. Brylinski, Universal quantum gates , Mathematics of Quantum Computation, Chap- man and Hall/CRC Press, Boca Raton, Florida 2002 (edited by R . Brylinski and G. Chen)

  4. [4]

    Conti, G

    R. Conti, G. Lechner, Yang–Baxter endomorphisms, J. London Math. Soc. (2) 103 (2021), 633–671

  5. [5]

    Quantum time dynamics mediated by the Yang-Baxter equation and artificial neural networks

    S. Gulania, Y. Alexeev, S. K. Gray, B. Peng, N. Govind, Quantum error mitigation and correction mediated by Yang-Baxter equation and artificial neural netw ork, ArXiv 2401.17116v1

  6. [6]

    S.W. Hu, K. Xue, M.I. Ge, Optical simulation of the Yang-Baxter equation , Physical Review A—Atomic, Molecular, and Optical Physics, 78(2008), n.2

  7. [7]

    Hyland, E.G

    D.C. Hyland, E.G. Collins, Jr., Block Kronecker Products and Block Norm Matrices in Large-S cale Systems Analysis , SIAM J. Matrix Anal. Appl. 10 (1989), 18-29

  8. [8]

    Kassel, Quantum groups , Graduate Texts in Mathematics 155 (1995), Springer Verlag, Berlin

    C. Kassel, Quantum groups , Graduate Texts in Mathematics 155 (1995), Springer Verlag, Berlin

Show all 25 references
  1. [9]

    Kauffman, S.J Lomonaco Jr., Quantum entanglement and topological entanglement , New J

    L.H. Kauffman, S.J Lomonaco Jr., Quantum entanglement and topological entanglement , New J. Phys. 4, 73, 2002

  2. [10]

    Kauffman, S.J Lomonaco Jr., Braiding Operators are Universal Quantum Gates , New J

    L.H. Kauffman, S.J Lomonaco Jr., Braiding Operators are Universal Quantum Gates , New J. Phys. 6 (2004)

  3. [11]

    Koning, H

    R.H. Koning, H. Neudecker, T. Wansbeek, Block Kronecker products and the vecb operator , Linear Algebra and it applications 149 (1991), 165-184

  4. [12]

    Lechner, U

    G. Lechner, U. Pennig, S. Wood, Yang-Baxter representations of the infinite symmetric grou p, Adv. Math 355 (2019), 1-42

  5. [13]

    Liu, Matrix results on the Khatri-Rao and Tracy-Singh products , Linear Algebra and its Appli- cations 289 (1999), 267-277

    S. Liu, Matrix results on the Khatri-Rao and Tracy-Singh products , Linear Algebra and its Appli- cations 289 (1999), 267-277

  6. [14]

    Magnus, H

    J.R. Magnus, H. Neudecker, The commutation matrix: some properties and applications , Annals of Statistics 7(1979), 381-394

  7. [15]

    Majid, Foundations of Quantum Group Theory , Cambridge University Press, 1995

    S. Majid, Foundations of Quantum Group Theory , Cambridge University Press, 1995

  8. [16]

    Maruyoshi, T

    K. Maruyoshi, T. Okuda, J. W. Pedersen, R. Suzuki, M. Yam azaki, Y. Yoshida, Conserved charges in the quantum simulation of integrable spin chains , J. Phys. A: Math. Theor. 56 (2023)

  9. [17]

    B. Peng, S. Gulania, Y. Alexeev, N. Govind, Quantum time dynamics employing the Yang-Baxter equation for circuit compression , Phys. Rev. A 106 (2022). 10 F ABIENNE CHOURAQUI

  10. [18]

    D. S. Tracy, K. G. Jinadasa, Partitioned Kronecker products of matrices and applicatio ns, Canad. J. Statist. 17 (1989), 107-120

  11. [19]

    Tracy, R.P

    D.S. Tracy, R.P. Singh, A new matrix product and its applications in partitioned mat rix differentia- tion, Statistica Neerlandica 26 (1972), 143-157

  12. [20]

    Turaev, The Yang-Baxter equation and invariants of links , Invent

    V. Turaev, The Yang-Baxter equation and invariants of links , Invent. Math, 92 (1988), 527-553

  13. [21]

    F.A. Vind, A. Foerster, I.S. Oliveira, R.S. Sarthour, D .D.O. Soares-Pinto, A.M.D. Souza, I. Roditi, Experimental realization of the Yang-Baxter Equation via N MR interferometry , Scientific reports 6 (2016), n.6

  14. [22]

    Zhang, Integrable quantum computation , Quantum Inf

    Y. Zhang, Integrable quantum computation , Quantum Inf. Process 12 (2013), 631-639

  15. [23]

    Zhang, K

    K. Zhang, K. Yu, K. Hao, V. Korepin, Optimal Realization of Yang–Baxter Gate on Quantum Computers, ArXiv 2307:16781v3

  16. [24]

    Zhang, K

    Y. Zhang, K. Zhang, J. Pang, Teleportation-based quantum computation, extended Tempe rley–Lieb diagrammatical approach and Yang–Baxter equation , Quantum Inf. Process 15(2016), 405–464

  17. [25]

    We prove that with the canonical partition of µ ⊗ µ and η ⊗ η into blocks, ( µ ⊗ η)⊗2 = ( µ ⊗ µ ) ⊠ (η ⊗ η): (µ ⊗ µ ) ⊠ (η ⊗ η) =      µ 11 µ µ 12 µ

    Appendix: Proof of Equations (3.3) and (3.4) Proof of Equation (3.3). We prove that with the canonical partition of µ ⊗ µ and η ⊗ η into blocks, ( µ ⊗ η)⊗2 = ( µ ⊗ µ ) ⊠ (η ⊗ η): (µ ⊗ µ ) ⊠ (η ⊗ η) =      µ 11 µ µ 12 µ ... µ 1d µ ... ... ... ... µ d1 µ µ d2 µ ... µ dd µ ...

Pith tools

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