Pith. sign in

REVIEW 3 major objections 3 minor 16 references

Multi-Qubit Golden Gates

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

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

Pith's one-line read Two-qubit Clifford+CS is a super-golden gate set, cutting non-Clifford cost 4.8x.

desk verdict First real multi-qubit golden/super-golden gate sets, including Clifford+CS, with a coherent automorphic proof chain—but the signature covering claim rests on an unpublished companion paper (KMSb). read the letter →

arxiv 2509.09047 v1 pith:VDZLLAR6 submitted 2025-09-10 math.NT math.RTquant-ph

Rahul Dalal , Shai Evra , Ori Parzanchevski This is my paper · ORCID
classification math.NTmath.RTquant-ph MSC 11F7011F7222E5581P68
keywords goldengatessuper-goldentwo-qubitquantumcomputationClifford+CSoptimalcoveringautomorphicdensityhypothesisendoscopicclassificationBruhat-Titsbuildings
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper constructs golden and super-golden gate sets for two- and three-qubit unitary groups, extending earlier one-qubit constructions. Its central theorem is that the controlled-S gate together with the two-qubit Clifford group is a super-golden gate set for PU(4): words of length l cover the group up to an epsilon_l = (log|S^(l)|)^c/|S^(l)| volume, the number of words grows exponentially, shortest words can be found efficiently, and a heuristic algorithm approximates any unitary. If correct, arbitrary two-qubit unitaries are approximable with CS-count within a polylog factor of the optimal covering rate, matching the known worst-case lower bound and using 4.8x fewer non-Clifford gates asymptotically than Clifford+T; another explicit example heuristically saves about 10x on T-type gates. The construction works through golden adelic subgroups of definite arithmetic unitary groups, with optimal covering supplied by a weight-aspect density hypothesis for automorphic representations proven via endoscopic classification. The paper flags that both the density hypothesis and its applications depend on an unpublished weighted twisted fundamental lemma and a companion reference that is not yet publicly available.

What carries the argument

The load-bearing object is the golden adelic subgroup: a finite-index subgroup K' of the integral points of a definite unitary group G satisfying G(A)=G(F)G_infinity K' and G(F) intersection K' = {1} (or the weaker 'almost' versions). This class-number-one structure makes the p-arithmetic subgroup Lambda_p act simply transitively on the vertices (or chosen edges) of the Bruhat-Tits building of G at p, so the gates can be taken as the building's nearest neighbors measured by a modified Cartan norm and words of length l are exactly points at distance l. Growth, navigation, and approximation follow from this building picture together with a higher-dimensional version of the efficient one-qubit

What would settle it

Check the unpublished companion reference for the weighted twisted fundamental lemma: if that lemma fails, or if an explicit automorphic representation of a definite U(4) with regular integral infinitesimal character is found whose local matrix-coefficient decay at a prime violates the bound of Theorem 6.4.2, the density hypothesis collapses and with it the optimal covering theorem. Concretely, one could compute the covering radius of the Clifford+CS set at increasing lengths and look for a missed ball of volume larger than (log|S^(l)|)^c/|S^(l)|.

Watch

Extended reading notes

Core claim

On the paper's own terms, the discovery is that optimal gate sets for multi-qubit computation can be built from arithmetic groups with the same 'golden' property that made one-qubit gate sets work. Specifically, CS plus the two-qubit Clifford group is super-golden in PU(4): it has optimal covering rate up to polylog, exponential growth, navigation, and heuristic approximation, and the same template yields a PU(4) set whose added gate generates PGSp4(F3) with a heuristic 10x T-gate saving, and a PU(8) golden set for three qubits. The optimal covering bound is a theorem conditional on the paper's density hypothesis, which is argued through the endoscopic classification of automorphic represent

Load-bearing premise

The optimal covering property, and with it the asymptotic 4.8x/10x gate-count savings, rests on the density hypothesis, whose proof depends on an unpublished weighted twisted fundamental lemma and a companion reference that is not yet publicly available; without that input, the remaining properties still hold but the covering claim is unproven.

