Quantum Computation with Stabilizer States

Stabilizer formalism emerges as a foundational framework in quantum computing, offering a class of highly structured quantum states and operations that are amenable to efficient classical simulation. At its core, stabilizer states are defined as common eigenvectors of sets of Pauli operators, underpinning error-correcting codes and fault-tolerant architectures. Operations that map stabilizer states to stabilizer states—namely the Clifford group—can be implemented with remarkable resilience to noise but remain insufficient for universal quantum computation. The injection of non-stabilizer resources, often termed “magic states”, complements this restricted toolkit, enabling the realisation of fault-tolerant, universal algorithms. Progress in resource theories has quantified the “magic” or non-stabilizerness needed to surpass classical capabilities, offering monotones and entropic measures that capture the complexity and distillability of quantum states. Techniques such as magic-state distillation, low-rank stabilizer decompositions and tensor-network methods extend the practical reach of these theories, while highlighting the trade-offs between fault tolerance, overhead and computational power. Together, these developments not only illuminate the boundary between classical simulability and genuine quantum advantage but also guide the design of scalable quantum architectures and algorithms across computing, communication and many-body physics.

Research from Nature Portfolio

No recent Nature Portfolio content available.

Research from all publishers

Recent work has introduced efficient measures of magic resource for pure quantum states with sampling costs that remain independent of system size. By employing Bell measurements across multiple copies of a state and integrating error-mitigation protocols, researchers have demonstrated transitions from simulable stabilizer regimes to intractable quantum states on contemporary hardware. These approaches enable low-cost discrimination between stabilizer and non-stabilizer states even under realistic noise, and propose variational algorithms that avoid barren plateaus when maximising magic monotones. In parallel, the development of a resource theory of quantum scrambling has provided a rigorous framework linking the spread of quantum information in chaotic systems to bounds on magic content and computational advantage. This formalism not only quantifies scrambling as a resource but also establishes experimental protocols for measuring its impact, offering insights into black hole information decoding and non-local entanglement growth. Further advances in many-body contexts have yielded quantitative characterisations of magic in highly entangled multi-qubit states. It has been shown that almost all large-scale pure states possess near-maximal magic, while explicit constructions connect the magic of hypergraph and topologically ordered states to underlying Boolean functions. Such studies reveal constraints on speed-up in measurement-based computation and uncover links between quantum phases of matter and computational complexity.

Quantum Computation with Stabilizer States publication trend

The graph below shows the total number of articles in quantum computation with stabilizer states across all publications each year (not limited to Nature Index journals).

Technical terms

Stabilizer states: Quantum states that are uniquely defined as eigenstates of commuting Pauli operators, central to error-correcting codes and classical simulation protocols.

Clifford group: The set of quantum operations that map stabilizer states to stabilizer states, including the Hadamard, phase and controlled-NOT gates.

Magic states: Non-stabilizer quantum states that, when used with Clifford operations, enable universal quantum computation under fault tolerance.

Non-stabilizerness (magic): A quantitative measure of the deviation of a quantum state or operation from the stabilizer formalism, often serving as a resource monotone.

Magic-state distillation: Protocols that purify imperfect magic states into higher-fidelity non-stabilizer resources using only stabilizer operations and measurements.

Resource theory: A formal framework that classifies and quantifies resources—such as magic or entanglement—according to allowed free operations and monotones.

References

1. Scalable Measures of Magic Resource for Quantum Computers. PRX Quantum (2023).
2. Resource theory of quantum scrambling. Proceedings of the National Academy of Sciences of the United States of America (2023).
3. Simulation of quantum circuits by low-rank stabilizer decompositions. Quantum (2019).
4. Many-Body Quantum Magic. PRX Quantum (2022).