QEGS: A Mathematica Package for the Analysis of Quantum Extended Games

• URL: http://arxiv.org/abs/2505.00714v1
• Date: Wed, 16 Apr 2025 11:43:01 GMT
• Title: QEGS: A Mathematica Package for the Analysis of Quantum Extended Games
• Authors: Krzysztof Grzanka, Anna Gorczyca-Goraj, Piotr Frąckiewicz, Marek Szopa,
• Abstract summary: Quantum games have attracted much attention in recent years due to their ability to solve decision-making dilemmas.<n>This study introduces a Mathematica package dedicated to the study of quantum extensions of classical $2times2$ games based on the EWL scheme.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum games have attracted much attention in recent years due to their ability to solve decision-making dilemmas. The aim of this study is to extend previous work on quantum games by introducing a Mathematica package QEGS (Quantum Extension Game Solver) dedicated to the study of quantum extensions of classical $2\times2$ games based on the EWL scheme. The package generates all possible game extensions with one or two unitary strategies, which are invariant with respect to isomorphic transformations of the initial games. The package includes a number of functions to study these extensions, such as determining their Nash equilibria in pure strategies, eliminating dominated strategies, or computing maximin strategies. Independently of quantum extensions, these functions can also be used to analyze classical games. Reporting to a pdf is available. The discussion includes an outline of future research directions, such as the exploration of mixed-strategy Nash equilibria and potential real-world applications in fields like quantum computing and secure communications.

Related papers

• A Game-Theoretic Quantum Algorithm for Solving Magic Squares [2.09260520196733]
  We present a variational framework for the Magic Square Game (MSG), a two-player non-local game with perfect quantum advantage.<n>We construct a value Hamiltonian that encodes the game's parity and consistency constraints, then optimize parameterized quantum circuits to minimize this cost.
  arXiv  Detail & Related papers  (2025-05-19T17:12:53Z)
• A Survey of Quantum Transformers: Architectures, Challenges and Outlooks [82.4736481748099]
  Quantum Transformers integrate the representational power of classical Transformers with the computational advantages of quantum computing.<n>Since 2022, research in this area has rapidly expanded, giving rise to diverse technical paradigms and early applications.<n>This paper presents the first comprehensive, systematic, and in-depth survey of quantum Transformer models.
  arXiv  Detail & Related papers  (2025-04-04T05:40:18Z)
• 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)
• Permissible extensions of classical to quantum games combining three strategies [0.0]
  We study the extension of classical games to the quantum domain. We use the obtained results to extend the classical Prisoner's Dilemma game to a quantum game.
  arXiv  Detail & Related papers  (2024-04-09T10:38:10Z)
• 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)
• Quantumizing Classical Games: An Introduction to Quantum Game Theory [2.023315598404668]
  We give a concise and self-contained introduction to the theory of Quantum Games by reviewing the seminal works of Meyer, Eisert-Wilkens-Lewenstein, Marinatto-Weber and Landsburg. We formulate a protocol to $textitQuantumize$ any finite classical $n$-player game, and use a novel approach of describing such a Quantum Game in terms of commuting Payoff Operators.
  arXiv  Detail & Related papers  (2023-04-30T02:14:09Z)
• 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)
• 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)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)

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.