Editorial extensions

If this is right

  • Every two-qubit unitary can be approximated to accuracy epsilon by a product of CS gates with length O(log(1/epsilon)) up to a polylog factor, matching the worst-case lower bound.
  • The Clifford+CS set uses asymptotically 4.8x fewer non-Clifford gates than Clifford+T; the PGSp4(F3) example gives a heuristic ~10x saving.
  • The same arithmetic-group construction yields golden gate sets on PU(8), giving three-qubit gate sets with optimal covering.
  • Gate sets come with a polynomial-time navigation algorithm that finds shortest words from the Cartan decomposition, and with a heuristic approximation algorithm valid in higher dimension.
  • Any finite group plus extra finite-order element arising from a golden or super-golden adelic group inherits the same optimal covering, so the framework applies to other fault-tolerance-friendly gates at the third level of the Clifford hierarchy.

Reading between the lines

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

  • Once the referenced companion proof is public, the asymptotic savings become unconditional; until then the 4.8x/10x constants should be read as conditional on the density hypothesis.
  • The construction suggests a general recipe: search class-number-one definite unitary groups for special or edge stabilizers; each gives a candidate super-golden set with growth base determined by the building's geometry, and the main bottleneck for new examples is the automorphic density bound, not the building theory.
  • A practical testable extension is to optimize the approximation algorithm's constant factors; the paper itself notes these are far from optimal, so the theoretical 4.8x/10x savings may or may not survive in actual circuit synthesis.
  • The framework likely transfers to other Clifford-hierarchy gates or cyclotomic gate sets whenever the associated arithmetic group has class number one; the examples suggest lattices related to the E8 lattice in Q(sqrt(-3)) and Q(i) are a rich source of such sets.
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 / 3 minor

Summary. This paper extends the golden/super-golden gate constructions of Sarnak and Parzanchevski from PU(2) and PU(3) to the multi-qubit cases PU(4) and PU(8). The authors define arithmetic 'golden adelic subgroups', give several explicit constructions over Q(√-3), Q(i), Q(√-7), and Q(√-2), and in particular show that the 2-qubit Clifford group together with the CS gate is a super-golden gate set. The optimal covering property is derived from a Sarnak-Xue density hypothesis in the weight aspect, proved via the endoscopic classification of automorphic representations for definite unitary groups. The paper claims an asymptotic 4.8x reduction in non-Clifford gates over Clifford+T and a 10x reduction for another example. The proof is explicitly conditional on the unpublished companion 'KMSb' of [KMSW14] for inner forms, and it also relies on several asserted finite computer checks that are not accompanied by code or verification data.

Significance. If the full proof chain is eventually completed, this would be a significant step: it provides the first optimal multi-qubit golden gate sets, matches the worst-case lower bound of [GRT21], and demonstrates a nontrivial use of modern Langlands machinery in quantum computation. The paper is unusually transparent about its external dependencies, and the structural framework separating growth, navigation, approximation, and covering is useful. However, the signature property—optimal covering—is gated on an unpublished inner-form endoscopic classification, and several load-bearing numerical checks are asserted without reproducibility. For these reasons the central theorems should presently be regarded as conditional, and the manuscript requires substantive revision before the claims can be accepted as stated.

