Complex Clifford algebra in repeated quantum prisoner's dilemma

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F24%3APU145521" target="_blank" >RIV/00216305:26210/24:PU145521 - isvavai.cz</a>
Result on the web
<a href="https://onlinelibrary.wiley.com/doi/full/10.1002/mma.8694" target="_blank" >https://onlinelibrary.wiley.com/doi/full/10.1002/mma.8694</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/mma.8694" target="_blank" >10.1002/mma.8694</a>

Result language
angličtina
Original language name
Complex Clifford algebra in repeated quantum prisoner's dilemma
Original language description
This paper introduces an application of complex Clifford algebra in a representation of the quantum prisoner's dilemma. The authors propose a novel modification of the Eisert-Lewenstein-Wilkens protocol to represent a repeated version of the quantum game. This repeated modification allows to embed entanglement into players' strategy sets and to see how players will operate with it. The apparatus of complex Clifford algebra enables an intuitive representation of the suggested protocol and efficient computation of the resulting payoff functions. The presented findings provide a new point of view on the interpretation of entanglement as a measure of information transition between rounds of the game.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10102 - Applied mathematics

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

Similar results(10)