A multi-player, multi-team nonlocal game for the toric code

• URL: http://arxiv.org/abs/2205.12251v2
• Date: Fri, 13 Jan 2023 21:16:44 GMT
• Title: A multi-player, multi-team nonlocal game for the toric code
• Abstract summary: Nonlocal games yield an unusual perspective on entangled quantum states. We construct a nonlocal game that can be won with certainty by $2N$ players. We present generalizations of the toric code game to states with $mathbbZ_M$ topological order.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 non-trivial 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.

Related papers

• Quantum non-local games: Quantum relations, projection lattices and rule operators [51.56484100374058]
  (mathcal R)-projection-test quantum games with finite-dimensional input and output von Neumann algebras.<n>(mathcal R)-projection-test quantum games with finite-dimensional input and output von Neumann algebras.<n>(mathcal R)-projection-test quantum games with finite-dimensional input and output von Neumann algebras.<n>(mathcal R)-projection-test quantum games with finite-dimensional input and output von Neumann algebras.
  arXiv  Detail & Related papers  (2026-08-31T09:41:14Z)
• Many-body contextuality and self-testing quantum matter via nonlocal games [0.0]
  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.
  arXiv  Detail & Related papers  (2025-12-18T18:50:09Z)
• Scalable tests of quantum contextuality from stabilizer-testing nonlocal games [3.5042105444738767]
  DiVincenzo and Peres observed that stabilizer codewords could give rise to simple proofs of quantumness via contextuality.<n>Every $n$-qubit stabilizer state defines a specific "stabilizer-testing" $n$-player nonlocal game.<n>We show how to tighten this bound for the most common scalable examples, namely GHZ, toric-code and cyclic cluster states.
  arXiv  Detail & Related papers  (2025-12-18T15:25:18Z)
• 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 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. We establish a quantum soundness result for all compiled two-player nonlocal games.
  arXiv  Detail & Related papers  (2024-08-13T08:11:56Z)
• Imperfect-Recall Games: Equilibrium Concepts and Their Complexity [74.01381499760288]
  We investigate optimal decision making under imperfect recall, that is, when an agent forgets information it once held before. In the framework of extensive-form games with imperfect recall, we analyze the computational complexities of finding equilibria in multiplayer settings.
  arXiv  Detail & Related papers  (2024-06-23T00:27:28Z)
• Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence Beyond the Minty Property [89.96815099996132]
  We develop a new framework to characterize optimistic policy gradient methods in multi-player games with a single controller. Our approach relies on a natural generalization of the classical Minty property that we introduce, which we anticipate to have further applications beyond Markov games.
  arXiv  Detail & Related papers  (2023-12-19T11:34:10Z)
• 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)
• Quantum Tapsilou -- a quantum game inspired from the traditional Greek coin tossing game tapsilou [0.0]
  This paper introduces a new quantum game called Quantum Tapsilou. It is inspired by the classical traditional Greek coin tossing game tapsilou. The two most important novelties of Quantum Tapsilou can be attributed to its implementation of entanglement.
  arXiv  Detail & Related papers  (2023-09-03T16:45:16Z)
• On the power of quantum entanglement in multipartite quantum XOR games [3.655021726150368]
  In particular, quantum entanglement can be a much more powerful resource than local operations and classical communication to play these games. This result shows a strong contrast to the bipartite case, where it was recently proved that the entangled bias is always upper bounded by a universal constant times the one-way classical communication bias.
  arXiv  Detail & Related papers  (2023-02-23T06:26:37Z)
• Decidability of fully quantum nonlocal games with noisy maximally entangled states [5.076419064097734]
  This paper considers the decidability of fully quantum nonlocal games with noisy maximally entangled states. We prove that there is a computable upper bound on the copies of noisy maximally entangled states for the players to win a fully quantum nonlocal game with a probability arbitrarily close to the quantum value.
  arXiv  Detail & Related papers  (2022-11-19T08:11:02Z)
• Are AlphaZero-like Agents Robust to Adversarial Perturbations? [73.13944217915089]
  AlphaZero (AZ) has demonstrated that neural-network-based Go AIs can surpass human performance by a large margin. We ask whether adversarial states exist for Go AIs that may lead them to play surprisingly wrong actions. We develop the first adversarial attack on Go AIs that can efficiently search for adversarial states by strategically reducing the search space.
  arXiv  Detail & Related papers  (2022-11-07T18:43:25Z)
• Learning Correlated Equilibria in Mean-Field Games [62.14589406821103]
  We develop the concepts of Mean-Field correlated and coarse-correlated equilibria. We show that they can be efficiently learnt in emphall games, without requiring any additional assumption on the structure of the game.
  arXiv  Detail & Related papers  (2022-08-22T08:31:46Z)
• 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)
• Complexity limitations on one-turn quantum refereed games [0.6091702876917281]
  The paper studies theoretic aspects of quantum refereed games. The abstract games are between two competing players that send quantum states to a referee. The referee performs an efficiently implementable joint measurement on the two states to determine which of the player wins.
  arXiv  Detail & Related papers  (2020-02-04T19:28:03Z)

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.