Entanglement as a Strategic Resource in Adversarial Quantum Games

• URL: http://arxiv.org/abs/2510.22444v1
• Date: Sat, 25 Oct 2025 22:05:11 GMT
• Title: Entanglement as a Strategic Resource in Adversarial Quantum Games
• Authors: Sinan Bugu,
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum game theory naturally extends classical strategic decision-making by leveraging quantum superposition, entanglement, and measurement-based pay offs. 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. Unlike classical models, quantum teams can capitalize on entanglement-assisted coordination, enabling correlated sabotage actions that provide a decisive edge in unpredictability and strategic deception. We establish a formal quantum game-theoretic model and derive the Quantum Nash Equilib rium (QNE) conditions for multi-agent interactions. Our approach uses computa tional simulations to directly compare classical and quantum strategic efficiency under ideal conditions, standard quantum noise models, and noise profiles calibrated from real IBM Quantum hardware. Our analysis specifically com pares teams of equivalent size: two-player classical (2C) versus Bell-state (2Q) teams, and three-player classical (3C) versus W-state (3Q) teams. Our results indicate that W-state entanglement significantly enhances both defensive coordi nation and sabotage effectiveness, consistently outperforming standard classical strategies and Bell-state coordination schemes. This quantum advantage is shown to be resilient, persisting even when subjected to realistic hardware noise models. These findings have direct implications for quantum-enhanced cybersecu rity, adversarial artificial intelligence, and multi-agent quantum decision-making, thereby paving the way for practical applications of quantum game theory in competitive environments

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)
• Classical Simulation of Quantum CSP Strategies [2.7998963147546148]
  We prove that any perfect quantum strategy for the two-prover game encoding a constraint satisfaction problem can be simulated via a perfect classical strategy.<n>A key intermediate step of our proof is to establish that the gap between the classical chromatic number of graphs and its quantum variant is bounded when the quantum strategy involves shared quantum information of bounded size.
  arXiv  Detail & Related papers  (2025-03-29T20:06:50Z)
• 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)
• Quantum Gate Optimization for Rydberg Architectures in the Weak-Coupling Limit [55.05109484230879]
  We demonstrate machine learning assisted design of a two-qubit gate in a Rydberg tweezer system. We generate optimal pulse sequences that implement a CNOT gate with high fidelity. We show that local control of single qubit operations is sufficient for performing quantum computation on a large array of atoms.
  arXiv  Detail & Related papers  (2023-06-14T18:24:51Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• 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)
• Quantum version of a generalized Monty Hall game and its possible applications to quantum secure communications [0.0]
  We propose a quantum version of a generalized Monty Hall game, in which the parameters of the game are left free, and not fixed on its regular values. We extend our quantum scheme to include multiple independent players, and use this extension to sketch two possible application of the game mechanics to quantum networks.
  arXiv  Detail & Related papers  (2020-10-26T17:57:12Z)
• 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)

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.