Nonlocal Games as Cross-Platform Quantum Benchmarks: Exceeding unconditional classical bounds on trapped-ion processors

• URL: http://arxiv.org/abs/2603.18323v1
• Date: Wed, 18 Mar 2026 22:14:12 GMT
• Title: Nonlocal Games as Cross-Platform Quantum Benchmarks: Exceeding unconditional classical bounds on trapped-ion processors
• Abstract summary: Nonlocal games provide application-level benchmarks for quantum hardware whose classical performance bounds are information-theoretic.<n>We implement a 14-vertex graph coloring game, the smallest graph exhibiting a quantum-classical separation for this game type, on four trapped-ion quantum processors across three institutions.<n>One system achieved a win rate that surpasses the classical bound with statistical significance, marking the first violation of a classical bound in a graph coloring nonlocal game on quantum hardware.
• Score: 26.481826861716367
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Nonlocal games provide application-level benchmarks for quantum hardware whose classical performance bounds are information-theoretic, holding against all classical strategies regardless of computational resources. We implement a 14-vertex graph coloring game, the smallest graph exhibiting a quantum-classical separation for this game type, on four trapped-ion quantum processors across three institutions. One system achieved a win rate that surpasses the classical bound with statistical significance, marking the first violation of a classical bound in a graph coloring nonlocal game on quantum hardware. The remaining systems achieved win rates comparable to the best superconducting processors evaluated on the same game, further illustrating the potential of nonlocal games as cross-architecture quantum benchmarks.

Related papers

• 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)
• Entanglement as a Strategic Resource in Adversarial Quantum Games [0.0]
  Quantum game theory naturally extends classical strategic decision-making by leveraging quantum superposition, entanglement, and measurement-based pay offs.<n>This paper introduces a novel team-based Quantum Sabotage Game (QSG), where two competing teams, one classical and one quantum-enhanced, engage in adversarial strategies.
  arXiv  Detail & Related papers  (2025-10-25T22:05:11Z)
• 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)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• 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)
• Application-level Benchmarking of Quantum Computers using Nonlocal Game Strategies [1.4835379864550937]
  In nonlocal games, two players cooperate to convince a referee that they possess a strategy that does not violate the rules of the game.<n>We present a variational quantum algorithm to compute quantum strategies for nonlocal games by encoding the rules of a nonlocal game into a Hamiltonian.
  arXiv  Detail & Related papers  (2023-11-02T16:17:18Z)
• A quantum advantage over classical for local max cut [48.02822142773719]
  Quantum optimization approximation algorithm (QAOA) has a computational advantage over comparable local classical techniques on degree-3 graphs. Results hint that even small-scale quantum computation, which is relevant to the current state-of the art quantum hardware, could have significant advantages over comparably simple classical.
  arXiv  Detail & Related papers  (2023-04-17T16:42:05Z)
• On the relation between completely bounded and $(1,cb)$-summing maps with applications to quantum XOR games [65.51757376525798]
  We show that given a linear map from a general operator space into the dual of a C$*$-algebra, its completely bounded norm is upper bounded by a universal constant times its $(''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''
  arXiv  Detail & Related papers  (2021-12-09T21:06:52Z)
• Synchronicity for quantum non-local games [0.7646713951724009]
  We show that quantum homomorphisms of quantum graphs can be viewed as entanglement assisted classical homomorphisms of the graphs. We give descriptions of the perfect quantum commuting and the perfect approximately quantum strategies for the quantum graph homomorphism game.
  arXiv  Detail & Related papers  (2021-06-22T02:40:41Z)
• 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)
• Board Games for Quantum Computers [0.0]
  We generalize board games such as Five in a Row (or gomoku) and weiqi (or go) There are three different schemes to play the quantized games: one quantum computer with another quantum computer (QwQ), two classical computer playing with each other on one quantum computer (CQC) We illustrate these results with the games of Five in a Row and weiqi.
  arXiv  Detail & Related papers  (2020-04-17T14:38:10Z)

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.