Many-body contextuality and self-testing quantum matter via nonlocal games
- URL: http://arxiv.org/abs/2512.16886v1
- Date: Thu, 18 Dec 2025 18:50:09 GMT
- Title: Many-body contextuality and self-testing quantum matter via nonlocal games
- Authors: Oliver Hart, David T. Stephen, Evan Wickenden, Rahul Nandkishore,
- Abstract summary: Contextuality is arguably the fundamental property that makes quantum mechanics different from classical physics.<n>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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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.
Related papers
- Quantum Visual Word Sense Disambiguation: Unraveling Ambiguities Through Quantum Inference Model [51.75804843502132]
This paper proposes a Quantum Inference Model for Unsupervised Visual Word Sense Disambiguation (Q-VWSD)<n>It encodes multiple glosses of the target word into a superposition state to mitigate semantic biases.<n>By formalizing our method, we find that Q-VWSD is a quantum generalization of the method based on classical probability.
arXiv Detail & Related papers (2025-12-31T07:47:14Z) - Quantum-Classical Separation in Bounded-Resource Tasks Arising from Measurement Contextuality [107.84586711462556]
We show that quantum contextuality enables certain tasks to be performed with success probabilities beyond classical limits.<n>Our work proposes novel ways to benchmark quantum processors using contextuality-based algorithms.
arXiv Detail & Related papers (2025-12-01T23:54:32Z) - A Game-Theoretic Quantum Algorithm for Solving Magic Squares [2.09260520196733]
We present a variational framework for the Magic Square Game (MSG), a two-player non-local game with perfect quantum advantage.<n>We construct a value Hamiltonian that encodes the game's parity and consistency constraints, then optimize parameterized quantum circuits to minimize this cost.
arXiv Detail & Related papers (2025-05-19T17:12:53Z) - Braiding for the win: Harnessing braiding statistics in topological states to win quantum games [0.23301643766310368]
Nonlocal quantum games provide proof of principle that quantum resources can confer advantage at certain tasks.<n>We show that a toric code resource state conferred advantage at a certain nonlocal game, which remained robust to small deformations of the resource state.<n>We show how several other states from paradigmatic topological and fracton ordered phases can function as resources for suitably defined nonlocal games.
arXiv Detail & Related papers (2024-12-18T19:30:30Z) - A bound on the quantum value of all compiled nonlocal games [49.32403970784162]
A cryptographic compiler converts any nonlocal game into an interactive protocol with a single computationally bounded prover.<n>We establish a quantum soundness result for all compiled two-player nonlocal games.
arXiv Detail & Related papers (2024-08-13T08:11:56Z) - Photonic implementation of the quantum Morra game [69.65384453064829]
We study a faithful translation of a two-player quantum Morra game, which builds on previous work by including the classical game as a special case.
We propose a natural deformation of the game in the quantum regime in which Alice has a winning advantage, breaking the balance of the classical game.
We discuss potential applications of the quantum Morra game to the study of quantum information and communication.
arXiv Detail & Related papers (2023-11-14T19:41:50Z) - Experimental Demonstration of Quantum Pseudotelepathy [8.366359388178546]
We report a faithful experimental demonstration of quantum pseudotelepathy via playing the non-local version of Mermin-Peres magic square game.
We adopt the hyperentanglement scheme and prepare photon pairs entangled in both the polarization and the orbital angular momentum degrees of freedom.
Our results show that quantum players can simultaneously win all the queries over any classical strategy.
arXiv Detail & Related papers (2022-06-24T02:35:55Z) - Surpassing the Classical Limit in Magic Square Game with Distant Quantum
Dots Coupled to Optical Cavities [0.0]
We propose an experimental setup for quantum computation with quantum dots inside optical cavities.
Considering various physical imperfections of our setup, we first show that the MSG can be implemented with the current technology.
We show that our work gives rise to a new version of the game. That is, if the referee has information on the physical realization and strategy of the players, he can bias the game through filtered randomness and increase his winning probability.
arXiv Detail & Related papers (2020-11-03T05:45:06Z) - Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel.
We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries.
We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
arXiv Detail & Related papers (2020-10-15T17:55:31Z) - Operational Resource Theory of Imaginarity [48.7576911714538]
We show that quantum states are easier to create and manipulate if they only have real elements.
As an application, we show that imaginarity plays a crucial role for state discrimination.
arXiv Detail & Related papers (2020-07-29T14:03:38Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.