The Quantum Monty Hall Problem
Abstract
We consider a quantum version of a wellknown statistical decision problem, whose solution is, at first sight, counterintuitive to many. In the quantum version a continuum of possible choices (rather than a finite set) has to be considered. It can be phrased as a two person game between a player P and a quiz master Q. Then P always has a strategy at least as good as in the classical case, while Q's best strategy results in a game having the same value as the classical game. We investigate the consequences of Q storing his information in classical or quantum ways. It turns out that Q's optimal strategy is to use a completely entangled quantum notepad, on which to encode his prior information.
 Publication:

arXiv eprints
 Pub Date:
 February 2002
 arXiv:
 arXiv:quantph/0202120
 Bibcode:
 2002quant.ph..2120D
 Keywords:

 Quantum Physics
 EPrint:
 8 Pages, RevTeX 4. Associated information (including a Java simulation) can be found at http://www.imaph.tubs.de/qi/monty