major comments (3)
  1. [Conditionality paragraph, §1.2, Theorems 1.2.3/1.2.5, Theorem 1.3.2, Theorem 7.1.1, Theorem 5.2.2] The optimal covering property, and hence the 4.8x/10x asymptotic claims, rests on Theorem 1.3.2, whose proof in §§5-7 imports the endoscopic classification of [KMSW14] for non-quasisplit inner forms. The paper's own Conditionality paragraph states that [KMSW14] depends on the unpublished weighted twisted fundamental lemma and that technical details are pushed to the unpublished companion 'KMSb'. Since the definite unitary groups used in Theorems 1.2.3-1.2.5 are inner forms, the full force of this input is invoked. The abstract and theorem statements nevertheless present the results as unconditional. This is a load-bearing external dependency, not a presentation issue: if KMSb is unavailable or incorrect, the density hypothesis, and with it the optimal covering property, is unproven. The paper should either supply the missing input, or explicitly restate the affected theorems as condition
  2. [Propositions 4.5.4, 4.5.5, 4.5.6, 4.5.10, 4.5.11, 4.5.13, 4.5.14; proof of Theorem 7.3.1; Corollary 7.3.4] Several load-bearing claims are justified only by 'computer check' without code, scripts, or independent verification data. In particular, the class-number-one mass computations (e.g., |G(Z)| = 155520 in Proposition 4.5.4, |G(Z) ∩ K'| values in Propositions 4.5.5-4.5.14), the group-intersection checks, and the finite inequalities in the proof of Theorem 7.3.1 ('By a computer check ...') and Corollary 7.3.4 are essential to the explicit gate-set constructions and to the density bound. A referee cannot certify these claims from the manuscript alone. The authors should provide executable code or detailed certifiable verification, or at minimum specify the exact computations in a way that permits independent replication.
  3. [Theorem 7.3.1 and Corollary 7.3.2, with Conjecture 6.3.4] The density hypothesis Corollary 7.3.2 is stated as applying in a list of cases that includes 'Conjecture 6.3.4 holds for Arthur-type representations of G_v with a K'_v-fixed vector.' For n = 4 this is resolved by Corollary 6.3.6, and for n = 8 by the computer-assisted Corollary 7.3.4. However, the organization makes the logical dependence hard to track: Theorem 7.3.1 appears to prove the exponent inequality for all shapes, while the local exponent bound needed for non-split v is conditional on Conjecture 6.3.4. The authors should make the final unconditional range of validity explicit in the statement of Corollary 7.3.2, since as written the bullet list can be read as including an unproved conjecture as a hypothesis rather than as a resolved case.
minor comments (3)
  1. [Theorem 1.2.3 and Notation 1.5.2] The symbol B is used both for a matrix in Theorem 1.2.3 and for the Bruhat-Tits building throughout the paper (per Notation 1.5.2). This is confusing; consider renaming the matrix.
  2. [§4.6 and Definition 1.2.1] The comparison in §4.6 writes 'B(A, ε^{15})' while also speaking of 'within distance ε'. Definition 1.2.1 defines B(x,ε) as the ball of volume ε, so the relation between volume ε^15 and metric distance ε should be stated explicitly to avoid ambiguity.
  3. [Table 4.1] The table refers to added gates such as T'_G, T_E,2, T_E,3 without displaying their definitions in the table itself; the reader must return to the corresponding propositions. A pointer is fine, but the cost model used for 'R' and 'covering efficiency' should be stated once in the caption or preceding text.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the covering result is derived from an external automorphic input (endoscopic classification) and a same-author counting bound, not from the target claim.

full rationale

The paper's central derivation is not circular. Golden gate sets are defined by Covering, Growth, Navigation, and Approximation (Def. 1.2.1), but the constructed sets S_p are defined from arithmetic groups and Cartan norms (Def. 4.2.1/4.2.4), not from the covering property itself. Growth follows from root-system counting (Cor. 4.3.8), navigation from the Cartan decomposition word algorithm (Thm. 4.4.1(2)), and approximation from the Ross-Selinger heuristic (Thm. 4.4.1(3)). The signature property, optimal covering, is proven in Prop. 8.3.3 from the density hypothesis (Thm. 1.3.2) via Hecke-operator bounds (Cor. 8.2.12) and the ball-family estimates (Thm. 7.2.5). The density hypothesis is proven in §§5-7 using the endoscopic classification of [Mok15, KMSW14] and the input bound of Thm. 7.1.1, quoted from [DGG24] with an overlapping first author. This same-author citation is load-bearing but not circular: [DGG24] is a separate, parameter-free counting result for automorphic representations, and the paper gives a proof sketch reducing it to the Arthur trace formula and [ST16]; it is not equivalent to the covering claim. There are no fitted parameters called predictions: the growth exponents and covering constants arise from root data and structural bounds, and the 4.8x/10x comparisons are arithmetic consequences of these rates. The paper's own Conditionality paragraph explicitly flags the dependence of [KMSW14] on the unpublished weighted twisted fundamental lemma and the unpublished companion 'KMSb'; this is an external validity risk, not a circularity, since the paper does not assume the covering theorem to prove it. No renaming, ansatz-smuggling, or imported uniqueness theorem from the authors is used to force the conclusion. The proof chain is therefore self-contained relative to its stated external inputs.

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

The central construction is parameter-free: the gate sets are defined by congruence conditions and Hermitian forms, and all constants (growth exponents M, covering exponents) are computed from root-system data, not fitted. The heavy background is the Langlands machinery: the proof leans on the endoscopic classification of [Mok15]/[KMSW14] (the latter with a non-public companion 'KMSb'), the (now-resolved per [AGI+24]) weighted twisted fundamental lemma, Conjecture 6.3.4 for parts of the framework (proven in-paper for n=4), and the heuristic Ross-Selinger approximation algorithm, which is part of the paper's own definition of golden gates. Several finite but load-bearing computations are asserted as computer checks without shipped code.

assumptions (6)
  • domain assumption Endoscopic classification for quasi-split unitary groups [Mok15]
    Theorem 5.2.2(1) and Section 5.2; underpins Theorem 1.3.2 and hence the covering property.
  • domain assumption Endoscopic classification for inner forms (extended pure inner forms) [KMSW14], including unpublished companion 'KMSb'
    The definite unitary groups U^{E,H}_n are inner forms; the paper's Conditionality paragraph states [KMSW14] depends on 'KMSb', which is not yet publicly available.
  • domain assumption Weighted twisted fundamental lemma (unpublished at time of writing; paper cites [AGI+24] as resolving the dependence on the unitary analogues of [Art13] A25-27)
    Section 1.3 and the Conditionality paragraph: both [Mok15] and [KMSW14] depend on it.
  • domain assumption Arthur-packet exponent comparison Conjecture 6.3.4 (L_pi_v <= L_psi_v), a special case of the closure-order conjecture; proven in-paper for unramified pi_v and for n=4 (Cor 6.3.6), computer-verified for n=8 (Cor 7.3.4)
    Theorem 6.4.2 uses it to bound matrix-coefficient decay by shape; the framework in Section 6.4 depends on it beyond the proven cases.
  • domain assumption Heuristic Ross-Selinger approximation algorithm ('Theorem' 4.4.4)
    The Approximation property (Def 1.2.1(4)) is satisfied via this heuristic, randomized algorithm; the paper labels it heuristic in the statement itself.
  • ad hoc to paper Finite computational checks asserted without code (class-number-one mass computations and group intersections)
    Propositions 4.5.4-4.5.15 and the proof of Theorem 7.3.1 rely on computer checks (e.g., |G(Z)|=155520, |G(Z) cap K'_s|=1728, RG(Q) >= SG(Q)). These are asserted in the text with no scripts or certificates.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Multi-Qubit Golden Gates." pith.science (2026). https://pith.science/paper/VDZLLAR6

@misc{pith2026250909047,
  author       = {Pith},
  title        = {Pith review of: Multi-Qubit Golden Gates},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/VDZLLAR6}},
  note         = {Machine review of arXiv:2509.09047}
}
abstract

