If two quantum players at a nonlocal game G achieve a superclassical score, then their measurement outcomes must be at least partially random from the perspective of any third player. This is the basis for device-independent quantum cryptography. In this paper we address a related question: does a superclassical score at G guarantee that one player has created randomness from the perspective of the other player? We show that for complete-support games, the answer is yes: even if the second player is given the first player’s input at the conclusion of the game, he cannot perfectly recover her output. Thus some amount of local randomness (i.e., randomness possessed by only one player) is always obtained when randomness is certified from nonlocal games with quantum strategies. This is in contrast to non-signaling game strategies, which may produce global randomness without any local randomness. We discuss potential implications for cryptographic protocols between mistrustful parties.
It is known that if two players achieve a superclassical score at a nonlocal game
G, then their outputs are certifiably random - that is, regardless of the strategy used by the players, a third party will not be able to perfectly predict their outputs (even if he were given their inputs). We prove that for any complete-support game
G, there is an explicit nonzero function
FG such that if Alice and Bob achieve a superclassical score of
s at
G, then Bob has a probability of at most
1−FG(s) of correctly guessing Alice's output after the game is played. Our result implies that certifying global randomness through such games must necessarily introduce local randomness.
When two players achieve a superclassical score at a nonlocal game, their outputs must contain intrinsic randomness. This fact has many useful implications for quantum cryptography. Recently it has been observed [C. Miller and Y. Shi, Quantum Inf. Computat. 17, 0595 (2017)] that such scores also imply the existence of local randomness---that is, randomness known to one player but not to the other. This has potential implications for cryptographic tasks between two cooperating but mistrustful players. In the current paper we bring this notion toward practical realization, by offering near-optimal bounds on local randomness for the CHSH game, and also proving the security of a cryptographic application of local randomness (single-bit certified deletion).
The question of certifying quantum nonlocality under a relaxation of the assumptions in the Bell theorem has gained traction, with potential for device-independent applications under weak seeds and cross-talk. Recently, it was shown that quantum nonlocality can be certified even under a simultaneous arbitrary (but not full) relaxation of the assumptions of Measurement Independence (MI) and Parameter Independence (PI), using states of local dimension
d=poly((1−ε)−1) for an
ε∈[0,1)-relaxation. Here, we derive three results strengthening the state-of-art. Firstly, we show that states of constant local dimension
d are already sufficient to certify quantum nonlocality under arbitrary MI and PI relaxation, albeit in a non-robust manner. Secondly, and as a theoretical paradigm to derive the above, we introduce the notion of \textit{measurement-dependent parameter-dependent locality} as the set of input-output behaviors under simultaneous relaxations of measurement and parameter independence. We provide a rigorous characterisation of the vertices of the polytope of joint input-output behaviors that obey a
μ-relaxation of MI and
ε-relaxation of PI. We highlight a relation between nonlocality certification under PI relaxation and that under detection inefficiencies by pointing out alternative extremal correlations to the Eberhard correlations that also allow to achieve detection efficiency of
η=2/3 in the two-input scenario. Finally, we study the implication of the relaxed assumptions for device-independent randomness certification. We analytically derive the quantum guessing probability for one player's outcomes in the CHSH Bell test, as a function of the noise in the test as well as of a leakage of an average amount of
I(X:B)<1 bits of input information per measurement round.
Given a pair of isolated devices that accept random binary inputs and return binary outputs, a user can deduce from the observed data alone if the underlying mechanism can be explained classically. Bell's theorem further states that a classical explanation can be ruled out if the devices perform certain measurements on an entangled quantum state, underpinning the security of cryptographic protocols that are device-independent (DI). For certain protocols, such as those performed in a tight space, it might be difficult to perfectly enforce the non-signaling assumption required in Bell's theorem. This prompts the question: is quantum nonlocality robust to such imperfections? We show that if a binary channel sends a noisy copy of one party's input to the other before any measurements take place, the answer is yes. We completely characterize the vertices and facets of the local polytope in this scenario, and identify Bell inequalities that certify non-signaling quantum correlations. This is possible even when a near perfect copy of the input is sent. We go on to show that the identified inequalities are more robust to depolarizing noise than the Clauser-Horne-Shimony-Holt inequality when certifying DI randomness in this scenario. In addition, we characterize the local polytope when both parties receive a noisy copy of each other's input and make similar conclusions, leaving many new potential Bell inequalities to be explored.
As our foundational understanding of quantum information theory broadens, it remains to be seen whether novel foundational developments will lead to corresponding applications. Promising branches are quantum networks and quantum cryptography, which are more intertwined by the day. In particular, a fascinating phenomena is that in networks with independent sources, Bell nonlocality can take place without the need for measurement settings for the parties, i.e. in each round, each source is asked to produce the same state and each party measures the same measurement. This is in stark contrast to standard Bell nonlocality, where seed randomness is necessary to certify nonlocality and through it, randomness of the outcomes. Building on nonlocality without seed randomness in networks, we propose a device-independent quantum key distribution protocol (which can be extended to quantum conference key agreement if it involves more than 2 parties) which allows for the generation of shared secret keys without the need for input randomness. We rely on recent results on nonlocality in networks and its robustness, showing how in a ring network with
N bipartite sources, one must only make standard assumptions in order to run the protocol, while no trust is required from the devices themselves. We thus give a device-independent proof of security under this network assumption in the IID setting. In summary, we propose a first-of-a-kind protocol for Device-Independent Quantum Key Distribution which is native to the network setting, and which does not demand input randomness from the parties in order to produce output randomness.
Bell nonlocality is widely viewed as a signature of intrinsic randomness, effectively playing the role of a 'dice' at the heart of many device-independent cryptographic protocols. We show that this connection has a fundamental limitation: there exist Bell inequalities that are maximally violated by quantum correlations yet certify no randomness for any fixed input pair. We develop a systematic construction based on symmetric deterministic extensions of nonlocal games, and use it to obtain explicit examples of such inequalities. We also construct maximally nonlocal quantum correlations that, for every input pair, admit a convex decomposition into strategies with predetermined outputs for those inputs. Our results reveal a strong form of determinism compatible with quantum nonlocality and delineate the limits of device-independent randomness certification.