Related papers: Alice and Bob Get Away With It: a playlet
The quantum three-box paradox considers a ball prepared in a superposition of being in one of three Boxes. Bob makes measurements by opening either Box 1 or Box 2. After performing some unitary operations (shuffling), Alice can infer with…
The \emph{graph grabbing game} is a two-player game on a weighted connected graph in which two players, Alice and Bob, alternatively remove non-cut vertices one by one to gain the weights on them. Alice wins the game if she gains at least…
Assume Alice and Bob share some bipartite $d$-dimensional quantum state. A well-known result in quantum mechanics says that by performing two-outcome measurements, Alice and Bob can produce correlations that cannot be obtained locally,…
It has long been assumed in physics that for information to travel between two parties in empty space, "Alice" and "Bob", physical particles have to travel between them. Here, using the "chained" quantum Zeno effect, we show how, in the…
A counterexample to Bell's theorem is presented which uses a pair of photons instead of spin-1/2 particles used in our previous counterexamples. A locally causal protocol is provided for Alice and Bob, which allows them to simulate…
We first consider teleportation of entangled states shared between Claire and Alice to Bob1 and Bob2 when Alice and the two Bobs share a single copy of a GHZ-class state and where {\it all} the four parties are at distant locations. We then…
Alice holds an random variable $X$, and Bob is trying to guess its value by asking questions of the form "is $X=x$?". Alice answers truthfully and the game terminates once Bob guesses correctly. Before the game begins, Bob is allowed to…
A scheme is described that allows Alice to communicate to Bob where on earth she is, even though she doesn't know herself. The situation described shows how the generalization of a recent result of Gisin and Popescu [quant-ph/9901072] could…
In the Heisenberg picture of unitary quantum theory, Bell inequalities are violated with local elements of reality interacting locally. Here is how: Upon measuring her particle of the entangled pair, Alice -- like other coupled systems --…
Quantum resources may provide advantage over their classical counterparts. Theoretically, in certain tasks, this advantage can be very high. In this work, we construct such a task based on a game, mediated by Referee and played between…
Quantum pseudotelepathy is a strong form of nonlocality. Different from the conventional non-local games where quantum strategies win statistically, e.g., the Clauser-Horne-Shimony-Holt game, quantum pseudotelepathy in principle allows…
Given a finite set $S$ of points in $\mathbb{R}^d$, which we regard as the locations of voters on a $d$-dimensional political `spectrum', two candidates (Alice and Bob) select one point in $\mathbb{R}^d$ each, in an attempt to get as many…
Alice and Bob take turns (with Alice playing first) in declaring numbers from the set $[1,2N]$. If a player declares a number that was previously declared, that player looses and the other player wins. If all numbers are declared without…
If both Alice and Bob have access to a two-qubit "background state" then, by simulating Everett's many worlds interpretation of measurement, Alice can teleport a qubit to Bob, each using fixed unitaries. The Everett picture unifies…
The domatic number of a graph is the maximum number of pairwise disjoint dominating sets admitted by the graph. We introduce a game based around this graph invariant. The domatic number game is played on a graph $G$ by two players, Alice…
A new pure quantum state, isotropic in spin variables, is defined in an extended spin phase space beyond standard quantum mechanics. It allows to represent the entangled singlet state in separable form. The statistical correlations between…
There are no ``unknown quantum states.'' It's a contradiction in terms. Moreover, Alice and Bob are only inanimate objects. They know nothing. What is teleported instantaneously from one system (Alice) to another system (Bob) is the…
Introducing the simplest of all No-Signalling Games: the RGB Game where two verifiers interrogate two provers, Alice and Bob, far enough from each other that communication between them is too slow to be possible. Each prover may be…
In the game of Matching Pennies, Alice and Bob each hold a penny, and at every tick of the clock they simultaneously display the head or the tail sides of their coins. If they both display the same side, then Alice wins Bob's penny; if they…
We train a single, goal-conditioned policy that can solve many robotic manipulation tasks, including tasks with previously unseen goals and objects. We rely on asymmetric self-play for goal discovery, where two agents, Alice and Bob, play a…