Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2605.26983

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

Zongbo, Bao, Jop Briët, Davi Castro-Silva, Philippe van Dordrecht, Jonas Helsen

quant-phSubmitted May 26, 2026• Announced May 27, 2026• 4 citations
arXivHTMLPDF

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.

Comments
17 pages, 99% inverse theorem for Gowers norm for unitaries. Comments welcome!

Related papers

Norm properties of quantum uniformity measures

Berke Ünal

We give a complete classification of the norm properties of quantum uniformity measures, introduced by Bu, Gu, and Jaffe to analytically characterize the Clifford hierarchy. Resolving an open question they posed, we show that quantum uniformity measures define norms precisely for $k=2,3,4$. In particular, we establish the triangle inequality for $k=4$, whereas for every $k\geq5$ it fails in some dimension. The higher-order result is proved using the structure theory of norming systems of linear equations over finite fields. We also study the geometry of quantum uniformity measures, establishing explicit bounds on the modulus of convexity whenever they define norms. Finally, we give a complete classification of the norm properties of matrix-valued Gowers uniformity functionals, showing that only $k=2$ defines a norm.

math-phCross-listedarXiv:2610.17454•Oct 14, 2026•0 citations

Clifford Testing: Algorithms and Lower Bounds

Marcel Hinsche, Zongbo Bao, Philippe van Dordrecht +3 more

We consider the problem of Clifford testing, which asks whether a black-box n-qubit unitary is a Clifford unitary or at least ε-far from every Clifford unitary. We give the first 4-query Clifford tester, which decides this problem with probability poly(ε). This contrasts with the minimum of 6 copies required for the closely-related task of stabilizer testing. We show that our tester is tolerant, by adapting techniques from tolerant stabilizer testing to our setting. In doing so, we settle in the positive a conjecture of Bu, Gu and Jaffe, by proving a polynomial inverse theorem for a non-commutative Gowers 3-uniformity norm. We also consider the restricted setting of single-copy access, where we give an O(n)-query Clifford tester that requires no auxiliary memory qubits or adaptivity. We complement this with a lower bound, proving that any such, potentially adaptive, single-copy algorithm needs at least Ω(n1/4) queries. To obtain our results, we leverage the structure of the commutant of the Clifford group, obtaining several technical statements that may be of independent interest.

arXiv:2510.07164•ACM Symposium on Theory of Computing (STOC)•Jun 9, 2026•5 citations

A Cohomological Characterization of the Clifford Hierarchy

Junaid Aftab

The Clifford hierarchy plays a central role in fault-tolerant quantum computation, but its higher levels remain only partially understood. Recent work on quantum higher order Fourier analysis characterizes membership in the Clifford hierarchy using quantum derivatives, but does not provide an explicit description of the individual levels. In this work, we address this problem by showing that the collection of quantum derivatives of a unitary operator forms a non-abelian \(1\)-cocycle, and conversely that every such \(1\)-cocycle arises from a unitary operator. This yields a recursive cohomological characterization of the Clifford hierarchy. We then specialize this framework to the third level and decompose the cocycle data into symplectic, affine, and phase components, each admitting a cohomological interpretation. As applications, we give a new proof that every two-qudit gate in the third level of the Clifford hierarchy is semi-Clifford, and prove for the first time that every three-qudit gate in the third level is semi-Clifford.

math-phCross-listedarXiv:2610.06699•Oct 6, 2026•0 citations

The Weyl-orbit embedding and a representation-theoretic characterization of the Clifford hierarchy

Asgar Jamneshan, Berke Ünal

Bu, Gu, and Jaffe introduced the quantum uniformity measures to analytically characterize the Clifford hierarchy. We prove that the quantum uniformity measures are the pullbacks of the matrix-valued uniformity functionals of Gowers and Hatami under the map $U\mapsto(a\mapsto W_aUW_a^*)$, which we call the Weyl-orbit embedding. We study the structure of the Weyl-orbit embedding, and among other results, establish a canonical decomposition of the ambient matrix-valued uniformity space into uniformity preserving twisted copies of the quantum uniformity space. The Weyl-orbit embedding identifies the Clifford hierarchy with Leibman polynomial maps. This identification yields a representation theoretic characterization of the Clifford hierarchy in terms of unitary representations of the universal polynomial groups introduced by the first author and Thom.

arXiv:2606.16862•Jun 15, 2026•3 citations

Quantum higher-order Fourier analysis and the Clifford hierarchy

Kaifeng Bu, Weichen Gu, Arthur M. Jaffe

We propose a mathematical framework that we call quantum, higher-order Fourier analysis. This generalizes the classical theory of higher-order Fourier analysis, which led to many recent advances in number theory and combinatorics. We define a family of "quantum measures" on linear transformations on a Hilbert space, that reduce in the case of diagonal matrices to the uniformity norms introduced by Timothy Gowers. We show that our quantum measures and our related theory of quantum higher-order Fourier analysis characterize the Clifford hierarchy, an important notion of complexity in quantum computation. In particular, we give a necessary and sufficient analytic condition that a unitary is an element of the [Formula: see text] level of the Clifford hierarchy.

arXiv:2508.15908•Proceedings of the National Academy of Sciences•Nov 7, 2025•9 citations

