Quantum entanglement, indistinguishability, and the absent-minded driver's problem
arXiv:quant-ph/0502136 · doi:10.1016/j.physleta.2005.01.033
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.
LaTeX, 12 pages, 3 figures
References in corpus (9)
- Three qubits can be entangled in two inequivalent ways
- Quantum Games and Quantum Strategies
- Quantum strategies
- Multi-Player Quantum Games
- Experimental realization of quantum games on a quantum computer
- Comment on `Quantum Games and Quantum Strategies'
- Classical Rules in Quantum Games
- Efficiency and formalism of quantum games
- Quantum Chinos Game: winning strategies through quantum fluctuations