Quantum entanglement, indistinguishability, and the absent-minded driver's problem

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.
Comment: LaTeX, 12 pages, 3 figures