Contextuality of Quantum Error-Correcting Codes

TL;DR

This work develops a rigorous framework for contextuality in QEC and proves three main results, establishing quantum contextuality as an intrinsic characteristic of fault-tolerant quantum codes and protocols, complementing entanglement and magic as resources for scalable quantum computation.

Abstract

Universal fault-tolerant quantum computation requires overcoming the Eastin--Knill theorem on quantum error correction (QEC) codes that protect information from noise. This is often accomplished through strategies like magic state distillation, which prepares computational resources -- namely, magic states -- whose power is rooted in quantum contextuality, a fundamental nonclassical feature generalizing Bell nonlocality. Yet, the broader role of contextuality in enabling universality, including its significance as an inherent feature of QEC codes and protocols themselves, has remained largely unexplored. In this work, we develop a rigorous framework for contextuality in QEC and prove three main results. Fundamentally, we show that subsystem stabilizer codes with two or more gauge qubits are strongly contextual in their partial closure, while others are noncontextual, establishing a clear criterion for identifying contextual codes. Mathematically, we unify Abramsky--Brandenburger's sheaf-theoretic and Kirby--Love's tree-based definitions of contextuality, resolving a conjecture of Kim and Abramsky. Practically, we prove that many widely studied code-switching protocols which admit universal transversal gate sets, such as the doubled color codes introduced by Bravyi and Cross, are necessarily strongly contextual in their partial closure. Collectively, our results establish quantum contextuality as an intrinsic characteristic of fault-tolerant quantum codes and protocols, complementing entanglement and magic as resources for scalable quantum computation. For quantum coding theorists, this provides a new invariant: contextuality classifies which subsystem stabilizer codes can participate in universal fault-tolerant protocols. These findings position contextuality not only as a foundational concept but also as a practical guide for the design and analysis of future QEC architectures.

Figures (6)

• Figure 1: A reading guide for this paper. Readers primarily interested in the QEC results can follow the solid path on the left. Those interested in the formal proofs of contextuality can follow the path on the right. The dashed arrow indicates that the technical results of Section \ref{['sec:equivalence_of_contextuality_notions_under_partial_closure']} provide the formal justification for the main QEC result in Section \ref{['sec:contextuality_code_switching']}.
• Figure 2: (a) All $4$-vertex graphs with the Kirby--Love property (up to relabeling of vertices). A solid (resp. no) line between two vertices indicates the presence (resp. absence) of an edge between the two vertices. A dashed line between two vertices indicates that the edge may or may not be present. In general, a graph has the Kirby--Love property if and only if it contains such a $4$-vertex graph as an induced subgraph. (b) Compatibility graph of $\{X_1, X_2, Z_1, Z_2\} \subseteq \mathcal{P}_2$. This graph has the Kirby--Love property. (c) Subgraph induced by the vertices representing $X_{s+1}', X_{s+2}', Z_{s+1}', Z_{s+2}'$ in the compatibility graph of the set of check measurements $\mathcal{C}$ of a code with $g \ge 2$ gauge qubits, as in the proof of Lemma \ref{['lem:comp_graph_kl_iff_at_least_two_gauge_qubits']}.
• Figure 3: Structure of a graph $G$ that does not have the Kirby--Love property, as in the proof of Theorem \ref{['thm:strongly-contextual-implies-comp-graph-kl']}. Each circle represents a clique in the graph, while each thick double line connecting two cliques indicates that every vertex in one clique is connected to every vertex in the other (i.e., the subgraph induced by the two cliques is a clique). Here, $U$ is the set of universal vertices in $G$, and the maximal cliques are $U \cup C_i$ for $i=0, \cdots, m$. For $i \ne j$, any vertex in $C_i$ is not connected to any vertex in $C_j$.
• Figure 4: Left: Relationship between different definitions of contextuality for an empirical model $\mathcal{S}_\rho$ on a quantum measurement scenario $\langle X,\mathcal{M},\mathbb{Z}_2\rangle$, for an arbitrary set of observables $X$. Right: Different definitions of contextuality are equivalent under partial closure, i.e., are equivalent for an empirical model $\mathcal{S}_\rho$ on a quantum measurement scenario $\langle\Bar{X},\Bar{\mathcal{M}},\mathbb{Z}_2\rangle$, where $\Bar{X}$ is a set of observables under partial closure (see Corollary \ref{['cor:strong-contextuality-equivalences']}).
• Figure 5: Determining trees for $\pm Y_1Y_2$ over $\{X_1, X_2, Z_1, Z_2\}$.

Theorems & Definitions (81)

• Definition 1
• Definition 2
• Definition 3
• Definition 4
• Definition 5
• Definition 6
• Definition 7
• Remark 1
• Theorem 1
• proof