Our goal in this paper is to construct optimal topological generators for compact unitary Lie groups, extending the work of a letter of Sarnak and arXiv:1704.02106 on golden and super-golden gates to higher dimensions. To do so we consider a variant of the Sarnak--Xue Density Hypotheses in the weight aspect for definite projective unitary groups and prove it using the endoscopic classification of automorphic representations. Our main motivation is to construct efficient multi-qubit universal gate sets for quantum computers. For example, we find a set of universal gates that, for a given accuracy, can heuristically approximate arbitrary unitary operations on 2 qubits with $\approx$10 times fewer ``expensive'' $T$-type gates than the standard Clifford+$T$ set. Our framework also covers the 2-qubit Clifford+CS gate set, well-known for being particularly friendly to fault-tolerant implementation. We thereby prove tight upper bounds on the required CS count for approximations (specifically, $4.8$x fewer non-Clifford gates than Clifford+$T$).

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

16 extracted references · 6 linked inside Pith

  1. [1]

    Acharya, D

    [AAAB+24] R. Acharya, D. A Abanin, L. Aghababaie-Beni, I. Aleiner, T. I Andersen, M. Ansmann, F. Arute, K. Arya, A. Asfaw, N. Astrakhantsev, et al., Quantum error correction below the surface code threshold, Nature (2024). [ABO97] D. Aharonov and M. Ben-Or, Fault-tolerant quantum computation with constant error , Pro- ceedings of the twenty-ninth annual a...

    2024

  2. [2]

    1, 233–244

    = 9, pg = q = 0, American Journal of Mathematics 101 (1979), no. 1, 233–244. [MW89] C. Mœglin and J. L. Waldspurger, Le spectre r´ esiduel deGL(n), Annales scientifiques de l’´ ecole normale sup´ erieure, 1989, pp. 605–674. [NC11] M. A. Nielsen and I. L. Chuang, Quantum computation and quantum information , 10th ed., Cambridge University Press, New York, NY, USA,

    1979

  3. [5]

    Forest, D

    [FGKM15] S. Forest, D. Gosset, V. Kliuchnikov, and D. McKinnon, Exact synthesis of single-qubit unitaries over clifford-cyclotomic gate sets , Journal of Mathematical Physics 56 (2015), no. 8, 082201. [Fla79] D. Flath, Decomposition of representations into tensor products , Automorphic forms, represen- tations and L-functions, 1979, pp. 179–183. [FND+20] ...

    2015

  4. [16]

    [Sar90] , Diophantine problems and linear groups , ICM Kyoto II (1990), 459–471

    https://publications.ias.edu/sarnak/paper/2637. [Sar90] , Diophantine problems and linear groups , ICM Kyoto II (1990), 459–471. [Shi11] S. W. Shin, Galois representations arising from some compact Shimura varieties , Annals of Mathematics 173 (2011), no. 3, 1645–1741. [SST16] P. Sarnak, S. W. Shin, and N. Templier, Families of L-functions and their symme...

    1990

  5. [103]

    generalized Ramanujan conjecture

    [GS13] B. Giles and P. Selinger, Exact synthesis of multiqubit clifford+T circuits , Physical Review A 87 (2013), no. 3, 032332. [HLLZ25] A. Hazeltine, B. Liu, C.-H. Lo, and Q. Zhang, The closure ordering conjecture on local arthur packets of classical groups , Journal f¨ ur die reine und angewandte Mathematik (Crelles Journal) (2025). 78 [HPS79] R. Howe ...

    2013

  6. [370]

    Parzanchevski and P

    [PS18] O. Parzanchevski and P. Sarnak, Super-Golden-Gates for P U(2), Advances in Mathematics 327 (2018), 869 –901. Special volume honoring David Kazhdan. [Ric16] T. Richarz, On the iwahori weyl group , Bulletin de la Soci´ et´ e Math´ ematique de France144 (2016), no. 1, 117–124. [Ros78] W. Rossmann, Kirillov’s character formula for reductive lie groups ...

    2018

  7. [2001]

    Ingalls, B

    [IJK+21] C. Ingalls, B. W Jordan, A. Keeton, A. Logan, and Y. Zaytman, The clifford-cyclotomic group and euler–poincar´ e characteristics, Canadian Mathematical Bulletin 64 (2021), no. 3, 651–666. [Jac62] R. Jacobowitz, Hermitian forms over local fields , American Journal of Mathematics 84 (1962), no. 3, 441–465. [Kam16] A. Kamber, Lp-expander complexes, ...

    arXiv 2021

  8. [2004]

    Kirschmer, Definite quadratic and hermitian forms with small class number , Habilitation, R WTH Aachen University (2016)

    [Kir16] M. Kirschmer, Definite quadratic and hermitian forms with small class number , Habilitation, R WTH Aachen University (2016). [KMM13] V. Kliuchnikov, D. Maslov, and M. Mosca, Fast and efficient exact synthesis of single-qubit unitaries generated by clifford and T gates , Quantum Information & Computation 13 (2013), no. 7-8, 607–630. [KMSW14] T. Kal...

    arXiv 2016

