A New Ingredient for Quantum Error Correction
Machines make mistakes, and as they scale up, so too do the opportunities for error. Quantum computers are no exception; in fact, their errors are especially frequent and difficult to control. This fragility has long been a central obstacle to building large-scale devices capable of practical, universal quantum computation. Quantum error correction attempts to circumvent this obstacle, not by eliminating sources of error but by encoding quantum information in such a way that errors can be detected and corrected as they occur [1]. In doing so, the approach enables fault-tolerant quantum computation. Over the past few decades, researchers have learned that this robustness relies on intrinsically quantum resources, most notably, entanglement [2] and, more recently, so-called magic states [3]. Yet a fundamental question has remained open: Are these the only ingredients required for fault-tolerant quantum computation? Now Derek Khu at the Agency for Science, Technology and Research in Singapore and his colleagues provide an answer [4]. They show that quantum contextuality, a foundational feature of quantum theory, is not merely a conceptual curiosity but is woven directly into the structure of quantum error-correcting codes.
Quantum error correction protects fragile quantum information by encoding a single logical qubit into many physical qubits. This redundancy allows errors on individual qubits to be detected without directly measuring—and therefore disturbing—the stored quantum state. In practice, this diagnosis is obtained by repeatedly measuring carefully chosen observables, the outcomes of which form an error syndrome. Over the past few decades, this so-called stabilizer framework has become the backbone of most leading quantum-computation architectures.
Error correction alone, however, does not guarantee a fully programmable quantum computer. The so-called Eastin-Knill theorem establishes that no quantum error-correcting code can realize a universal set of logical gates using only “transversal” operations, in which each physical qubit is acted on independently [3]. To bypass this limitation, researchers developed magic-state-based approaches, which supplement error correction with specially prepared resource states that enable otherwise inaccessible logical gates. These techniques, including magic-state distillation [5] and state injection, now lie at the core of many fault-tolerant designs.
This progression naturally raises a broader question: What physical resources are truly essential for quantum error correction and fault-tolerant computation? Entanglement is often viewed as the workhorse that spreads logical information nonlocally across many qubits, rendering local errors correctable. And magic states, in turn, supply the additional ingredient needed to evade the constraints on transversal gates and achieve universality. Together, entanglement and magic states have shaped the dominant resource-based picture of fault tolerance. Yet this picture leaves open whether these resources are sufficient, or whether fault-tolerant architectures rely on deeper structural forms of nonclassicality that are not fully captured by entanglement and magic states alone.
Meanwhile, contextuality, a historically important hallmark of quantum nonclassicality [6], has emerged as a key resource in various quantum-information tasks [7, 8]. Contextuality means that the outcome of a quantum measurement cannot be thought of as revealing a value that existed beforehand, because the result can depend on which other measurements are performed at the same time. Contextuality has been shown to be necessary for distilling useful magic states [7], linking a foundational concept directly to computational power. What has remained unclear, however, is whether contextuality is confined to special resource states, or whether it plays a more pervasive role that is intrinsic to quantum error-correcting codes and the fault-tolerant protocols built upon them.
Khu and his colleagues addressed this question by shifting the focus from quantum states to the measurement structure of quantum error-correcting codes [4]. Rather than asking whether a particular state is contextual, they asked whether the measurements defining a code admit any classical, noncontextual explanation. This operational viewpoint closely mirrors how error correction is implemented in practice, because a code is accessed and characterized through its error-checking measurements.
The researchers focused on error checks based on so-called Pauli observables and considered the stabilizer framework for subsystem codes, a class of quantum error-correcting codes in which some degrees of freedom are treated as auxiliary and need not be actively protected. Crucially, the team also enlarged the measurement scenario in a physically natural way. When two Pauli observables “commute,” the outcome of their product can be inferred from the outcomes of the individual measurements; accordingly, the effective measurement scenario should include these inferred observables as well. This construction leads to the concept of a so-called partial closure, which captures the full informational content accessible from a code’s error-checking data.
Within this partially closed setting, the researchers unified several previously distinct approaches to contextuality, resolving a standing conjecture and providing a unified framework for analyzing quantum error-correcting codes. From this framework emerges a strikingly sharp criterion: For subsystem stabilizer codes, strong contextuality arises if and only if the code contains at least two qubits that do not encode logical information. The researchers applied this insight to fault-tolerant schemes that switch between different codes and that achieve universality using transversal gates. They found that such protocols necessarily involve strongly contextual codes when analyzed under partial closure. In this way, contextuality is elevated from a property of special quantum states to an unavoidable structural feature of known universal fault-tolerant architectures based on code switching.
For decades, contextuality largely occupied the “why quantum mechanics is strange” corner of physics. It is now steadily migrating into the domain of “how to build tools with quantum mechanics.” The work of Khu and his colleagues advances this transition by linking contextuality directly to the structure of practical fault-tolerant codes rather than to idealized state-based models of quantum information processing. The team’s results add a new piece to the resource puzzle of quantum error correction, though further work may add additional pieces to that puzzle (Fig. 1). A natural next step is to move beyond contextuality as a binary gatekeeper for universality and to develop it into a quantitative resource that can be compared, tracked, and traded. Beyond that lies the broader challenge of identifying whether additional, as-yet-hidden ingredients remain essential for truly scalable quantum computation.
References
- B. M. Terhal, “Quantum error correction for quantum memories,” Rev. Mod. Phys. 87, 307 (2015).
- S. Bravyi et al., “How much entanglement is needed for quantum error correction?” Phys. Rev. Lett. 134, 210602 (2025).
- B. Eastin and E. Knill, “Restrictions on transversal encoded quantum gate sets,” Phys. Rev. Lett. 102, 110502 (2009).
- D. Khu et al., “Contextuality of quantum error-correcting codes,” PRX Quantum 7, 010319 (2026).
- S. Bravyi and A. Kitaev, “Universal quantum computation with ideal Clifford gates and noisy ancillas,” Phys. Rev. A 71, 022316 (2005).
- S. Kochen and E. Specker, “The problem of hidden variables in quantum mechanics,” J. Math. Mech. 17, 59 (1967).
- M. Howard et al., “Contextuality supplies the ‘magic’ for quantum computation,” Nature 510, 351 (2014).
- D. Schmid and R. W. Spekkens, “Contextual advantage for state discrimination,” Phys. Rev. X 8, 011015 (2018).