Quantum Blackjack or Can MIT Bring Down the House Again?
Abstract
We examine the advantages that quantum strategies afford in communication-limited games. Inspired by the card game blackjack, we focus on cooperative, two-party sequential games in which a single classical bit of communication is allowed from the player who moves first to the player who moves second. Within this setting, we explore the usage of quantum entanglement between the players and find analytic and numerical conditions for quantum advantage over classical strategies. Using these conditions, we study a family of blackjack-type games with varying numbers of card types, and find a range of parameters where quantum advantage is achieved. Furthermore, we give an explicit quantum circuit for the strategy achieving quantum advantage.
Additional Information
JXL acknowledges support from the MIT Undergraduate Research Opportunities Program (UROP). AWH was funded by NSF grants CCF-1452616, CCF-1729369, PHY-1818914 and ARO contract W911NF-17-1-0433. AVN was partially supported by NSF grant CCF-1452616. JAF is supported by U.S. Department of Energy Contract DE-SC0011091 and NSF award 1505678. JAF would also like to thank C. Pollak and his monthly "Lonely Poker Hearts Club Band" for the topic inspiration.Attached Files
Submitted - 1908.09417.pdf
Files
Name | Size | Download all |
---|---|---|
md5:441cced9ba10d29f83b06dd9101f7f91
|
709.6 kB | Preview Download |
Additional details
- Eprint ID
- 102607
- Resolver ID
- CaltechAUTHORS:20200417-132554488
- Massachusetts Institute of Technology (MIT)
- NSF
- CCF-1452616
- NSF
- CCF-1729369
- NSF
- PHY-1818914
- Army Research Office (ARO)
- W911NF-17-1-0433
- Department of Energy (DOE)
- DE-SC0011091
- NSF
- PHY-1505678
- Created
-
2020-04-17Created from EPrint's datestamp field
- Updated
-
2023-06-02Created from EPrint's last_modified field
- Caltech groups
- Institute for Quantum Information and Matter