Show all 16 references
  1. [2006]

    Lubetzky, A

    [LLP19] E. Lubetzky, A. Lubotzky, and O. Parzanchevski, Random walks on Ramanujan complexes and digraphs, Journal of the European Mathematical Society, to appear (2019). arXiv:1702.05452. [LM16] E. Lapid and A. M ´ ınguez,On parabolic induction on inner forms of the general li...

    2019 arXiv

  2. [2011]

    N Nair and D

    [NP21] A. N Nair and D. Prasad, Cohomological representations for real reductive groups, Journal of the London Mathematical Society 104 (2021), no. 4, 1515–1571. [Par19] O. Parzanchevski, Ramanujan graphs and digraphs , Analysis and geometry on graphs and manifolds (LMS Lectur...

    2021

  3. [2013]

    [Art89] , The L2-Lefschetz numbers of Hecke operators , Invent

    Orthogonal and symplectic groups. [Art89] , The L2-Lefschetz numbers of Hecke operators , Invent. Math. 97 (1989), no. 2, 257–290. [Ato23] H. Atobe, The set of local A-packets containing a given representation , Journal f ur die reine und angewandte Mathematik (Crelles Journal...

    1989 arXiv

  4. [2015]

    Marshall and S

    [MS19] S. Marshall and S. W. Shin, Endoscopy and cohomology in a tower of congruence manifolds for , Forum of mathematics, sigma, 2019, pp. e19. [MSG12] A. Mohammadi and A. Salehi Golsefidy, Discrete subgroups acting transitively on vertices of a Bruhat–Tits building , Duke Ma...

    2019

  5. [2016]

    Kaletha and O

    [KT20] T. Kaletha and O. Taıbi, The local langlands conjecture, Preprint (2020). [KT23] E. Kubischta and I. Teixeira, Family of quantum codes with exotic transversal gates , Physical Review Letters 131 (2023), no. 24, 240601. [KT24] , Classification of the subgroups of the two...

    2020 arXiv

  6. [2019]

    [PRTC20] T

    arXiv:1804.08028. [PRTC20] T. Pllaha, N. Rengaswamy, O. Tirkkonen, and R. Calderbank, Un-weyl-ing the clifford hierarchy, Quantum 4 (2020),

    2020 arXiv

  7. [2022]

    Clozel, Purity reigns supreme , International Mathematics Research Notices 2013 (2013), no

    [Clo13] L. Clozel, Purity reigns supreme , International Mathematics Research Notices 2013 (2013), no. 2, 328–346. [Del74] P. Deligne, La conjecture de Weil. I , Publications Math´ ematiques de l’Institut des Hautes ´Etudes Scientifiques 43 (1974), no. 1, 273–307. [DGG23] R. D...

    2013

  8. [2024]

    Eichler, Quatern¨ are quadratische formen und die riemannsche vermutung f¨ ur die kon- gruenzzetafunktion, Archiv der Mathematik 5 (1954), no

    [Eic54] M. Eichler, Quatern¨ are quadratische formen und die riemannsche vermutung f¨ ur die kon- gruenzzetafunktion, Archiv der Mathematik 5 (1954), no. 4, 355–366. [EK09] B. Eastin and E. Knill, Restrictions on transversal encoded quantum gate sets , Physical review letters ...

    1954

Pith tools

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