dorsal/arxiv
View SchemaQuantum entanglement, indistinguishability, and the absent-minded driver's problem
| Authors | Adan Cabello, John Calsamiglia |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0502136 |
| URL | https://arxiv.org/abs/quant-ph/0502136 |
| DOI | 10.1016/j.physleta.2005.01.033 |
| Journal | Phys. Lett. A 336 (2005) 441 |
Abstract
The absent-minded driver's problem illustrates that probabilistic strategies can give higher pay-offs than deterministic ones. We show that there are strategies using quantum entangled states that give even higher pay-offs, both for the original problem and for the generalized version with an arbitrary number of intersections and any possible set of pay-offs.
{
"annotation_id": "9a54b597-22f8-420d-bd7f-8942a16ce063",
"date_created": "2026-03-02T18:02:13.079000Z",
"date_modified": "2026-03-02T18:02:13.079000Z",
"file_hash": "0ded6ea24ece05a68e7d115bb12f4f3a55f20ab7d0d41b9636d1d914d1e740fd",
"private": false,
"record": {
"abstract": "The absent-minded driver\u0027s problem illustrates that probabilistic strategies\ncan give higher pay-offs than deterministic ones. We show that there are\nstrategies using quantum entangled states that give even higher pay-offs, both\nfor the original problem and for the generalized version with an arbitrary\nnumber of intersections and any possible set of pay-offs.",
"arxiv_id": "quant-ph/0502136",
"authors": [
"Adan Cabello",
"John Calsamiglia"
],
"categories": [
"quant-ph"
],
"doi": "10.1016/j.physleta.2005.01.033",
"journal_ref": "Phys. Lett. A 336 (2005) 441",
"title": "Quantum entanglement, indistinguishability, and the absent-minded driver\u0027s problem",
"url": "https://arxiv.org/abs/quant-ph/0502136"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "5b55c353-7435-4993-b907-18d4daf64a79",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}