2024/11/03 by Piotr Frąckiewicz, Frąckiewicz, Piotr, Anna Gorczyca–Goraj +6
Computer Science · Physics and Astronomy · #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.2411.01711
openalex publication_date 2024/11/03 · openalex created_date 2024/11/14 · openalex updated_date 2026/07/28
This paper investigates Nash equilibria in pure strategies for quantum approach to the Prisoner's Dilemma. The quantization process involves extending the classical game by introducing two additional unitary strategies. We consider five classes of such quantum games, which remain invariant under isomorphic transformations of the classical game. For each class, we identify and analyse all possible Nash equilibria. Our results reveal the complexity and diversity of strategic behaviour in the quantum setting, providing new insights into the dynamics of classical decision-making dilemmas. In the case of the standard Prisoner's Dilemma, the resulting Nash equilibria of quantum extensions are found to be closer to Pareto optimal solutions than those of the classical equilibrium.