Publication detail

Complex Clifford algebra in repeated quantum prisoner's dilemma

ERYGANOV, I. HRDINA, J.

Original Title

Complex Clifford algebra in repeated quantum prisoner's dilemma

Type

journal article in Web of Science

Language

English

Original Abstract

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.

Keywords

Clifford algebra; entanglement; prisoner's dilemma; quantum games; repeated games

Authors

ERYGANOV, I.; HRDINA, J.

Released

1. 2. 2024

Publisher

WILEY

Location

HOBOKEN

ISBN

1099-1476

Periodical

Mathematical Methods in the Applied Sciences

Year of study

47

Number

3

State

United Kingdom of Great Britain and Northern Ireland

Pages from

1442

Pages to

1456

Pages count

15

URL

https://onlinelibrary.wiley.com/doi/full/10.1002/mma.8694

BibTex

@article{BUT179122,
  author="Ivan {Eryganov} and Jaroslav {Hrdina}",
  title="Complex Clifford algebra in repeated quantum prisoner's dilemma",
  journal="Mathematical Methods in the Applied Sciences",
  year="2024",
  volume="47",
  number="3",
  pages="1442--1456",
  doi="10.1002/mma.8694",
  issn="1099-1476",
  url="https://onlinelibrary.wiley.com/doi/full/10.1002/mma.8694"
}