A Reliable Meter for Quantum Magic

13/01/2026
Figure 1: Leone and Bittel showed that functions called stabilizer Rényi entropies are reliable “meters” for quantum magic in many-body systems [1]. Circuits composed only of fault-tolerant Clifford operations (blue) generate states with low stabilizer entropy. The inclusion of non-Clifford operations (red) drives the entropy higher, signaling the presence of magic. The amount of magic is directly proportional to the value of the entropy.


Quantum computing aims to harness unique quantum effects to achieve capabilities beyond the reach of classical machines. Realizing this vision at scale requires fragile quantum information to be protected from noise. Unfortunately, only a limited set of operations can be implemented with fault tolerance, and many of them can already be efficiently simulated on a classical computer. Fortunately, this limitation can be overcome with what is known as quantum magic. This is a property of certain quantum states that enables operations outside the fault-tolerant, classically accessible set. Without this magic, even a perfectly error-corrected quantum computer would be no more powerful than a classical one. Quantifying magic is therefore essential for determining computational power, but doing so is challenging, especially for large many-body systems where complexity grows rapidly. Last year, Lorenzo Leone and Lennart Bittel of the Free University of Berlin showed theoretically that so-called stabilizer entropies offer a rigorous and experimentally accessible “meter” for magic [1]. Their analysis answered a long-standing question of how to reliably measure this resource, which is essential for realizing a universal quantum computer.

In quantum computation, different resources are classified according to the set of operations that can be performed without consuming them [2]. For error-corrected quantum devices, the natural choice of free operation is given by the stabilizer, or Clifford, framework, which is straightforward to implement fault tolerantly. However, states prepared entirely from Clifford operations—the so-called stabilizer states—are limited in their quantum computational potential because they can also be simulated efficiently on a classical computer [3].

On paper, magic states—quantum states lying outside the stabilizer set—can enable operations that cannot be reproduced efficiently by classical means [4]. Because of this capability, magic is a central resource for universal quantum computation, comparable in importance to entanglement in other areas of quantum information science. But whereas entanglement is readily realized [5], magic has been harder to pin down, let alone exploit. Measures of magic are well defined, but they are computationally costly, especially for large systems, and are inaccessible to most experiments [6].

Physically, magic can be pictured as an “extra twist” in a quantum state’s geometry—that is, a feature that prevents the state from being mapped, through simple transformations, into a configuration that a classical computer could track efficiently. In single-qubit systems, magic can be visualized as a departure from certain discrete points on the Bloch sphere that represent stabilizer states. In many-body systems, however, this geometric intuition quickly fails. Finding scalable diagnostics becomes essential.

This challenge has motivated the quest for magic monotones, which are both theoretically sound and practically useful. Magic monotones are mathematical functions that quantify the magic in a quantum state or operation. Crucially—hence the name—they do not increase in value when applied to the state or operation.

A leading candidate for formulating magic monotones makes use of functions known as Rényi entropies, which provide a general, parameterizable way to quantify information in a probability distribution (Fig. 1). For magic monotones, the useful Rényi entropies apply to the distribution of Pauli expectation values [7]. Stabilizer states occupy a small set of Pauli operators, whereas magic states exhibit a broader spread—much like how a disordered system has higher entropy relative to an ordered one. Importantly, computing such a Rényi stabilizer entropy is similar in cost to computing entanglement entropy. What’s more, stabilizer entropies can also be estimated experimentally using randomized measurements [8].

Despite that promising start, it remained unclear whether stabilizer states that satisfy full monotonicity criteria could be found. In fact, counterexamples for certain stabilizer entropies had cast doubt on the approach’s validity, limiting its adoption as a standard diagnostic [9].

Leone and Bittel solved this problem by proving that stabilizer entropies satisfy monotonicity for all Rényi indices—parameters appearing in these entropies—above a threshold and for all quantum states (Fig. 1). In doing so, the researchers established stabilizer entropies as bona fide magic monotones. Their proof examined the decomposition of a quantum state in the Pauli-operator basis and relied on refined mathematical inequalities. By tracking how the coefficients transform under Clifford protocols, the duo showed that the entropy can never increase when no magic is injected.

Building on these results, Leone and Bittel derived new bounds on the rates at which different magic states can be converted into one another, revealing a striking asymmetry. Namely, some conversions are exponentially easier in one direction than in the reverse direction. What’s more, the researchers extended stabilizer entropies to mixed states, preserving monotonicity while making the measure significantly more tractable beyond pure states. This combination of rigorous foundations and practical computability firmly established stabilizer entropies as a reliable tool for quantifying magic in realistic quantum systems.

With these findings, stabilizer Rényi entropies have acquired a solid theoretical foundation as diagnostic tools for many-body quantum physics. Indeed, my colleagues and I have recently extended Leone and Bittel’s monotonicity proof to higher-dimensional qubits, or qudits [10]. In the short term, the proofs give experimentalists a concrete and accessible way to measure the elusive resource of magic, thereby enabling systematic benchmarking of quantum processors as they scale up. In the context of many-body physics, the proofs open the door to tracking how magic spreads in complex dynamics—an essential step toward understanding the computational costs of simulating interacting quantum systems.

Looking further ahead, a robust magic meter could become as indispensable as entanglement measures are today. It could help optimize algorithms by preserving magic where it matters most and clarify how magic interacts with other resources that underpin quantum complexity. Beyond quantum computing, the concept could inspire approaches in quantum simulation, quantum thermodynamics, and even quantum foundations, where the role of nonclassical resources is still being explored.

Source: https://tinyurl.com/2yuphjre via Physics