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:2512.16886

Many-body contextuality and self-testing quantum matter via nonlocal games

Oliver Hart, David T. Stephen, Evan Wickenden, Rahul Nandkishore

quant-phcond-mat.stat-mechcond-mat.str-elSubmitted Dec 18, 2025• Announced Dec 19, 2025• 0 citations
arXivHTMLPDF

Abstract

Contextuality is arguably the fundamental property that makes quantum mechanics different from classical physics. It is responsible for quantum computational speedups in both magic-state-injection-based and measurement-based models of computation, and can be directly probed in a many-body setting by multiplayer nonlocal quantum games. Here, we discuss a family of games that can be won with certainty when performing single-site Pauli measurements on a state that is a codeword of a Calderbank-Shor-Steane (CSS) error-correcting quantum code. We show that these games require deterministic computation of a code-dependent Boolean function, and that the classical probability of success is upper bounded by a generalized notion of nonlinearity/nonquadraticity. This success probability quantifies the state's contextuality, and is computed via the function's (generalized) Walsh-Hadamard spectrum. To calculate this, we introduce an efficient, many-body-physics-inspired method that involves identifying the symmetries of an auxiliary hypergraph state. We compute the classical probability of success for several paradigmatic CSS codes and relate it to both classical statistical mechanics models and to strange correlators of symmetry-protected topological states. We also consider CSS submeasurement games, which can only be won with certainty by sharing the appropriate codeword up to local isometries. These games therefore enable self-testing, which we illustrate explicitly for the 2D toric code. We also discuss how submeasurement games enable an extensive notion of contextuality in many-body states.

Comments
21 pages, 6 figures

Related papers

Scalable tests of quantum contextuality from stabilizer-testing nonlocal games

Wanbing Zhao, H. W. Shawn Liew, Wen Wei Ho +2 more

Soon after the dawn of quantum error correction, DiVincenzo and Peres observed that stabilizer codewords could give rise to simple proofs of quantumness via contextuality. This discovery can be recast in the language of nonlocal games: every $n$-qubit stabilizer state defines a specific "stabilizer-testing" $n$-player nonlocal game, which quantum players can win with probability one. If quantum players can moreover outperform all possible classical players, then the state is contextual. However, the classical values of stabilizer-testing games are largely unknown for scalable examples beyond the $n$-qubit GHZ state. We introduce several new methods for upper-bounding the classical values of these games. We first prove a general coding-theory bound for all stabilizer-testing games: if the classical value $p_{\mathrm{cl}}^* < 1$, then $p_{\mathrm{cl}}^* \leq 7/8$, i.e., there is no classical strategy that can perform as well as the optimal quantum strategy even in an asymptotic sense. We then show how to tighten this bound for the most common scalable examples, namely GHZ, toric-code and cyclic cluster states. In particular, we establish an asymptotically tight upper bound for cyclic cluster states using transfer-matrix methods. This leads to the striking conclusion that measuring an exponentially small fidelity to the cyclic cluster state will suffice to witness its contextuality.

quant-pharXiv:2512.16654•Dec 19, 2025•0 citations

A multiplayer multiteam nonlocal game for the toric code

Vir B. Bulchandani, F. J. Burnell, S. L. Sondhi

Nonlocal games yield an unusual perspective on entangled quantum states. The defining property of such games is that a set of players in joint possession of an entangled state can win the game with higher probability than is allowed by classical physics. Here we construct a nonlocal game that can be won with certainty by $2N$ players if they have access to the ground state of the toric code on as many qubits. By contrast, the game cannot be won by classical players more than half the time in the large $N$ limit. Our game differs from previous examples because it arranges the players on a lattice and allows them to carry out quantum operations in teams, whose composition is dynamically specified. This is natural when seeking to characterize the degree of quantumness of nontrivial many-body states, which potentially include states in much more varied phases of matter than the toric code. We present generalizations of the toric code game to states with ${\mathbb{Z}}_{M}$ topological order.

arXiv:2205.12251•Physical review. B./Physical review. B•Jan 12, 2023•5 citations

Quantum-Classical Separation in Bounded-Resource Tasks Arising from Measurement Contextuality

Shashwat Kumar, Eliott Rosenberg, Alejandro Grajales Dau +280 more

