Papers › Optimal strategy to certify quantum nonlocality

Optimal strategy to certify quantum nonlocality

19 Jul 2021arXiv:2107.09120links table onlyarchive 2025-07-28

S. Gómez, D. Uzcategui, I. Machuca, E. S. Gómez, S. P. Walborn, G. Lima, D. Goyeneche

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

Certification of quantum nonlocality plays a central role in practical applications like device-independent quantum cryptography and random number generation protocols. These applications entail the challenging problem of certifying quantum nonlocality, something that is hard to achieve when the target quantum state is weakly entangled, or when the source of errors is high, e.g. when photons propagate through the atmosphere or a long optical fiber. Here, we introduce a technique to find a Bell inequality with the largest possible gap between the quantum prediction and the classical local hidden variable limit for a given set of measurement frequencies. Our method represents an efficient strategy to certify quantum nonlocal correlations from experimental data without requiring extra measurements, in the sense that there is no Bell inequality with a larger gap than the one provided. Furthermore, we also reduce the photodetector efficiency required to close the detection loophole. We illustrate our technique by improving the detection of quantum nonlocality from experimental data obtained with weakly entangled photons.

PaperPDFCode

Code

Danuzco/nonlocality_certification officialmentioned in paper report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections