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:2305.11797 · Physical Review A

Measuring nonstabilizerness via multifractal flatness

Xhek Turkeshi, Marco Schirò, Piotr Sierant

Published Oct 9, 2023• 80 citations
arXivHTMLPDF

Abstract

Universal quantum computing requires nonstabilizer (magic) quantum states. Quantifying the nonstabilizerness and relating it to other quantum resources is vital for characterizing the complexity of quantum many-body systems. In this work, we prove that a quantum state is a stabilizer if and only if all states belonging to its Clifford orbit have a flat probability distribution on the computational basis. This implies, in particular, that multifractal states are nonstabilizers. We introduce multifractal flatness, a measure based on the participation entropy that quantifies the wave-function distribution flatness. We demonstrate that this quantity is analytically related to the stabilizer entropy of the state and present several examples elucidating the relationship between multifractality and nonstabilizerness. In particular, we show that the multifractal flatness provides an experimentally and computationally viable nonstabilizerness certification. Our work unravels the direct relation between the nonstabilizerness of a quantum state and its wave-function structure.

DOI
10.1103/physreva.108.042408

Related papers

Efficient Quantum Algorithms for Stabilizer Entropies

Tobias Haug, Soovin Lee, M. S. Kim

Stabilizer entropies (SEs) are measures of nonstabilizerness or "magic" that quantify the degree to which a state is described by stabilizers. SEs are especially interesting due to their connections to scrambling, localization and property testing. However, applications have been limited so far as previously known measurement protocols for SEs scale exponentially with the number of qubits. Here, we efficiently measure SEs for integer Rényi index n>1 via Bell measurements. The SE of N-qubit quantum states can be measured with O(n) copies and O(nN) classical computational time, where for even n we additionally require the complex conjugate of the state. We provide efficient bounds of various nonstabilizerness monotones that are intractable to compute beyond a few qubits. Using the IonQ quantum computer, we measure SEs of random Clifford circuits doped with non-Clifford gates and give bounds for the stabilizer fidelity, stabilizer extent, and robustness of magic. We provide efficient algorithms to measure Clifford-averaged 4n-point out-of-time-order correlators and multifractal flatness. With these measures we study the scrambling time of doped Clifford circuits and random Hamiltonian evolution depending on nonstabilizerness. Counterintuitively, random Hamiltonian evolution becomes less scrambled at long times, which we reveal with the multifractal flatness. Our results open up the exploration of nonstabilizerness with quantum computers.

arXiv:2305.19152•Physical Review Letters•Jun 13, 2024•103 citations

Scalable Measures of Magic Resource for Quantum Computers

Tobias Haug, M. S. Kim

Nonstabilizerness or magic resource characterizes the amount of non-Clifford operations needed to prepare quantum states.It is a crucial resource for quantum computing and a necessary condition for quantum advantage.However, quantifying magic resource beyond a few qubits has been a major challenge.Here, we introduce efficient measures of magic resource for pure quantum states with a sampling cost that is independent of the number of qubits.Our method uses Bell measurements over two copies of a state, which we implement in experiment together with a cost-free error-mitigation scheme.We show the transition of classically simulable stabilizer states into intractable quantum states on the IonQ quantum computer.For applications, we efficiently distinguish stabilizer and nonstabilizer states with low measurement cost even in the presence of experimental noise.Further, we propose a variational quantum algorithm to maximize our measure via the shift rule.Our algorithm can be free of barren plateaus even for highly expressible variational circuits.Finally, we experimentally demonstrate a Bell-measurement protocol for the stabilizer Rényi entropy as well as the Wallach-Meyer entanglement measure.Our results pave the way to understanding the nonclassical power of quantum computers, quantum simulators, and quantum many-body systems.

arXiv:2204.10061•PRX Quantum•Jan 3, 2023•121 citations

Rise and fall of nonstabilizerness via random measurements

Annarita Scocco, Wai‐Keong Mok, Leandro Aolita +2 more

