Evolutionary quantum game

Simple item page
dc.creatorKay, Roland
dc.creatorJohnson, Neil F.
dc.creatorBenjamin, Simon C.
dc.date2001-02-01
dc.date.accessioned2026-07-07T06:01:35Z
dc.date.available2026-07-07T06:01:35Z
dc.descriptionWe present the first study of a dynamical quantum game. Each agent has a `memory' of her performance over the previous m timesteps, and her strategy can evolve in time. The game exhibits distinct regimes of optimality. For small m the classical game performs better, while for intermediate m the relative performance depends on whether the source of qubits is `corrupt'. For large m, the quantum players dramatically outperform the classical players by `freezing' the game into high-performing attractors in which evolution ceases.
dc.description4 pages in two-column format. 4 figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0102008
dc.identifierhttp://arxiv.org/abs/quant-ph/0102008
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/89312
dc.subjectQuantum Physics
dc.subjectCondensed Matter
dc.titleEvolutionary quantum game
dc.typetext

Files

Collections

arXiv