dorsal/arxiv
View SchemaEvolutionary quantum game
| Authors | Roland Kay, Neil F. Johnson, Simon C. Benjamin |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0102008 |
| URL | https://arxiv.org/abs/quant-ph/0102008 |
Abstract
We 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.
{
"annotation_id": "463fce04-94ba-4f2a-b24e-551512c947e8",
"date_created": "2026-03-02T18:01:42.065000Z",
"date_modified": "2026-03-02T18:01:42.065000Z",
"file_hash": "cd0e1a5f6aafcf813e992c5ea62cc0a18b4ccfff72b22b42a1037f5471de56d9",
"private": false,
"record": {
"abstract": "We present the first study of a dynamical quantum game. Each agent has a\n`memory\u0027 of her performance over the previous m timesteps, and her strategy can\nevolve in time. The game exhibits distinct regimes of optimality. For small m\nthe classical game performs better, while for intermediate m the relative\nperformance depends on whether the source of qubits is `corrupt\u0027. For large m,\nthe quantum players dramatically outperform the classical players by `freezing\u0027\nthe game into high-performing attractors in which evolution ceases.",
"arxiv_id": "quant-ph/0102008",
"authors": [
"Roland Kay",
"Neil F. Johnson",
"Simon C. Benjamin"
],
"categories": [
"quant-ph",
"cond-mat"
],
"title": "Evolutionary quantum game",
"url": "https://arxiv.org/abs/quant-ph/0102008"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "8b1e3871-a575-4622-86a0-22966c4a2c58",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}