The Quantum Monty Hall Problem

Simple item page
dc.creatorD'Ariano, G. M.
dc.creatorGill, R. D.
dc.creatorKeyl, M.
dc.creatorKuemmerer, B.
dc.creatorMaassen, H.
dc.creatorWerner, R. F.
dc.date2002-02-21
dc.date.accessioned2026-07-07T06:03:43Z
dc.date.available2026-07-07T06:03:43Z
dc.descriptionWe consider a quantum version of a well-known statistical decision problem, whose solution is, at first sight, counter-intuitive 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.
dc.description8 Pages, RevTeX 4. Associated information (including a Java simulation) can be found at http://www.imaph.tu-bs.de/qi/monty
dc.identifierhttps://arxiv.org/abs/quant-ph/0202120
dc.identifierhttp://arxiv.org/abs/quant-ph/0202120
dc.identifierQuant. Inf. Comput. 2, no. 5, 355-366 (2002)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/90048
dc.subjectQuantum Physics
dc.titleThe Quantum Monty Hall Problem
dc.typetext

Files

Collections

arXiv