Affiliation:
1. Department of Mathematics, University of New Orleans, New Orleans, LA 70148, USA
Abstract
The probability estimation framework involves direct estimation of the probability of occurrences of outcomes conditioned on measurement settings and side information. It is a powerful tool for certifying randomness in quantum nonlocality experiments. In this paper, we present a self-contained proof of the asymptotic optimality of the method. Our approach refines earlier results to allow a better characterisation of optimal adversarial attacks on the protocol. We apply these results to the (2,2,2) Bell scenario, obtaining an analytic characterisation of the optimal adversarial attacks bound by no-signalling principles, while also demonstrating the asymptotic robustness of the PEF method to deviations from expected experimental behaviour. We also study extensions of the analysis to quantum-limited adversaries in the (2,2,2) Bell scenario and no-signalling adversaries in higher (n,m,k) Bell scenarios.
Funder
Louisiana Board of Regents Award LEQSF
AFOSR
NSF Award
Subject
General Physics and Astronomy
Reference36 articles.
1. Dodis, Y., Ong, S.J., Prabhakaran, M., and Sahai, A. (2004, January 17–19). On the (Im)Possibility of Cryptography with Imperfect Randomness. Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, Rome, Italy.
2. Garay, J.A., and Gennaro, R. (2014). Proceedings of the Advances in Cryptology—CRYPTO, Santa Barbara, CA, USA, 17–21 August 2014, Springer.
3. Gennaro, R., and Robshaw, M. (2015). Advances in Cryptology—CRYPTO 2015, Springer.
4. Quantifying randomness in real networks;Orsini;Nat. Commun.,2015
5. Motwani, R., and Raghavan, P. (1995). Randomized Algorithms, Cambridge University Press.