(Almost-)Quantum Bell Inequalities and Device-Independent Applications
Quantum 8, 1489 (2024).
https://doi.org/10.22331/q-2024-10-02-1489
Investigations of the boundary of the quantum correlation set have gained increased attention in recent years. This is done through the derivation of quantum Bell inequalities, which are related to Tsirelson’s problem and have significant applications in device-independent (DI) information processing. However, determining quantum Bell inequalities is a notoriously difficult task and only isolated examples are known. In this paper, we present families of (almost-)quantum Bell inequalities and highlight four foundational and DI applications. Firstly, it is known that quantum correlations on the non-signaling boundary are of crucial importance in the task of DI randomness extraction from weak sources. In the practical Bell scenario of two players with two $k$-outcome measurements, we derive quantum Bell inequalities that demonstrate a separation between the quantum boundary and certain portions of the boundaries of the no-signaling polytope of dimension up to $4k-8$, extending previous results from nonlocality distillation and the collapse of communication complexity. Secondly as an immediate by-product, we give a general proof of Aumann’s Agreement theorem for quantum systems as well as the almost-quantum correlations, which implies Aumann’s agreement theorem is a reasonable physical principle in the context of epistemics to pick out both quantum theory and almost-quantum correlations from general no-signaling theories. Thirdly, we present a family of quantum Bell inequalities in the two players with $m$ binary measurements scenarios, that we prove serve to self-test the two-qubit singlet and the corresponding $2m$ measurements. Interestingly, this claim generalizes the result for $m=2$ discovered by Tsirelson-Landau-Masanes and shows an improvement over the state-of-the-art Device-Independent Randomness-Amplification (DIRA). Lastly, we use our quantum Bell inequalities to derive the general form of the principle of no advantage in nonlocal computation, which is an information-theoretic principle that serves to characterize the quantum correlation set.