Quantum Blackjack or Can MIT Bring Down the House Again?
arXiv:1908.09417 · doi:10.1103/PhysRevA.102.012425
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.
arXiv comment15 pages, 4 figures
References in corpus (8)
- Large violation of Bell inequalities with low entanglement
- Quantum Entanglement and Communication Complexity
- Entanglement assisted random access codes
- High-dimensional quantum communication complexity beyond strategies based on Bell's theorem
- Hyperbits: the information quasiparticles
- Higher dimensional communication complexity problems: classical protocols vs quantum ones based on Bell's Theorem or prepare-transmit-measure schemes
- Bell inequalities with one bit of communication
- Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement