Quantization of two- and three-player cooperative games based on QRA

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F24%3APU152291" target="_blank" >RIV/00216305:26210/24:PU152291 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.google.iopscience.iop.org/article/10.1088/1751-8121/ad7c9c" target="_blank" >https://www.google.iopscience.iop.org/article/10.1088/1751-8121/ad7c9c</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1088/1751-8121/ad7c9c" target="_blank" >10.1088/1751-8121/ad7c9c</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Quantization of two- and three-player cooperative games based on QRA

Popis výsledku v původním jazyce

In this paper, a novel quantization scheme for cooperative games is proposed. The circuit is inspired by the Eisert-Wilkens-Lewenstein protocol, which was 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 (QRA) to represent circuits. This analogy enables us to perform automated proofs of the circuit equivalence in a simple fashion. The expected value of the Shapley value concerning quantum probabilities is employed to distribute players' payoffs after the measurement. We study how entanglement, representing the level of pre-agreement between players, affects the final utility distribution. The paper also demonstrates how the QRA and GAALOP software can automate all necessary calculations.

Název v anglickém jazyce

Quantization of two- and three-player cooperative games based on QRA

Popis výsledku anglicky

In this paper, a novel quantization scheme for cooperative games is proposed. The circuit is inspired by the Eisert-Wilkens-Lewenstein protocol, which was 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 (QRA) to represent circuits. This analogy enables us to perform automated proofs of the circuit equivalence in a simple fashion. The expected value of the Shapley value concerning quantum probabilities is employed to distribute players' payoffs after the measurement. We study how entanglement, representing the level of pre-agreement between players, affects the final utility distribution. The paper also demonstrates how the QRA and GAALOP software can automate all necessary calculations.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10102 - Applied mathematics

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2024

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Journal of Physics A: Mathematical and Theoretical

ISSN

1751-8113

e-ISSN

1751-8121

Svazek periodika

57

Číslo periodika v rámci svazku

42

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

24

Strana od-do

1-24

Kód UT WoS článku

001324076000001

EID výsledku v databázi Scopus

2-s2.0-85205566968