pith. sign in

arxiv: 2605.26983 · v1 · pith:L36HUU25new · submitted 2026-05-26 · 🪐 quant-ph

On Clifford hierarchy testing and near-extremizers of noncommutative uniformity norms

Zongbo (Bob) Bao , Jop Bri\"et , Davi Castro-Silva , Philippe van Dordrecht , Jonas Helsen This is my paper

Pith reviewed 2026-06-29 16:43 UTC · model grok-4.3

classification 🪐 quant-ph
keywords Clifford hierarchyquantum testinguniformity normsnoncommutative normsGowers normsunitary operatorsquantum circuits
0
0 comments X

The pith

Characterization of near-extremizers for the fourth noncommutative uniformity norm enables an efficient tester for the third Clifford hierarchy level.

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

The paper addresses the open question of the complexity of a candidate tester, proposed by Bu, Gu, and Jaffe, for determining whether an unknown unitary is close to a given level of the Clifford hierarchy. The tester relies on noncommutative analogues of Gowers uniformity norms, but its analysis requires a robust description of the near-extremizers of those norms. The work supplies this characterization for the fourth norm. The result immediately yields an efficient tester for closeness to the third level of the hierarchy. The authors additionally outline remaining barriers to extending the method to higher levels.

Core claim

The paper establishes a characterization of the near-extremizers of the fourth noncommutative uniformity norm. As a direct consequence, it obtains an efficient tester for determining whether an unknown unitary is close to the third level of the Clifford hierarchy, following the framework proposed by Bu, Gu, and Jaffe.

What carries the argument

Robust characterization of near-extremizers of the fourth noncommutative uniformity norm, which completes the analysis of the proposed tester for the third Clifford level.

Load-bearing premise

The proposed tester's correctness depends on a robust characterization of the near-extremizers of the noncommutative uniformity norms.

What would settle it

A unitary operator that nearly maximizes the fourth noncommutative uniformity norm yet lies far from the third Clifford level would disprove the characterization and invalidate the tester.

read the original abstract

We consider the problem of testing whether an unknown unitary is close to a specified level of the Clifford hierarchy. Bu, Gu, and Jaffe proposed a candidate tester for this task based on a connection with noncommutative analogues of the Gowers uniformity norms. The complexity of this tester -- whose analysis depends on a robust characterization of the near-extremizers of these norms -- was left open. We establish such a characterization for the fourth noncommutative uniformity norm and, as a consequence, obtain an efficient tester for the third level of the Clifford hierarchy. We further discuss possible routes toward resolving the problem of testing for all higher levels, highlighting the main barriers that remain.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The manuscript resolves an open question from Bu, Gu, and Jaffe by establishing a robust characterization of the near-extremizers of the fourth noncommutative uniformity norm; as a direct consequence it derives an efficient tester for membership in the third level of the Clifford hierarchy and outlines barriers for higher levels.

Significance. If the characterization is correct, the result supplies the missing analytic ingredient needed to turn the Bu-Gu-Jaffe candidate tester into a polynomial-time procedure for the third Clifford level, thereby advancing quantum property testing beyond the second level. The explicit construction of the characterization itself constitutes the primary technical contribution and may serve as a template for higher norms.

minor comments (3)
  1. [Introduction / Main Theorem] The statement of the main characterization theorem (presumably Theorem 1 or its analogue) would benefit from an explicit list of the quantitative parameters (distance, dimension, etc.) that appear in the robustness bound.
  2. [Preliminaries] Notation for the noncommutative uniformity norms U^k is introduced without a self-contained reminder of the recursive definition; a one-sentence recap would aid readers.
  3. [Discussion] Figure 1 (if present) comparing the new tester’s query complexity with prior work should include error bars or explicit constants rather than asymptotic notation alone.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their thorough reading and positive recommendation to accept. The summary accurately captures the main results and their significance for quantum property testing.

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The paper resolves an open problem left by Bu, Gu, and Jaffe on characterizing near-extremizers of the fourth noncommutative uniformity norm, from which the tester for the third Clifford hierarchy level follows. The abstract and description present this as independent new work with no self-citations, fitted inputs renamed as predictions, or definitional loops. The derivation chain is self-contained against the external benchmark of the cited open problem.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review supplies no concrete free parameters, axioms, or invented entities; the work rests on the prior connection between Clifford hierarchy testing and noncommutative uniformity norms established by Bu, Gu, and Jaffe.

