Related papers: Optimal Guessing Strategies in a Quantum Card Game

Let $a$, $b$, and $n$ be integers with $0<a<b<n$. In a certain two-player probabilistic chip-collecting game, Alice tosses a coin to determine whether she collects $a$ chips or $b$ chips. If Alice collects $a$ chips, then Bob collects $b$…

The uncertainty principle can be understood as constraining the probability of winning a game in which Alice measures one of two conjugate observables, such as position or momentum, on a system provided by Bob, and he is to guess the…

We propose a new Quantum Key Distribution method in which Alice sends pairs of qubits to Bob, each in one of four possible states. Bob uses one qubit to generate a secure key and the other to generate an auxiliary key. For each pair he…

Imagine that Alice and Bob, unable to communicate, are both given a 16-bit string such that the strings are either equal, or they differ in exactly 8 positions. Both parties are then supposed to output a 4-bit string in such a way that…

In the Russian cards problem, Alice, Bob and Cath draw $a$, $b$ and $c$ cards, respectively, from a publicly known deck. Alice and Bob must then communicate their cards to each other without Cath learning who holds a single card. Solutions…

Suppose Alice wants to perform some computation that could be done quickly on a quantum computer, but she cannot do universal quantum computation. Bob can do universal quantum computation and claims he is willing to help, but Alice wants to…

Duality games are a way of looking at wave-particle duality. In these games. Alice and Bob together are playing against the House. The House specifies, at random, which of two sub-games Alice and Bob will play. One game, Ways, requires that…

Consider the following experiment: a deck with $m$ copies of $n$ different card types is randomly shuffled, and a guesser attempts to guess the cards sequentially as they are drawn. Each time a guess is made, some amount of "feedback" is…

Quantum resources may provide advantage over their classical counterparts. We say this as quantum advantage. Here we consider a single communication task to study different approaches of observing quantum advantage. We say this setting as a…

Consider a uniformly random deck consisting of cards labelled by numbers from $1$ through $n$, possibly with repeats. A guesser guesses the top card, after which it is revealed and removed and the game continues. What is the expected number…

We study a new QKD that is different from the scheme proposed by \cite{Ramz2}, though it essentially takes our ground on three-player quantum games and Greenberg-Horne-Zeilinger triplet entangled state (GHZ state) \cite{Gree} is used. In…

We consider a situation in which two parties, Alice and Bob, share a 3-qubit system coupled in an initial maximally entangled, GHZ state. By manipulating locally two of the qubits, Alice can prepare any one of the eight 3-qubit GHZ states.…

We consider the following game. A deck with $m$ copies of each of $n$ distinct cards is shuffled in a perfectly random way. The Guesser sequentially guesses the card from top to bottom. After each guess, the Guesser is informed whether the…

Quantum gambling --- a secure remote two-party protocol which has no classical counterpart --- is demonstrated through optical approach. A photon is prepared by Alice in a superposition state of two potential paths. Then one path leads to…

We consider a card guessing strategy for a stack of cards with two different types of cards, say $m_1$ cards of type red (heart or diamond) and $m_2$ cards of type black (clubs or spades). Given a deck of $M=m_1+m_2$ cards, we propose a…

This paper introduces two information-theoretically secure protocols that achieve quantum secure direct communication between Alice and Bob in the first case, and among Alice, Bod and Charlie in the second case. Both protocols use the same…

Recently, Shi et al. (Phys. Rev. A, 2015) proposed Quantum Oblivious Set Member Decision Protocol (QOSMDP) where two legitimate parties, namely Alice and Bob, play a game. Alice has a secret $k$ and Bob has a set $\{k_1,k_2,\cdots k_n\}$.…

We explain the mechanism of the quantum speed-up - quantum algorithms requiring fewer computation steps than their classical equivalent - for a family of algorithms. Bob chooses a function and gives to Alice the black box that computes it.…

In a nonlocal game, two noncommunicating players cooperate to convince a referee that they possess a strategy that does not violate the rules of the game. Quantum strategies allow players to optimally win some games by performing joint…

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…