Loading [MathJax]/extensions/tex2jax.js

The quantum Monty Hall problem

Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review

Autorschaft

  • G. M. D'Ariano
  • R. D. Gill
  • M. Keyl
  • R. F. Werner

Organisationseinheiten

Details

OriginalspracheEnglisch
Seiten (von - bis)355-366
Seitenumfang12
FachzeitschriftQuant. Inform. Comput.
Jahrgang2
Ausgabenummer5
PublikationsstatusVeröffentlicht - 2002

Abstract

We 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.

Zitieren

The quantum Monty Hall problem. / D'Ariano, G. M.; Gill, R. D.; Keyl, M. et al.
in: Quant. Inform. Comput., Jahrgang 2, Nr. 5, 2002, S. 355-366.

Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review

D'Ariano, GM, Gill, RD, Keyl, M, Werner, RF, Kümmerer, B & Maassen, H 2002, 'The quantum Monty Hall problem', Quant. Inform. Comput., Jg. 2, Nr. 5, S. 355-366.
D'Ariano, G. M., Gill, R. D., Keyl, M., Werner, R. F., Kümmerer, B., & Maassen, H. (2002). The quantum Monty Hall problem. Quant. Inform. Comput., 2(5), 355-366.
D'Ariano GM, Gill RD, Keyl M, Werner RF, Kümmerer B, Maassen H. The quantum Monty Hall problem. Quant. Inform. Comput. 2002;2(5):355-366.
D'Ariano, G. M. ; Gill, R. D. ; Keyl, M. et al. / The quantum Monty Hall problem. in: Quant. Inform. Comput. 2002 ; Jahrgang 2, Nr. 5. S. 355-366.
Download
@article{db96813f68154714803f37dc8f59c267,
title = "The quantum Monty Hall problem",
abstract = "We 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.",
author = "D'Ariano, {G. M.} and Gill, {R. D.} and M. Keyl and Werner, {R. F.} and B. K{\"u}mmerer and H. Maassen",
year = "2002",
language = "English",
volume = "2",
pages = "355--366",
number = "5",

}

Download

TY - JOUR

T1 - The quantum Monty Hall problem

AU - D'Ariano, G. M.

AU - Gill, R. D.

AU - Keyl, M.

AU - Werner, R. F.

AU - Kümmerer, B.

AU - Maassen, H.

PY - 2002

Y1 - 2002

N2 - We 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.

AB - We 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.

M3 - Article

VL - 2

SP - 355

EP - 366

JO - Quant. Inform. Comput.

JF - Quant. Inform. Comput.

IS - 5

ER -

Von denselben Autoren