Centipedes Leap into the Quantum Realm

• URL: http://arxiv.org/abs/2511.20690v1
• Date: Fri, 21 Nov 2025 21:30:02 GMT
• Title: Centipedes Leap into the Quantum Realm
• Authors: Kaytki Chakankar, Xinhui Tang, Yiguo Zhang,
• Abstract summary: The centipede game is a two-player non-zero-sum game.<n>Each turn, a player can choose whether they want to take or pass a growing reward.<n>The classical, rational solution of this game shows defection in the first round, when in reality, players cooperate much more often.<n>We show that when similar quantum mechanics principles are applied to the centipede game, it leads to two new quantum Nash equilibria that are superior to the classical solution.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The centipede game is a two-player non-zero-sum game. Each turn, a player can choose whether they want to take or pass a growing reward. The classical, rational solution of this game shows defection in the first round, when in reality, players cooperate much more often. Inspired by prior work employing quantum strategies in the prisoners dilemma, we showed that when similar quantum mechanics principles are applied to the centipede game, it leads to two new quantum Nash equilibria that are superior to the classical solution. Furthermore, by implementing our algorithm on Qiskit, we confirmed that leveraging quantum strategies, rather than strategies like backward induction, to solve the centipede game provided better payoffs for both players and more accurately modeled the games real-life outcomes. Ultimately, we propose a generalized conjecture for similarly structured quantum games.

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)
• 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)
• Quantum Bayesian Games [0.09208007322096534]
  We apply a Bayesian agent-based framework inspired by QBism to iterations of two quantum games, the CHSH game and the quantum prisoners' dilemma. In each two-player game, players hold beliefs about an amount of shared entanglement and about the actions or beliefs of the other player. We simulate iterated play to see if and how players can learn about the presence of shared entanglement and to explore how their performance, their beliefs, and the game's structure interrelate.
  arXiv  Detail & Related papers  (2024-08-04T15:15:42Z)
• 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)
• Exploiting Finite Geometries for Better Quantum Advantages in Mermin-Like Games [0.0]
  Quantum games embody non-intuitive consequences of quantum phenomena, such as entanglement and contextuality. In this paper we look at the geometric structure behind such classical strategies, and borrow ideas from the geometry of symplectic polar spaces to maximise this quantum advantage.
  arXiv  Detail & Related papers  (2024-03-14T15:56:43Z)
• Repeated quantum game as a stochastic game: Effects of the shadow of the future and entanglement [0.0]
  We present a systematic investigation of the quantum games, constructed using a novel repeated game protocol. We find that how two pure strategies fare against each other is crucially dependent on the discount factor. In the quantum game setup, always-defect strategy can be beaten by the tit-for-tat strategy for high enough discount factor.
  arXiv  Detail & Related papers  (2023-12-08T15:54:51Z)
• A Quadratic Speedup in Finding Nash Equilibria of Quantum Zero-Sum Games [95.50895904060309]
  We introduce the Optimistic Matrix Multiplicative Weights Update (OMMWU) algorithm and establish its average-iterate convergence complexity as $mathcalO(d/epsilon)$ to $epsilon$-Nash equilibria.<n>This quadratic speed-up sets a new benchmark for computing $epsilon$-Nash equilibria in quantum zero-sum games.
  arXiv  Detail & Related papers  (2023-11-17T20:38:38Z)
• 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)
• Abstracting Imperfect Information Away from Two-Player Zero-Sum Games [85.27865680662973]
  Nayyar et al. (2013) showed that imperfect information can be abstracted away from common-payoff games by having players publicly announce their policies as they play. This work shows that certain regularized equilibria do not possess the aforementioned non-correspondence problem. Because these regularized equilibria can be made arbitrarily close to Nash equilibria, our result opens the door to a new perspective to solving two-player zero-sum games.
  arXiv  Detail & Related papers  (2023-01-22T16:54:06Z)
• Solving diner's dilemma game, circuit implementation, and verification on IBMQ simulator [0.0]
  We find the quantum strategy that gives maximum payoff for each diner without affecting the payoff and strategy of others. We present the circuit implementation for the game, design it on the IBM quantum simulator and verify the strategies in the quantum model.
  arXiv  Detail & Related papers  (2020-10-24T08:49:28Z)
• Infinitely Repeated Quantum Games and Strategic Efficiency [0.0]
  Repeated quantum game theory addresses long term relations among players who choose quantum strategies. In the conventional quantum game theory, single round quantum games or at most finitely repeated games have been widely studied.
  arXiv  Detail & Related papers  (2020-05-12T07:39:42Z)

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.