Related papers: Certified randomness between mistrustful players
We demonstrate a basic non-classical effect in a quasi-probabilistic toy model with local Alice and Bob who share classical randomness. Our scenario differs from the orthodox demonstrations of non-classicality such as violations of Bell…
Let $p,q$ be two integers with $p\geq q$. Given a finite graph $F$ with no isolated vertices, the generalized Ramsey achievement game of $F$ on the complete graph $K_n$, denoted by $(p,q;K_n,F,+)$, is played by two players called Alice and…
We study a generalization of nonlocal games---which we call extended nonlocal games---in which the players, Alice and Bob, initially share a tripartite quantum state with the referee. In such games, the winning conditions for Alice and Bob…
Self-testing is the task where spatially separated Alice and Bob cooperate to deduce the inner workings of untrusted quantum devices by interacting with them in a classical manner. We examine the task above where Alice and Bob do not trust…
Unpredictability, or randomness, of the outcomes of measurements made on an entangled state can be certified provided that the statistics violate a Bell inequality. In the standard Bell scenario where each party performs a single…
A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distributed and the parity of a+b equals xy. Such boxes have been central to…
Mirror games were invented by Garg and Schnieder (ITCS 2019). Alice and Bob take turns (with Alice playing first) in declaring numbers from the set {1,2, ...2n}. If a player picks a number that was previously played, that player loses and…
A fundamental task in modern cryptography is the joint computation of a function which has two inputs, one from Alice and one from Bob, such that neither of the two can learn more about the other's input than what is implied by the value of…
We consider an application of the mathematical formalism of quantum mechanics (QM) outside physics, namely, to game theory. We present a simple game between macroscopic players, say Alice and Bob (or in a more complex form - Alice, Bob and…
Non-local games are studied in quantum information because they provide a simple way for proving the difference between the classical world and the quantum world. A non-local game is a cooperative game played by 2 or more players against a…
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…
Classifying the causal structure of quantum channels is essential for verifying quantum networks and certifying quantum resources. We introduce a characterization-free protocol enabling two isolated players, Alice and Bob, to classify and…
In the last years, the DeepMind algorithm AlphaZero has become the state of the art to efficiently tackle perfect information two-player zero-sum games with a win/lose outcome. However, when the win/lose outcome is decided by a final score…
Knowing when a classifier's prediction can be trusted is useful in many applications and critical for safely using AI. While the bulk of the effort in machine learning research has been towards improving classifier performance,…
A graceful labeling of a graph $G$ with $m$ edges consists of labeling the vertices of $G$ with distinct integers from $0$ to $m$ such that, when each edge is assigned as induced label the absolute difference of the labels of its endpoints,…
We introduce a protocol through which a pair of quantum mechanical devices may be used to generate n bits of true randomness from a seed of O(log n) uniform bits. The bits generated are certifiably random based only on a simple statistical…
Heisenberg's uncertainty principle implies that if one party (Alice) prepares a system and randomly measures one of two incompatible observables, then another party (Bob) cannot perfectly predict the measurement outcomes. This implication…
In this article, we look at a hat-guessing game, in which each player must guess the color of their own hat while only seeing the hats of the other players. We focus on the case of two hat colors and a countably infinite number of players.…
We introduce games with probabilistic uncertainty, a natural model for controller synthesis in which the controller observes the state of the system through imprecise sensors that provide correct information about the current state with a…
In a strong game played on the edge set of a graph G there are two players, Red and Blue, alternating turns in claiming previously unclaimed edges of G (with Red playing first). The winner is the first one to claim all the edges of some…