In this paper we introduce the concept of stabilizer convolution and demonstrate that the only convolutions that can be used for stability testing are stabilizer convolutions. Moreover, using any stabilizer convolution yields similarly good results. Through the Choi-Jamio\l{}kowski isomorphism, this method can also be applied to Clifford testing for quantum gates. Leveraging the invariance of circuit magic classes of mean states under stabilizer self-convolution, we formulate a central limit theorem for circuit magic classes of quantum states. Moreover, employing the Choi-Jamio\l{}kowski correspondence, we generalize this finding to establish a central limit theorem for circuit magic classes of completely positive and trace-preserving channels.
In this paper we introduce the concept of stabilizer convolution and demonstrate that the only convolutions that can be used for stability testing are stabilizer convolutions. Moreover, using any stabilizer convolution yields similarly good results. Through the Choi-Jamio\l{}kowski isomorphism, this method can also be applied to Clifford testing for quantum gates. Leveraging the invariance of circuit magic classes of mean states under stabilizer self-convolution, we formulate a central limit theorem for circuit magic classes of quantum states. Moreover, employing the Choi-Jamio\l{}kowski correspondence, we generalize this finding to establish a central limit theorem for circuit magic classes of completely positive and trace-preserving channels.
We introduce a quantum convolution and a conceptual framework to study states in discrete-variable (DV) quantum systems. All our results suggest that stabilizer states play a role in DV quantum systems similar to the role that Gaussian states play in continuous-variable systems. Hence we suggest the name ``discrete quantum Gaussians'' for stabilizer states. For example, we prove that the convolution of two stabilizer states is another stabilizer state, and that stabilizer states extremize both quantum entropy and Fisher information. We establish a ``maximal entropy principle,'' a ``second law of thermodynamics for quantum convolution,'' and a ``quantum central limit theorem.'' The latter is based on iterating the convolution of a zero-mean quantum state, which we prove converges to a stabilizer state. We bound the exponential rate of convergence of the quantum central limit theorem by the ``magic gap,'' defined in terms of the support of the characteristic function of the state. We elaborate on our general results with a discussion of some examples, as well as extending many of them to quantum channels.
Classically hard-to-simulate quantum states, or "magic" states, are prerequisites to quantum advantage, highlighting an apparent separation between classically and quantumly tractable problems. Classically simulable states such as Clifford circuits on stabilizer states, free bosonic states, free fermions, and matchgate circuits are all in some sense Gaussian. While free bosons and fermions arise from quadratic Hamiltonians, recent works have demonstrated that bosonic and qudit systems converge to Gaussians and stabilizers under convolution. In this work, we similarly identify convolution for fermions and find efficient measures of non-Gaussian magic in pure fermionic states. We demonstrate that three natural notions for the Gaussification of a state—(1) the Gaussian state with the same covariance matrix, (2) the fixed point of convolution, and (3) the closest Gaussian in relative entropy—coincide by proving a central limit theorem for fermionic systems. We then utilize the violation of Wick's theorem and the matchgate identity to quantify non-Gaussian magic in addition to a SWAP test.
We introduce the Clifford entropy, a measure of how close an arbitrary unitary is to a Clifford unitary, which generalizes the stabilizer entropy for states. We show that this quantity vanishes if and only if a unitary is Clifford, is invariant under composition with Clifford unitaries, and is subadditive under tensor products. Rewriting the Clifford entropy in terms of the stabilizer entropy of the corresponding Choi state allows us to derive an upper bound: that this bound is not tight follows from considering the properties of symmetric informationally complete sets. Nevertheless we are able to numerically estimate the maximum in low dimensions, comparing it to the average over all unitaries, which we derive analytically. Finally, harnessing a concentration of measure result, we show that as the dimension grows large, with probability approaching unity, the ratio between the Clifford entropy of a Haar random unitary and that of a fixed magic gate gives a lower bound on the depth of a doped Clifford circuit which realizes the former in terms of the latter. In fact, numerical evidence suggests that this result holds reliably even in low dimensions. We conclude with several directions for future research.
Classically hard to simulate quantum states, or "magic states", are prerequisites to quantum advantage, highlighting an apparent separation between classically and quantumly tractable problems. Classically simulable states such as Clifford circuits on stabilizer states, free bosonic states, free fermions, and matchgate circuits are all in some sense Gaussian. While free bosons and fermions arise from quadratic Hamiltonians, recent works have demonstrated that bosonic and qudit systems converge to Gaussians and stabilizers under convolution. In this work, we similarly identify convolution for fermions and find efficient measures of non-Gaussian magic in pure fermionic states. We demonstrate that three natural notions for the Gaussification of a state, (1) the Gaussian state with the same covariance matrix, (2) the fixed point of convolution, and (3) the closest Gaussian in relative entropy, coincide by proving a central limit theorem for fermionic systems. We then utilize the violation of Wick's theorem and the matchgate identity to quantify non-Gaussian magic in addition to a SWAP test.
We introduce a framework to study discrete-variable (DV) quantum systems based on qudits. It relies on notions of a mean state (MS), a minimal stabilizer-projection state (MSPS), and a new convolution. Some interesting consequences are: The MS is the closest MSPS to a given state with respect to the relative entropy; the MS is extremal with respect to the von Neumann entropy, demonstrating a "maximal entropy principle in DV systems." We obtain a series of inequalities for quantum entropies and for Fisher information based on convolution, giving a "second law of thermodynamics for quantum convolutions." We show that the convolution of two stabilizer states is a stabilizer state. We establish a central limit theorem, based on iterating the convolution of a zero-mean quantum state, and show this converges to its MS. The rate of convergence is characterized by the "magic gap," which we define in terms of the support of the characteristic function of the state. We elaborate on two examples: the DV beam splitter and the DV amplifier.
Measures of non-stabilizerness (``magic'') of a quantum evolution quantify how hard it is to simulate on a classical computer. A natural question is how to extract information about magic from physical correlators, for example at finite temperature or in the ground state. In this paper we show how to measure magic using out-of-time-order correlators evaluated in an arbitrary state. For every full-rank state, and in particular for every Gibbs state, the resulting quantity vanishes if and only if the evolution is Clifford. We establish its basic properties, relate it to the stabilizer entropy of the Choi state, and prove that, even with a single fixed probe operator, it gives a lower bound on the number of T gates needed to implement the dynamics in any circuit architecture.