We investigate the dynamics of nonstabilizerness—also known as “magic”—in monitored quantum circuits composed of random Clifford unitaries and local measurements. For measurements in the computational basis, we derive an analytical model for dynamics of the stabilizer nullity, showing that it decays in quantized steps and requires exponentially many measurements to vanish, which reveals the strong protection through Clifford scrambling. On the other hand, for measurements performed in rotated non-Clifford bases, measurements can both create and destroy nonstabilizerness. Here, the dynamics leads to a steady state with nontrivial nonstabilizerness, independent of the initial state. We find that Haar-random states equilibrate in constant time, whereas stabilizer states exhibit linear-in-size relaxation time. While the stabilizer nullity is insensitive to the rotation angle, stabilizer Rényi entropies expose a richer structure in their dynamics. Our results uncover sharp distinctions between coarse and fine-grained nonstabilizerness diagnostics and demonstrate how measurements can both suppress and sustain quantum computational resources.

arXiv:2507.11619•Physical Review Research•Dec 23, 2025•13 citations

Algorithm for estimating α -stabilizer Rényi entropies via purity

Benjamin Stratton

Nonstabilizerness, or “magic,” is a resource for universal quantum computation in most fault-tolerant architectures; access to states with nonstabilizerness allows for nonclassically simulable quantum computation to be performed. Quantifying this resource for unknown states is therefore essential to assessing their utility in quantum computation. The stabilizer Rényi entropies have emerged as a leading tool for achieving this, having already enabled one efficient algorithm for measuring nonstabilizerness. In addition, the stabilizer Rényi entropies have proven useful in developing connections between nonstabilizerness and other quantum phenomena. In this work, we introduce an alternative algorithm for measuring the stabilizer Rényi entropies of an unknown quantum state. First, we show the existence of a state, produced from the action of a channel on α copies of some state ρ , that encodes the α -stabilizer Rényi entropy of ρ into its purity. We detail several methods of applying this channel, and then, by employing existing purity-measuring algorithms, provide an algorithm for measuring the α -stabilizer Rényi entropies for all integers α > 1 . This algorithm is benchmarked for qubits and the resource requirements compared to other known algorithms. Finally, a nonstabilizerness-entanglement relationship is shown to exist in the algorithm, demonstrating a relationship between the two resources, before an instance of resource hiding is found.

arXiv:2507.02540•Physical Review A•Jan 23, 2026•4 citations

Spreading of Magic Resource under Unitary Clifford Dynamics

Mircea Bejan, Pieter W. Claeys, Jiangtian Yao

Nonstabilizerness, or quantum magic resource, presents a valuable resource in quantum error correction and computation. We study the dynamics of locally injected nonstabilizerness in unitary Clifford circuits, where the total nonstabilizerness is conserved. However, the absence of physical observables quantifying nonstabilizerness precludes a direct microscopic or hydrodynamic description of its local distribution and dynamics. Using insights from stabilizer quantum error correcting codes, we rigorously show that the spatial distribution of nonstabilizerness can be inferred from a canonical representation of low-magic states, dubbed the bipartite magic gauge. Moreover, we propose two operationally relevant magic length scales. We numerically establish that, at early times, both length scales grow ballistically at distinct velocities set by the entanglement velocity, after which nonstabilizerness delocalizes. Our work sheds light on the spatiotemporal structure of quantum resources and complexity in many-body dynamics, opening up avenues for investigating their transport properties and further connections with quantum error correction.

quant-pharXiv:2511.21487•Physical Review Letters•Nov 27, 2025•12 citations

Magic Resources of the Heisenberg Picture

Neil Dowling, Pavel Kos, Xhek Turkeshi

