Tight Bound on Randomness for Violating the CHSH Inequality

Preprint English OPEN
Teng, Yifeng; Yang, Shenghao; Wang, Siwei; Zhao, Mingfei;

Free will (or randomness) has been studied to achieve loophole-free Bell's inequality test and to provide device-independent quantum key distribution security proofs. The required randomness such that a local hidden variable model (LHVM) can violate the Clauser-Horne-Sh... View more
  • References (21)
    21 references, page 1 of 3

    [1] J. S. Bell, “On the Einstein-Podolsky-Rosen paradox,” Physics, vol. 1, no. 3, pp. 195-200, 1964.

    [2] J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt, “Proposed experiment to test local hidden-variable theories,” Phys. Rev. Lett., vol. 23, pp. 880-884, Oct 1969.

    [3] A. Aspect, P. Grangier, and G. Roger, “Experimental realization of Einstein-Podolsky-Rosen-Bohm Gedankenexperiment : A new violation of Bell's inequalities,” Phys. Rev. Lett., vol. 49, pp. 91-94, Jul 1982.

    [4] M. Giustina, A. Mech, S. Ramelow, B. Wittmann, J. Kofler, J. Beyer, A. Lita, B. Calkins, T. Gerrits, S. W. Nam, R. Ursin, and A. Zeilinger, “Bell violation using entangled photons without the fair-sampling assumption,” Nature, vol. 497, no. 7448, pp. 227-230, 05 2013.

    [5] M. Feldmann, “New loophole for the Einstein-Podolsky-Rosen paradox,” Found. Phys. Lett., vol. 8, no. 1, pp. 41-53, 1995.

    [6] J. Kofler, T. Paterek, and i. c. v. Brukner, “Experimenter's freedom in Bell's theorem and quantum cryptography,” Phys. Rev. A, vol. 73, p. 022104, Feb 2006.

    [7] M. J. W. Hall, “Local deterministic model of singlet state correlations based on relaxing measurement independence,” Phys. Rev. Lett., vol. 105, p. 250404, Dec 2010.

    [8] J. Barrett and N. Gisin, “How much measurement independence is needed to demonstrate nonlocality?” Phys. Rev. Lett., vol. 106, p. 100406, Mar 2011.

    [9] M. J. W. Hall, “Relaxed Bell inequalities and kochen-specker theorems,” Phys. Rev. A, vol. 84, p. 022102, Aug 2011.

    [10] D. Mayers and A. Yao, “Quantum cryptography with imperfect apparatus,” in Proceedings of the 39th Annual Symposium on Foundations of Computer Science, ser. FOCS '98. Washington, DC, USA: IEEE Computer Society, 1998, pp. 503-509.

  • Metrics
Share - Bookmark