Efficiency and formalism of quantum games

Chiu Fan Lee, Neil F Johnson

Research output: Contribution to journalArticle

54 Citations (Scopus)

Abstract

A study was performed to demonstrate that playing games quantum mechanically can be more efficient. A saturated upper bound on the efficiency was given. Furthermore, it was shown that finite classical games consist of a strict subset of finite quantum games. The formalism also allowed to compute Nash equilibria efficiently in some cases.

Original languageEnglish (US)
JournalPhysical Review A - Atomic, Molecular, and Optical Physics
Volume67
Issue number2
StatePublished - Feb 2003
Externally publishedYes

Fingerprint

games
formalism
set theory

ASJC Scopus subject areas

  • Atomic and Molecular Physics, and Optics
  • Physics and Astronomy(all)

Cite this

Efficiency and formalism of quantum games. / Lee, Chiu Fan; Johnson, Neil F.

In: Physical Review A - Atomic, Molecular, and Optical Physics, Vol. 67, No. 2, 02.2003.

Research output: Contribution to journalArticle

@article{1cc6b8eec4b749dc80d60c7c5ad52605,
title = "Efficiency and formalism of quantum games",
abstract = "A study was performed to demonstrate that playing games quantum mechanically can be more efficient. A saturated upper bound on the efficiency was given. Furthermore, it was shown that finite classical games consist of a strict subset of finite quantum games. The formalism also allowed to compute Nash equilibria efficiently in some cases.",
author = "Lee, {Chiu Fan} and Johnson, {Neil F}",
year = "2003",
month = "2",
language = "English (US)",
volume = "67",
journal = "Physical Review A",
issn = "2469-9926",
publisher = "American Physical Society",
number = "2",

}

TY - JOUR

T1 - Efficiency and formalism of quantum games

AU - Lee, Chiu Fan

AU - Johnson, Neil F

PY - 2003/2

Y1 - 2003/2

N2 - A study was performed to demonstrate that playing games quantum mechanically can be more efficient. A saturated upper bound on the efficiency was given. Furthermore, it was shown that finite classical games consist of a strict subset of finite quantum games. The formalism also allowed to compute Nash equilibria efficiently in some cases.

AB - A study was performed to demonstrate that playing games quantum mechanically can be more efficient. A saturated upper bound on the efficiency was given. Furthermore, it was shown that finite classical games consist of a strict subset of finite quantum games. The formalism also allowed to compute Nash equilibria efficiently in some cases.

UR - http://www.scopus.com/inward/record.url?scp=0037964128&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0037964128&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0037964128

VL - 67

JO - Physical Review A

JF - Physical Review A

SN - 2469-9926

IS - 2

ER -