We study a nonstabilizerness resource theory for operators, which is dual to that describing states. We identify that the stabilizer Rényi entropy analog in operator space is a good magic monotone satisfying the usual conditions while inheriting efficient computability properties and providing a tight lower bound to the minimum number of non-Clifford gates in a circuit. Operationally, this measure quantifies how well an operator can be approximated by one with only a few Pauli strings-analogous to how entanglement entropy relates to tensor-network truncation. A notable advantage of operator stabilizer entropies is their inherent locality, as captured by a Lieb-Robinson bound. This feature makes them particularly suited for studying local dynamical magic resource generation in many-body systems. We compute this quantity analytically in two distinct regimes. First, we show that under random evolution, operator magic typically reaches near-maximal value for all Rényi indices, and we evaluate the Page correction. Second, harnessing both dual unitarity and ZX graphical calculus, we solve the operator stabilizer entropy for interacting integrable XXZ circuit, finding that it quickly saturates to a constant value. Overall, this measure sheds light on the structural properties of many-body nonstabilizerness generation and can inspire Clifford-assisted tensor network methods.

arXiv:2408.16047•Physical Review Letters•Jul 7, 2025•54 citations
Universal quantum computing requires nonstabilizer (magic) quantum states. Quantifying the nonstabilizerness and relating it to other quantum resources is vital for characterizing the complexity of quantum many-body systems. In this work, we prove that a quantum state is a stabilizer if and only if all states belonging to its Clifford orbit have a flat probability distribution on the computational basis. This implies, in particular, that multifractal states are nonstabilizers. We introduce multifractal flatness, a measure based on the participation entropy that quantifies the wave-function distribution flatness. We demonstrate that this quantity is analytically related to the stabilizer entropy of the state and present several examples elucidating the relationship between multifractality and nonstabilizerness. In particular, we show that the multifractal flatness provides an experimentally and computationally viable nonstabilizerness certification. Our work unravels the direct relation between the nonstabilizerness of a quantum state and its wave-function structure.
Stabilizer entropies (SEs) are measures of nonstabilizerness or "magic" that quantify the degree to which a state is described by stabilizers. SEs are especially interesting due to their connections to scrambling, localization and property testing. However, applications have been limited so far as previously known measurement protocols for SEs scale exponentially with the number of qubits. Here, we efficiently measure SEs for integer Rényi index n>1 via Bell measurements. The SE of N-qubit quantum states can be measured with O(n) copies and O(nN) classical computational time, where for even n we additionally require the complex conjugate of the state. We provide efficient bounds of various nonstabilizerness monotones that are intractable to compute beyond a few qubits. Using the IonQ quantum computer, we measure SEs of random Clifford circuits doped with non-Clifford gates and give bounds for the stabilizer fidelity, stabilizer extent, and robustness of magic. We provide efficient algorithms to measure Clifford-averaged 4n-point out-of-time-order correlators and multifractal flatness. With these measures we study the scrambling time of doped Clifford circuits and random Hamiltonian evolution depending on nonstabilizerness. Counterintuitively, random Hamiltonian evolution becomes less scrambled at long times, which we reveal with the multifractal flatness. Our results open up the exploration of nonstabilizerness with quantum computers.
Nonstabilizerness or magic resource characterizes the amount of non-Clifford operations needed to prepare quantum states.It is a crucial resource for quantum computing and a necessary condition for quantum advantage.However, quantifying magic resource beyond a few qubits has been a major challenge.Here, we introduce efficient measures of magic resource for pure quantum states with a sampling cost that is independent of the number of qubits.Our method uses Bell measurements over two copies of a state, which we implement in experiment together with a cost-free error-mitigation scheme.We show the transition of classically simulable stabilizer states into intractable quantum states on the IonQ quantum computer.For applications, we efficiently distinguish stabilizer and nonstabilizer states with low measurement cost even in the presence of experimental noise.Further, we propose a variational quantum algorithm to maximize our measure via the shift rule.Our algorithm can be free of barren plateaus even for highly expressible variational circuits.Finally, we experimentally demonstrate a Bell-measurement protocol for the stabilizer Rényi entropy as well as the Wallach-Meyer entanglement measure.Our results pave the way to understanding the nonclassical power of quantum computers, quantum simulators, and quantum many-body systems.
We investigate the dynamics of nonstabilizerness—also known as “magic”—in monitored quantum circuits composed of random Clifford unitaries and local measurements. For measurements in the computational basis, we derive an analytical model for dynamics of the stabilizer nullity, showing that it decays in quantized steps and requires exponentially many measurements to vanish, which reveals the strong protection through Clifford scrambling. On the other hand, for measurements performed in rotated non-Clifford bases, measurements can both create and destroy nonstabilizerness. Here, the dynamics leads to a steady state with nontrivial nonstabilizerness, independent of the initial state. We find that Haar-random states equilibrate in constant time, whereas stabilizer states exhibit linear-in-size relaxation time. While the stabilizer nullity is insensitive to the rotation angle, stabilizer Rényi entropies expose a richer structure in their dynamics. Our results uncover sharp distinctions between coarse and fine-grained nonstabilizerness diagnostics and demonstrate how measurements can both suppress and sustain quantum computational resources.
Nonstabilizerness, or “magic,” is a resource for universal quantum computation in most fault-tolerant architectures; access to states with nonstabilizerness allows for nonclassically simulable quantum computation to be performed. Quantifying this resource for unknown states is therefore essential to assessing their utility in quantum computation. The stabilizer Rényi entropies have emerged as a leading tool for achieving this, having already enabled one efficient algorithm for measuring nonstabilizerness. In addition, the stabilizer Rényi entropies have proven useful in developing connections between nonstabilizerness and other quantum phenomena. In this work, we introduce an alternative algorithm for measuring the stabilizer Rényi entropies of an unknown quantum state. First, we show the existence of a state, produced from the action of a channel on α copies of some state ρ , that encodes the α -stabilizer Rényi entropy of ρ into its purity. We detail several methods of applying this channel, and then, by employing existing purity-measuring algorithms, provide an algorithm for measuring the α -stabilizer Rényi entropies for all integers α > 1 . This algorithm is benchmarked for qubits and the resource requirements compared to other known algorithms. Finally, a nonstabilizerness-entanglement relationship is shown to exist in the algorithm, demonstrating a relationship between the two resources, before an instance of resource hiding is found.
Nonstabilizerness, or quantum magic resource, presents a valuable resource in quantum error correction and computation. We study the dynamics of locally injected nonstabilizerness in unitary Clifford circuits, where the total nonstabilizerness is conserved. However, the absence of physical observables quantifying nonstabilizerness precludes a direct microscopic or hydrodynamic description of its local distribution and dynamics. Using insights from stabilizer quantum error correcting codes, we rigorously show that the spatial distribution of nonstabilizerness can be inferred from a canonical representation of low-magic states, dubbed the bipartite magic gauge. Moreover, we propose two operationally relevant magic length scales. We numerically establish that, at early times, both length scales grow ballistically at distinct velocities set by the entanglement velocity, after which nonstabilizerness delocalizes. Our work sheds light on the spatiotemporal structure of quantum resources and complexity in many-body dynamics, opening up avenues for investigating their transport properties and further connections with quantum error correction.
We study a nonstabilizerness resource theory for operators, which is dual to that describing states. We identify that the stabilizer Rényi entropy analog in operator space is a good magic monotone satisfying the usual conditions while inheriting efficient computability properties and providing a tight lower bound to the minimum number of non-Clifford gates in a circuit. Operationally, this measure quantifies how well an operator can be approximated by one with only a few Pauli strings-analogous to how entanglement entropy relates to tensor-network truncation. A notable advantage of operator stabilizer entropies is their inherent locality, as captured by a Lieb-Robinson bound. This feature makes them particularly suited for studying local dynamical magic resource generation in many-body systems. We compute this quantity analytically in two distinct regimes. First, we show that under random evolution, operator magic typically reaches near-maximal value for all Rényi indices, and we evaluate the Page correction. Second, harnessing both dual unitarity and ZX graphical calculus, we solve the operator stabilizer entropy for interacting integrable XXZ circuit, finding that it quickly saturates to a constant value. Overall, this measure sheds light on the structural properties of many-body nonstabilizerness generation and can inspire Clifford-assisted tensor network methods.