dorsal/arxiv
View SchemaParrondo Games and Quantum Algorithms
| Authors | Chiu Fan Lee, Neil Johnson |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0203043 |
| URL | https://arxiv.org/abs/quant-ph/0203043 |
Abstract
We pursue the possible connections between classical games and quantum computation. The Parrondo game is one in which a random combination of two losing games produces a winning game. We introduce novel realizations of this Parrondo effect in which the player can `win' via random reflections and rotations of the state-vector, and connect these to known quantum algorithms.
{
"annotation_id": "d5f818e1-2d1e-46f6-897a-61b90ff3407d",
"date_created": "2026-03-02T18:01:48.901000Z",
"date_modified": "2026-03-02T18:01:48.901000Z",
"file_hash": "1912207ce2be5b76bede183e990051713618e0d952cb3a3d857b1a5e68551cd1",
"private": false,
"record": {
"abstract": "We pursue the possible connections between classical games and quantum\ncomputation. The Parrondo game is one in which a random combination of two\nlosing games produces a winning game. We introduce novel realizations of this\nParrondo effect in which the player can `win\u0027 via random reflections and\nrotations of the state-vector, and connect these to known quantum algorithms.",
"arxiv_id": "quant-ph/0203043",
"authors": [
"Chiu Fan Lee",
"Neil Johnson"
],
"categories": [
"quant-ph"
],
"title": "Parrondo Games and Quantum Algorithms",
"url": "https://arxiv.org/abs/quant-ph/0203043"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "46b03c6b-b8cb-4130-a6da-ed4bce74cd9a",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}