Quantization of Two- and Three-player Cooperative Games Based on QRA

• URL: http://arxiv.org/abs/2310.18067v1
• Date: Fri, 27 Oct 2023 11:30:53 GMT
• Title: Quantization of Two- and Three-player Cooperative Games Based on QRA
• Abstract summary: The framework of Clifford algebra is used to perform necessary computations. We study how entanglement, representing the level of pre-agreement between players, affects the final distribution of utility.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this paper, a novel quantization scheme for cooperative games is proposed. The considered circuit is inspired by the Eisert-Wilkens-Lewenstein protocol modified to represent cooperation between players and extended to $3$-qubit states. The framework of Clifford algebra is used to perform necessary computations. In particular, we use a direct analogy between Dirac formalism and Quantum Register Algebra to represent circuits. This analogy enables us to perform automated proofs of the circuit equivalence in a simple fashion. To distribute players' payoffs after the measurement, the expected value of the Shapley value with respect to quantum probabilities is employed. We study how entanglement, representing the level of pre-agreement between players, affects the final distribution of utility. The paper also demonstrates how all necessary calculations can be automatized using the Quantum Register Algebra and GAALOP software.

Related papers

• Quantum non-local games: Quantum relations, projection lattices and rule operators [51.56484100374058]
  (mathcal R)-projection-test quantum games with finite-dimensional input and output von Neumann algebras.<n>(mathcal R)-projection-test quantum games with finite-dimensional input and output von Neumann algebras.<n>(mathcal R)-projection-test quantum games with finite-dimensional input and output von Neumann algebras.<n>(mathcal R)-projection-test quantum games with finite-dimensional input and output von Neumann algebras.
  arXiv  Detail & Related papers  (2026-08-31T09:41:14Z)
• One Qubit Can Beat One Bit: Quantum Advantage for Post-Training Quantization [7.09016563801433]
  One-bit post-training quantization represents each weight using only its sign, requiring all deployment contexts to share the same binary weight matrix.<n>We study this shared-sign constraint and introduce Quantum Random Access Quantization (QRAQ)<n>This framework encodes context-dependent signs in a quantum random-access code and retrieves them via context-matched Pauli measurements.
  arXiv  Detail & Related papers  (2026-08-05T14:04:50Z)
• Parametric Open Source Games [78.29352305480285]
  We introduce parametric open-source games, a continuous analogue of program equilibria.<n>We derive an exact coupling threshold at which selfish gradient ascent in symmetric $2times2$ games switches from defection toward cooperation.<n>We extend the framework to a neural semantics class whose first-order cooperation condition is governed by the ratio of cross-player to self-player sensitivity.
  arXiv  Detail & Related papers  (2026-06-25T14:14:24Z)
• Multi-agent imitation learning with function approximation: Linear Markov games and beyond [63.14746189846806]
  We present the first theoretical analysis of multi-agent imitation learning (MAIL) in linear Markov games.<n>We show that it is possible to replace the state-action level "all policy deviation concentrability coefficient" with a concentrability coefficient defined at the feature level.<n>We propose a deep MAIL interactive algorithm which clearly outperforms BC on games such as Tic-Tac-Toe and Connect4.
  arXiv  Detail & Related papers  (2026-02-26T09:50:15Z)
• Commuting Embeddings for Parallel Strategies in Non-local Games [1.6312989763677892]
  Non-local games provide a versatile framework for probing quantum correlations.<n>In finite dimensions, the standard method for playing several games in parallel requires a tensor product of the local Hilbert spaces.<n>We show that this additive cost can be reduced by exploiting algebraic embeddings.
  arXiv  Detail & Related papers  (2025-10-17T21:00:09Z)
• Shapley Machine: A Game-Theoretic Framework for N-Agent Ad Hoc Teamwork [25.31548780542065]
  We aim to investigate a recently proposed problem for open multi-agent systems, referred as n-agent ad hoc teamwork (NAHT)<n>Existing methods tend to be based on design and consequently lack theoretical rigor and ambiguous credit assignment among agents.<n>To address these limitations, we model and solve NAHT through the lens of cooperative game theory.
  arXiv  Detail & Related papers  (2025-06-12T20:44:09Z)
• Classical analog circuit emulation of quantum Grover search algorithm [0.0]
  We construct a completely analog framework that emulates universal quantum gates and quantum algorithms.<n>In these circuits, input and output lines represent the computational basis states (CBSs) and thus $2n$ lines are required to represent $n$ qubits.<n>The framework can emulate entangled states and is free from decoherence, measurements are classical and do not collapse states.
  arXiv  Detail & Related papers  (2025-06-06T19:51:28Z)
• 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 Shapley Value Estimation Speedup for Efficient Explainable Quantum AI [0.8739101659113155]
  In classical contexts, the cooperative game theory concept of the Shapley value adapts naturally to post-hoc explanations. We propose quantum algorithms that can extract Shapley values within some confidence interval.
  arXiv  Detail & Related papers  (2024-12-19T08:50:46Z)
• Transfer of quantum game strategies [0.0]
  We show a new class of QNS correlations needed for the transfer of strategies between games. We define jointly tracial correlations and show they correspond to traces acting on tensor products of canonical $rm C*$-algebras associated with individual game parties.
  arXiv  Detail & Related papers  (2024-10-12T17:25:58Z)
• 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)
• Exploring quantum weight enumerators from the $n$-qubit parallelized SWAP test [19.183393329155567]
  We build the connection between quantum weight enumerators and the $n$-qubit parallelized SWAP test. We find that each shadow enumerator corresponds precisely to a probability in the $n$-qubit parallelized SWAP test. For applications, we employ the $n$-qubit parallelized SWAP test to determine the distances of quantum error-correcting codes.
  arXiv  Detail & Related papers  (2024-06-26T12:06:40Z)
• Equivalence Checking of Quantum Circuits by Model Counting [0.0]
  This paper gives a Turing reduction of the (universal) quantum circuits equivalence problem to weighted model counting (WMC) With an open-source implementation, we demonstrate that this novel approach can outperform a state-of-the-art equivalence-checking tool based on ZX calculus and decision diagrams.
  arXiv  Detail & Related papers  (2024-03-27T17:58:20Z)
• A Quadratic Speedup in Finding Nash Equilibria of Quantum Zero-Sum Games [102.46640028830441]
  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. 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)
• Schrödinger as a Quantum Programmer: Estimating Entanglement via Steering [3.187381965457262]
  We develop a quantum algorithm that tests for and quantifies the separability of a general bipartite state by using the quantum steering effect. Our findings provide a meaningful connection between steering, entanglement, quantum algorithms, and quantum computational complexity theory.
  arXiv  Detail & Related papers  (2023-03-14T13:55:06Z)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• Learning Correlated Equilibria in Mean-Field Games [62.14589406821103]
  We develop the concepts of Mean-Field correlated and coarse-correlated equilibria. We show that they can be efficiently learnt in emphall games, without requiring any additional assumption on the structure of the game.
  arXiv  Detail & Related papers  (2022-08-22T08:31:46Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• 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.