Related papers: Alice and Bob Get Away With It: a playlet
The well known Bell experiment with two actors Alice and Bob is considered. First the simple deduction leading to the CHSH inequality under local realism is reviewed, and some arguments from the literature are recapitulated. Then I take up…
Quantum teleportation is the name of a problem: how can the real-valued parameters encoding the state at Alice's location make their way to Bob's location via shared entanglement and only two bits of classical communication? Without an…
We show that it is possible to have arbitrarily long sequences of Alices and Bobs so every (Alice, Bob) pair violates a Bell inequality. We propose an experiment to observe this effect with two Alices and two Bobs.
A fair coin is flipped $n$ times, and two finite sequences of heads and tails (words) $A$ and $B$ of the same length are given. Each time the word $A$ appears in the sequence of coin flips, Alice gets a point, and each time the word $B$…
A neat question involving coin flips surfaced on $\Bbb X$, and generated an intensive `storm' of `social mathematics'. In a sequence of flips of a fair coin, Alice wins a point at each appearance of two consecutive heads, and Bob wins a…
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…
One of the many bizarre features of entanglement is that Alice, by sending a qubit to Bob in a separable state, can generate some entanglement between herself and Bob. This protocol is stripped down to the bare essentials to better…
Pseudo-telepathy provides an intuitive way of looking at Bell's inequalities, in which it is often obvious that feats achievable by use of quantum entanglement would be classically impossible. A two-player pseudo-telepathy game proceeds as…
We investigate the correlations that can arise between Alice and Bob in prepare-and-measure communication scenarios where the source (Alice) and the measurement device (Bob) can share prior entanglement. The paradigmatic example of such a…
We study scenarios which arise when two spatially-separated observers, Alice and Bob, are try to identify a quantum state sampled from several possibilities. In particular, we examine their strategies for maximizing both the probability of…
Set disjointness is a central problem in communication complexity. Here Alice and Bob each receive a subset of an n-element universe, and they need to decide whether their inputs intersect or not. The communication complexity of this…
We help Alice play a certain "convergence game" against Bob and win the prize, which is a constructive solution to a problem by Erd\H{o}s and Graham, posed in their 1980 book on open questions in combinatorial number theory. Namely, after…
Bell inequalities are important tools in contrasting classical and quantum behaviors. To date, most Bell inequalities are linear combinations of statistical correlations between remote parties. Nevertheless, finding the classical and…
In 2024, Daniel Litt posed a simple coinflip game pitting Alice's "Heads-Heads" vs Bob's "Heads-Tails": who is more likely to win if they score 1 point per occurrence of their substring in a sequence of n fair coinflips? This attracted over…
Consider a game where a refereed a referee chooses (x,y) according to a publicly known distribution P_XY, sends x to Alice, and y to Bob. Without communicating with each other, Alice responds with a value "a" and Bob responds with a value…
Alice and Bob each have half of a pair of entangled qubits. Bob measures his half and then passes his qubit to a second Bob who measures again and so on. The goal is to maximize the number of Bobs that can have an expected violation of the…
We study Bell scenarios with binary outcomes supplemented by one bit of classical communication. We develop a method to find facet inequalities for such scenarios even when direct facet enumeration is not possible, or at least difficult.…
We combine the eyebrow-raising quantum phenomena of erasure and counterfactuality for the first time, proposing a simple yet unusual quantum eraser: A distant Bob can decide to erase which-path information from Alice's photon, dramatically…
We propose an entanglement sharing protocol based on separable states. Initially, two parties, Alice and Bob, share a two-mode separable Gaussian state. Alice then splits her mode into two separable modes and distributes them between two…
The graph grabbing game is played on a non-negatively weighted connected graph by Alice and Bob who alternately claim a non-cut vertex from the remaining graph, where Alice plays first, to maximize the weights on their respective claimed…