The prevailing view is that quantum phenomena can be harnessed to tackle certain problems beyond the reach of classical approaches. Quantifying this capability as a quantum-classical separation and demonstrating it on current quantum processors has remained elusive. Using a superconducting qubit processor, we show that quantum contextuality enables certain tasks to be performed with success probabilities beyond classical limits. With a few qubits, we illustrate quantum contextuality with the magic square game, as well as quantify it through a Kochen--Specker--Bell inequality violation. To examine many-body contextuality, we implement the N-player GHZ game and separately solve a 2D hidden linear function problem, exceeding classical success rate in both. Our work proposes novel ways to benchmark quantum processors using contextuality-based algorithms.

quant-pharXiv:2512.02284•Dec 3, 2025•0 citations

Braiding for the win: Harnessing braiding statistics in topological states to win quantum games

Hart, Oliver, David T. Stephen, Dominic J. Williamson +1 more

Nonlocal quantum games provide proof of principle that quantum resources can confer advantage at certain tasks. They also provide a compelling way to explore the computational utility of phases of matter on quantum hardware. In a recent manuscript [Hart et al., arXiv:2403.04829] we demonstrated that a toric code resource state conferred advantage at a certain nonlocal game, which remained robust to small deformations of the resource state. In this manuscript we demonstrate that this robust advantage is a generic property of resource states drawn from topological or fracton ordered phases of quantum matter. To this end, we illustrate how several other states from paradigmatic topological and fracton ordered phases can function as resources for suitably defined nonlocal games, notably the three-dimensional toric-code phase, the X-cube fracton phase, and the double-semion phase. The key in every case is to design a nonlocal game that harnesses the characteristic braiding processes of a quantum phase as a source of contextuality. We unify the strategies that take advantage of mutual statistics by relating the operators to be measured to order and disorder parameters of an underlying generalized symmetry-breaking phase transition. Finally, we massively generalize the family of games that admit perfect strategies when codewords of homological quantum error-correcting codes are used as resources.

arXiv:2412.14288•Dec 18, 2024•0 citations

A Computational Test of Contextuality and, Even Simpler Proofs of Quantumness

Atul Singh Arora, Kishor Bharti, Alexandru Cojocaru +1 more

