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.
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.
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≥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=2 defines a norm.
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.
Higher-order quantum theory is an extension of quantum theory where one introduces transformations whose input and output are transformations, thus generalizing the notion of channels and quantum operations. The generalization then goes recursively, with the construction of a full hierarchy of maps of increasingly higher order. The analysis of special cases already showed that higher-order quantum functions exhibit features that cannot be tracked down to the usual circuits, such as indefinite causal structures, providing provable advantages over circuital maps. The present treatment provides a general framework where this kind of analysis can be carried out in full generality. The hierarchy of higher-order quantum maps is introduced axiomatically with a formulation based on the language of types of transformations. Complete positivity of higher-order maps is derived from the general admissibility conditions instead of being postulated as in previous approaches. The recursive characterization of convex sets of maps of a given type is used to prove equivalence relations between different types. The axioms of the framework do not refer to the specific mathematical structure of quantum theory, and can therefore be exported in the context of any operational probabilistic theory.
We establish a link between stabilizer states, stabilizer rank, and higher-order Fourier analysis – a still-developing area of mathematics that grew out of Gowers's celebrated Fourier-analytic proof of Szemerédi's theorem \cite{gowers1998new}. We observe that n -qudit stabilizer states are so-called nonclassical quadratic phase functions (defined on affine subspaces of Fpn where p is the dimension of the qudit) which are fundamental objects in higher-order Fourier analysis. This allows us to import tools from this theory to analyze the stabilizer rank of quantum states. Quite recently, in \cite{peleg2021lower} it was shown that the n -qubit magic state has stabilizer rank Ω(n) . Here we show that the qudit analog of the n -qubit magic state has stabilizer rank Ω(n) , generalizing their result to qudits of any prime dimension. Our proof techniques use explicitly tools from higher-order Fourier analysis. We believe this example motivates the further exploration of applications of higher-order Fourier analysis in quantum information theory.
The study of quantum information protocols that process quantum gates has led to an interest in ‘higher-order’ quantum transformations, which are transformations that act on other quantum transformations as inputs and/or return them as outputs. Mathematically, such transformations form an inductive hierarchy of infinitely many levels, or ‘orders’: quantum states are at order zero; channels, which transform quantum states, are at order one; superchannels, which transform channels, are at order two; maps that transform superchannels are at order three, and so on. To proceed toward a general understanding of higher-order quantum theory, we need methods to study the full inductive hierarchy in a uniform manner. In the context of the Hilbert space formalism of quantum theory, this means studying operator spaces (used to represent states), linear operators between operator spaces (used to represent channels), etc.; in other words, the inductive hierarchy of higher-order linear maps. We introduce a methodological framework for higher-order quantum theory, partly modeled on that of [Bisio \& Perinotti, 2019]. The framework is based on a set of types, denoted TypesA. Types may be thought of as labels that we use to identify and differentiate all the different kinds of objects of higher-order quantum theory. The central objects of the framework are typed (higher-order) linear maps, as given by the construction of a set L(x) of linear maps of type x for each x ∈ TypesA. We equip the framework with a parallel product operation for typed linear maps, which modifies and generalizes the tensor product so as to be physically meaningful when applied to maps of distinct and arbitrary orders. With the aim of characterizing the higher-order linear maps that represent valid quantum objects, we give a construction, consisting of a convex cone K(x) for each x ∈ TypesA, which generalizes the notion of complete positivity to all orders. We construct a version of the Choi isomorphism for our framework, and we use it to show that K(x) is self-dual for all x ∈ TypesA.
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.