In some small-shoe blackjack configurations, a quantum hyperbit strategy achieves a strictly higher expected payoff than any single-bit classical communication strategy, under the paper's modified rules.
These strategies then give IC(S) that is less than I∗ U by an amount 2δ, for δ equal to 1) |C12|, 2)|C21|, 3)|C22|, 4)|C31|, and 5) |C11| +|C32| respectively
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Quantum Blackjack or Can MIT Bring Down the House Again?
In some small-shoe blackjack configurations, a quantum hyperbit strategy achieves a strictly higher expected payoff than any single-bit classical communication strategy, under the paper's modified rules.