DocumentCode :
2729175
Title :
The Quantum Locker Puzzle
Author :
Avis, David ; Broadbent, Anne
Author_Institution :
McGill Univ., Montreal, QC
fYear :
2009
fDate :
1-7 Feb. 2009
Firstpage :
63
Lastpage :
66
Abstract :
The locker puzzle is a game played by multiple players against a referee. It has been previously shown that the best strategy that exists cannot success with probability greater than than 1-ln2 sime 0.31, no matter how many players are involved. Our contribution is to show that quantum players can do much better---they can succeed with probability 1. By making the rules of the game significantly stricter, we show a scenario where the quantum players still succeed perfectly, while the classical players win with vanishing probability. Other variants of the locker puzzle are considered, as well as a cheating referee.
Keywords :
computational complexity; game theory; probability; search problems; Grover search; quantum complexity; quantum locker puzzle; quantum players; Protocols; Search methods; Grover search; locker puzzle; quantum complexity;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Quantum, Nano and Micro Technologies, 2009. ICQNM '09. Third International Conference on
Conference_Location :
Cancun
Print_ISBN :
978-1-4244-3349-0
Electronic_ISBN :
978-0-7695-3524-1
Type :
conf
DOI :
10.1109/ICQNM.2009.13
Filename :
4782924
Link To Document :
بازگشت