Learning and testing algorithms for the Clifford group

Richard A. Low

Given oracle access to an unknown unitary $C$ from the Clifford group and its conjugate, we give an exact algorithm for identifying $C$ with $O(n)$ queries, which we prove is optimal. We then extend this to all levels of the Gottesman-Chuang hierarchy (also known as the ${\mathcal{C}}_{k}$ hierarchy). Further, for unitaries not in the hierarchy itself but known to be close to an element of the hierarchy, we give a method of finding this close element. We also present a Clifford testing algorithm that decides whether a given black-box unitary is close to an element of the Clifford group or far from every element of the Clifford group.

arXiv:0907.2833•Physical Review A•Nov 11, 2009•42 citations
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.
We give a complete classification of the norm properties of quantum uniformity measures, introduced by Bu, Gu, and Jaffe to analytically characterize the Clifford hierarchy. Resolving an open question they posed, we show that quantum uniformity measures define norms precisely for k=2,3,4k=2,3,4k=2,3,4. In particular, we establish the triangle inequality for k=4k=4k=4, whereas for every k≥5k\geq5k≥5 it fails in some dimension. The higher-order result is proved using the structure theory of norming systems of linear equations over finite fields. We also study the geometry of quantum uniformity measures, establishing explicit bounds on the modulus of convexity whenever they define norms. Finally, we give a complete classification of the norm properties of matrix-valued Gowers uniformity functionals, showing that only k=2k=2k=2 defines a norm.
We consider the problem of Clifford testing, which asks whether a black-box n-qubit unitary is a Clifford unitary or at least ε-far from every Clifford unitary. We give the first 4-query Clifford tester, which decides this problem with probability poly(ε). This contrasts with the minimum of 6 copies required for the closely-related task of stabilizer testing. We show that our tester is tolerant, by adapting techniques from tolerant stabilizer testing to our setting. In doing so, we settle in the positive a conjecture of Bu, Gu and Jaffe, by proving a polynomial inverse theorem for a non-commutative Gowers 3-uniformity norm. We also consider the restricted setting of single-copy access, where we give an O(n)-query Clifford tester that requires no auxiliary memory qubits or adaptivity. We complement this with a lower bound, proving that any such, potentially adaptive, single-copy algorithm needs at least Ω(n1/4) queries. To obtain our results, we leverage the structure of the commutant of the Clifford group, obtaining several technical statements that may be of independent interest.
The Clifford hierarchy plays a central role in fault-tolerant quantum computation, but its higher levels remain only partially understood. Recent work on quantum higher order Fourier analysis characterizes membership in the Clifford hierarchy using quantum derivatives, but does not provide an explicit description of the individual levels. In this work, we address this problem by showing that the collection of quantum derivatives of a unitary operator forms a non-abelian 111-cocycle, and conversely that every such 111-cocycle arises from a unitary operator. This yields a recursive cohomological characterization of the Clifford hierarchy. We then specialize this framework to the third level and decompose the cocycle data into symplectic, affine, and phase components, each admitting a cohomological interpretation. As applications, we give a new proof that every two-qudit gate in the third level of the Clifford hierarchy is semi-Clifford, and prove for the first time that every three-qudit gate in the third level is semi-Clifford.
Bu, Gu, and Jaffe introduced the quantum uniformity measures to analytically characterize the Clifford hierarchy. We prove that the quantum uniformity measures are the pullbacks of the matrix-valued uniformity functionals of Gowers and Hatami under the map U↦(a↦WaUWa∗)U\mapsto(a\mapsto W_aUW_a^*)U↦(a↦Wa​UWa∗​), which we call the Weyl-orbit embedding. We study the structure of the Weyl-orbit embedding, and among other results, establish a canonical decomposition of the ambient matrix-valued uniformity space into uniformity preserving twisted copies of the quantum uniformity space. The Weyl-orbit embedding identifies the Clifford hierarchy with Leibman polynomial maps. This identification yields a representation theoretic characterization of the Clifford hierarchy in terms of unitary representations of the universal polynomial groups introduced by the first author and Thom.
We propose a mathematical framework that we call quantum, higher-order Fourier analysis. This generalizes the classical theory of higher-order Fourier analysis, which led to many recent advances in number theory and combinatorics. We define a family of "quantum measures" on linear transformations on a Hilbert space, that reduce in the case of diagonal matrices to the uniformity norms introduced by Timothy Gowers. We show that our quantum measures and our related theory of quantum higher-order Fourier analysis characterize the Clifford hierarchy, an important notion of complexity in quantum computation. In particular, we give a necessary and sufficient analytic condition that a unitary is an element of the [Formula: see text] level of the Clifford hierarchy.
Given oracle access to an unknown unitary CCC from the Clifford group and its conjugate, we give an exact algorithm for identifying CCC with O(n)O(n)O(n) queries, which we prove is optimal. We then extend this to all levels of the Gottesman-Chuang hierarchy (also known as the Ck{\mathcal{C}}_{k}Ck​ hierarchy). Further, for unitaries not in the hierarchy itself but known to be close to an element of the hierarchy, we give a method of finding this close element. We also present a Clifford testing algorithm that decides whether a given black-box unitary is close to an element of the Clifford group or far from every element of the Clifford group.