Bell non-locality is a fundamental feature of quantum mechanics whereby measurements performed on “spatially separated” quantum systems can exhibit correlations that cannot be understood as revealing predetermined values. This is a special case of the more general phenomenon of “quantum contextuality”, which says that such correlations can occur even when the measurements are not necessarily on separate quantum systems, but are merely “compatible” (i.e. commuting). Crucially, while any non-local game yields an experiment that demonstrates quantum advantage by leveraging the “spatial separation” of two or more devices (and in fact several such demonstrations have been conducted successfully in recent years), the same is not true for quantum contextuality: finding the contextuality analogue of such an experiment is arguably one of the central open questions in the foundations of quantum mechanics. In this work, we show that an arbitrary contextuality game can be compiled into an “operational test of contextuality” involving a single quantum device, by only making the assumption that the device is computationally bounded. Our work is inspired by the recent work of Kalai et al. (STOC '23) that converts any non-local game into a classical test of quantum advantage with a single device. The central idea in their work is to use cryptography to enforce spatial separation within subsystems of a single quantum device. Our work can be seen as using cryptography to enforce “temporal separation”, i.e. to restrict communication between sequential measurements. Beyond contextuality, we employ our ideas to design a “proof of quantumness” that, to the best of our knowledge, is arguably even simpler than the ones proposed in the literature so far.

arXiv:2405.06787•Annual Symposium on Foundations of Computer Science•Oct 27, 2024•3 citations

Quantum contextuality with mixed states of 1D symmetry-protected topological order

Leroy Fagan, Akimasa Miyake

Bell theorems of many-body nonlocality and contextuality serve as a benchmark for proving quantum advantage in that a quantum computer outperforms a classical computer for a certain problem. In practice, however, near-term quantum devices do not prepare perfectly pure states but rather mixed states produced from noisy channels. We investigate noisy quantum advantage by considering thermal mixed states of one-dimensional many-body systems with a symmetry-protected topological (SPT) order. In the pure-state (or zero-temperature) case, these states are known to be useful for measurement-based quantum computation, and to outperform classical computers in a many-body contextuality game, provided string order parameters (SOPs) of SPT are sufficiently large. Here, we show that quantum advantage in mixed states is measured by a combination of twisted SOP and symmetry representation expectation values. Using the minimally entangled typical thermal states algorithm, it is demonstrated that quantum advantage persists to a nonzero critical temperature for finite-sized instances of the many-body contextuality game. While this critical temperature goes to zero in the thermodynamic limit, it is relatively robust to system size, suggesting that these states remain useful for demonstrating genuine "quantumness" of noisy hardware in a scalable fashion. Finally, we show that the quantum winning probability is lower bounded by the global fidelity with the 1D cluster state, so that our contextuality game can provide an operational meaning to benchmark the capacity to create long-range order like SPT states in near-term experimental devices.

quant-pharXiv:2603.13626•Mar 17, 2026•0 citations
Contextuality is arguably the fundamental property that makes quantum mechanics different from classical physics. It is responsible for quantum computational speedups in both magic-state-injection-based and measurement-based models of computation, and can be directly probed in a many-body setting by multiplayer nonlocal quantum games. Here, we discuss a family of games that can be won with certainty when performing single-site Pauli measurements on a state that is a codeword of a Calderbank-Shor-Steane (CSS) error-correcting quantum code. We show that these games require deterministic computation of a code-dependent Boolean function, and that the classical probability of success is upper bounded by a generalized notion of nonlinearity/nonquadraticity. This success probability quantifies the state's contextuality, and is computed via the function's (generalized) Walsh-Hadamard spectrum. To calculate this, we introduce an efficient, many-body-physics-inspired method that involves identifying the symmetries of an auxiliary hypergraph state. We compute the classical probability of success for several paradigmatic CSS codes and relate it to both classical statistical mechanics models and to strange correlators of symmetry-protected topological states. We also consider CSS submeasurement games, which can only be won with certainty by sharing the appropriate codeword up to local isometries. These games therefore enable self-testing, which we illustrate explicitly for the 2D toric code. We also discuss how submeasurement games enable an extensive notion of contextuality in many-body states.
Soon after the dawn of quantum error correction, DiVincenzo and Peres observed that stabilizer codewords could give rise to simple proofs of quantumness via contextuality. This discovery can be recast in the language of nonlocal games: every nnn-qubit stabilizer state defines a specific "stabilizer-testing" nnn-player nonlocal game, which quantum players can win with probability one. If quantum players can moreover outperform all possible classical players, then the state is contextual. However, the classical values of stabilizer-testing games are largely unknown for scalable examples beyond the nnn-qubit GHZ state. We introduce several new methods for upper-bounding the classical values of these games. We first prove a general coding-theory bound for all stabilizer-testing games: if the classical value pcl∗<1p_{\mathrm{cl}}^* < 1pcl∗​<1, then pcl∗≤7/8p_{\mathrm{cl}}^* \leq 7/8pcl∗​≤7/8, i.e., there is no classical strategy that can perform as well as the optimal quantum strategy even in an asymptotic sense. We then show how to tighten this bound for the most common scalable examples, namely GHZ, toric-code and cyclic cluster states. In particular, we establish an asymptotically tight upper bound for cyclic cluster states using transfer-matrix methods. This leads to the striking conclusion that measuring an exponentially small fidelity to the cyclic cluster state will suffice to witness its contextuality.
Nonlocal games yield an unusual perspective on entangled quantum states. The defining property of such games is that a set of players in joint possession of an entangled state can win the game with higher probability than is allowed by classical physics. Here we construct a nonlocal game that can be won with certainty by 2N2N2N players if they have access to the ground state of the toric code on as many qubits. By contrast, the game cannot be won by classical players more than half the time in the large NNN limit. Our game differs from previous examples because it arranges the players on a lattice and allows them to carry out quantum operations in teams, whose composition is dynamically specified. This is natural when seeking to characterize the degree of quantumness of nontrivial many-body states, which potentially include states in much more varied phases of matter than the toric code. We present generalizations of the toric code game to states with ZM{\mathbb{Z}}_{M}ZM​ topological order.
The prevailing view is that quantum phenomena can be harnessed to tackle certain problems beyond the reach of classical approaches. Quantifying this capability as a quantum-classical separation and demonstrating it on current quantum processors has remained elusive. Using a superconducting qubit processor, we show that quantum contextuality enables certain tasks to be performed with success probabilities beyond classical limits. With a few qubits, we illustrate quantum contextuality with the magic square game, as well as quantify it through a Kochen--Specker--Bell inequality violation. To examine many-body contextuality, we implement the N-player GHZ game and separately solve a 2D hidden linear function problem, exceeding classical success rate in both. Our work proposes novel ways to benchmark quantum processors using contextuality-based algorithms.
Nonlocal quantum games provide proof of principle that quantum resources can confer advantage at certain tasks. They also provide a compelling way to explore the computational utility of phases of matter on quantum hardware. In a recent manuscript [Hart et al., arXiv:2403.04829] we demonstrated that a toric code resource state conferred advantage at a certain nonlocal game, which remained robust to small deformations of the resource state. In this manuscript we demonstrate that this robust advantage is a generic property of resource states drawn from topological or fracton ordered phases of quantum matter. To this end, we illustrate how several other states from paradigmatic topological and fracton ordered phases can function as resources for suitably defined nonlocal games, notably the three-dimensional toric-code phase, the X-cube fracton phase, and the double-semion phase. The key in every case is to design a nonlocal game that harnesses the characteristic braiding processes of a quantum phase as a source of contextuality. We unify the strategies that take advantage of mutual statistics by relating the operators to be measured to order and disorder parameters of an underlying generalized symmetry-breaking phase transition. Finally, we massively generalize the family of games that admit perfect strategies when codewords of homological quantum error-correcting codes are used as resources.
Bell non-locality is a fundamental feature of quantum mechanics whereby measurements performed on “spatially separated” quantum systems can exhibit correlations that cannot be understood as revealing predetermined values. This is a special case of the more general phenomenon of “quantum contextuality”, which says that such correlations can occur even when the measurements are not necessarily on separate quantum systems, but are merely “compatible” (i.e. commuting). Crucially, while any non-local game yields an experiment that demonstrates quantum advantage by leveraging the “spatial separation” of two or more devices (and in fact several such demonstrations have been conducted successfully in recent years), the same is not true for quantum contextuality: finding the contextuality analogue of such an experiment is arguably one of the central open questions in the foundations of quantum mechanics. In this work, we show that an arbitrary contextuality game can be compiled into an “operational test of contextuality” involving a single quantum device, by only making the assumption that the device is computationally bounded. Our work is inspired by the recent work of Kalai et al. (STOC '23) that converts any non-local game into a classical test of quantum advantage with a single device. The central idea in their work is to use cryptography to enforce spatial separation within subsystems of a single quantum device. Our work can be seen as using cryptography to enforce “temporal separation”, i.e. to restrict communication between sequential measurements. Beyond contextuality, we employ our ideas to design a “proof of quantumness” that, to the best of our knowledge, is arguably even simpler than the ones proposed in the literature so far.
Bell theorems of many-body nonlocality and contextuality serve as a benchmark for proving quantum advantage in that a quantum computer outperforms a classical computer for a certain problem. In practice, however, near-term quantum devices do not prepare perfectly pure states but rather mixed states produced from noisy channels. We investigate noisy quantum advantage by considering thermal mixed states of one-dimensional many-body systems with a symmetry-protected topological (SPT) order. In the pure-state (or zero-temperature) case, these states are known to be useful for measurement-based quantum computation, and to outperform classical computers in a many-body contextuality game, provided string order parameters (SOPs) of SPT are sufficiently large. Here, we show that quantum advantage in mixed states is measured by a combination of twisted SOP and symmetry representation expectation values. Using the minimally entangled typical thermal states algorithm, it is demonstrated that quantum advantage persists to a nonzero critical temperature for finite-sized instances of the many-body contextuality game. While this critical temperature goes to zero in the thermodynamic limit, it is relatively robust to system size, suggesting that these states remain useful for demonstrating genuine "quantumness" of noisy hardware in a scalable fashion. Finally, we show that the quantum winning probability is lower bounded by the global fidelity with the 1D cluster state, so that our contextuality game can provide an operational meaning to benchmark the capacity to create long-range order like SPT states in near-term experimental devices.