pith-pipeline@v0.9.1-grok · 5653 in / 993 out tokens · 36170 ms · 2026-06-29T16:43:17.093244+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

18 extracted references · 18 canonical work pages · 3 internal anchors

  1. [1]

    Learning stabilizer structure of quantum states.arXiv preprint arXiv:2510.05890,

    [AD25a] Srinivasan Arunachalam and Arkopal Dutt. Learning stabilizer structure of quantum states.arXiv preprint arXiv:2510.05890,

    work page arXiv

  2. [2]

    14 [And24] Jonas T Anderson

    Association for Computing Machinery.doi:10.1145/3717823.3718277. 14 [And24] Jonas T Anderson. On groups in the qubit Clifford hierarchy.Quantum, 8:1370,

    work page doi:10.1145/3717823.3718277

  3. [3]

    [BGJ25] Kaifeng Bu, Weichen Gu, and Arthur Jaffe

    doi:10.22331/q-2024-06-13-1370. [BGJ25] Kaifeng Bu, Weichen Gu, and Arthur Jaffe. Quantum higher-order Fourier anal- ysis and the Clifford hierarchy.Proceedings of the National Academy of Sciences, 122(45):e2515667122, 2025.doi:10.1073/pnas.2515667122. [BK13] Sergey Bravyi and Robert K¨ onig. Classification of topologically protected gates for local stabi...

    work page doi:10.22331/q-2024-06-13-1370 2024

  4. [4]

    doi:10.1145/3717823.3718201

    Association for Computing Machinery. doi:10.1145/3717823.3718201. [CdS24] Imin Chen and Nadish de Silva. Characterising semi-Clifford gates using algebraic sets.Communications in Mathematical Physics, 405(9):201, 2024.doi:10.1007/ s00220-024-05050-2. [CGK17] Shawn X Cui, Daniel Gottesman, and Anirudh Krishna. Diagonal gates in the Clif- ford hierarchy.Phy...

    work page doi:10.1145/3717823.3718201 2024

  5. [5]

    Cambridge University Press, Cambridge, 2018.doi:10.1017/9781316856383

    [CSST18] Tullio Ceccherini-Silberstein, Fabio Scarabotti, and Filippo Tolli.Discrete harmonic analysis, volume 172 ofCambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 2018.doi:10.1017/9781316856383. [dS21] Nadish de Silva. Efficient quantum gate teleportation in higher dimensions.Proceedings of the Royal Society A: Mathemat...

    work page doi:10.1017/9781316856383 2018

  6. [6]

    A quantitative inverse theorem for the $U^4$ norm over finite fields

    [GIKL24] Sabee Grewal, Vishnu Iyer, William Kretschmer, and Daniel Liang. Improved stabi- lizer estimation via Bell difference sampling. InProceedings of the 56th Annual ACM Symposium on Theory of Computing, pages 1352–1363, 2024.doi:10.1145/3618260. 3649738. [GM17] W.T. Gowers and Luka Mili´ cevi´ c. A quantitative inverse theorem for theU 4 norm over fi...

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1145/3618260 2024

  7. [7]

    15 [GNW21] David Gross, Sepehr Nezami, and Michael Walter. Schur–Weyl duality for the Clifford group with applications: Property testing, a robust Hudson theorem, and de Finetti representations.Communications in Mathematical Physics, 385(3):1325–1393, June 2021.doi:10.1007/s00220-021-04118-7. [Gow98] William Timothy Gowers. A new proof of Szemer´ edi’s th...

    work page doi:10.1007/s00220-021-04118-7 2021

  8. [8]

    [Gow01] W

    doi:10.1007/s000390050065. [Gow01] W. T. Gowers. A new proof of Szemer´ edi’s theorem.Geometric & Functional Analysis GAFA, 11(3):465–588, Aug 2001.doi:10.1007/s00039-001-0332-9. [Gre07] Ben Green. Montr´ eal notes on quadratic Fourier analysis. InAdditive combinatorics, volume 43 ofCRM Proc. Lecture Notes, pages 69–102. Amer. Math. Soc., Providence, RI, ...

    work page doi:10.1007/s000390050065 2001

  9. [9]

    Higher-order Fourier analysis and applications.Foundations and Trends®in Theoretical Computer Science, 13(4):247– 448, 2019.doi:10.1561/0400000064

    [HHL19] Hamed Hatami, Pooya Hatami, and Shachar Lovett. Higher-order Fourier analysis and applications.Foundations and Trends®in Theoretical Computer Science, 13(4):247– 448, 2019.doi:10.1561/0400000064. [HLC25] Jingzhen Hu, Qingzhong Liang, and Robert Calderbank. Climbing the diagonal Clifford hierarchy.Quantum, 2(4), 2025.doi:10.20935/acadquant7957. [HR...

    work page doi:10.1561/0400000064 2019

  10. [10]

    Tolerant testing of stabilizer states with mixed state inputs.arXiv preprint arXiv:2411.08765,

    [IL24] Vishnu Iyer and Daniel Liang. Tolerant testing of stabilizer states with mixed state inputs.arXiv preprint arXiv:2411.08765,

    work page arXiv

  11. [11]

    Clifford Hierarchy Stabilizer Codes: Transversal Non-Clifford Gates and Magic

    doi:10.1017/S0305004126101911. [KZH25] Ryohei Kobayashi, Guanyu Zhu, and Po-Shen Hsin. Clifford hierarchy stabilizer codes: Transversal non-Clifford gates and magic.arXiv preprint arXiv:2511.02900,

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1017/s0305004126101911

  12. [12]

    Learning and testing algorithms for the Clifford group.Physical Review A—Atomic, Molecular, and Optical Physics, 80(5):052314, 2009.doi:10

    [Low09] Richard A Low. Learning and testing algorithms for the Clifford group.Physical Review A—Atomic, Molecular, and Optical Physics, 80(5):052314, 2009.doi:10. 1103/physreva.80.052314. [Mil24] Luka Mili´ cevi´ c. Quasipolynomial inverse theorem for theU 4(Fn p) norm.arXiv preprint arXiv:2410.08966,

    work page arXiv 2009

  13. [13]

    Universal quan- tum computation with group surface codes.arXiv preprint arXiv:2603.05502,

    16 [MMTE26] Naren Manjunath, Vieri Mattei, Apoorv Tiwari, and Tyler D Ellison. Universal quan- tum computation with group surface codes.arXiv preprint arXiv:2603.05502,

    work page arXiv

  14. [14]

    [PRTC20] Tefjol Pllaha, Narayanan Rengaswamy, Olav Tirkkonen, and Robert Calderbank

    Association for Computing Machinery.doi:10.1145/3717823.3718228. [PRTC20] Tefjol Pllaha, Narayanan Rengaswamy, Olav Tirkkonen, and Robert Calderbank. Un-weyl-ing the Clifford hierarchy.Quantum, 4:370, 2020.doi:10.22331/ q-2020-12-11-370. [RCP19] Narayanan Rengaswamy, Robert Calderbank, and Henry D Pfister. Unifying the Clif- ford hierarchy via symmetric m...

    work page doi:10.1145/3717823.3718228 2020

  15. [15]

    [Tao07] Terence Tao

    Association for Computing Machinery.doi:10.1145/ 1250790.1250864. [Tao07] Terence Tao. Structure and randomness in combinatorics. In48th Annual IEEE Symposium on Foundations of Computer Science (FOCS’07), pages 3–15. IEEE,

    work page arXiv

  16. [16]

    Constant-Depth Clifford-Hierarchy Gates via Non-Abelian Surface Codes

    [TZ10] Terence Tao and Tamar Ziegler. The inverse conjecture for the Gowers norm over finite fields via the correspondence principle.Anal. PDE, 3(1):1–20, 2010.doi:10.2140/ apde.2010.3.1. [Wan11] Guoming Wang. Property testing of unitary operators.Physical Review A, 84(5):052328, 2011.doi:10.1103/PhysRevA.84.052328. [WSN25] Alison Warman and Sakura Schafe...

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1103/physreva.84.052328 2010

  17. [17]

    Controlled jump in the Clifford hierarchy.arXiv preprint arXiv:2602.22201,

    [XW26] Yichen Xu and Xiao Wang. Controlled jump in the Clifford hierarchy.arXiv preprint arXiv:2602.22201,

    work page arXiv

  18. [18]

    [ZCC08] Bei Zeng, Xie Chen, and Isaac L Chuang. Semi-Clifford operations, structure of Ck hierarchy, and gate complexity for fault-tolerant quantum computation.Physi- cal Review A—Atomic, Molecular, and Optical Physics, 77(4):042313, 2008.doi: 10.1103/physreva.77.042313. [ZLC00] Xinlan Zhou, Debbie W Leung, and Isaac L Chuang. Methodology for quantum logi...

    work page doi:10.1103/physreva.77.042313 2008