Detection-loophole-free nonlocality in the simplest scenario
Summarize this article with:
Quantum Physics arXiv:2601.03817 (quant-ph) [Submitted on 7 Jan 2026] Title:Detection-loophole-free nonlocality in the simplest scenario Authors:Nandana T Raveendranath, Travis J. Baker, Emanuele Polino, Marwan Haddara, Lynden K. Shalm, Varun B. Verma, Geoff J. Pryde, Sergei Slussarenko, Howard M. Wiseman, Nora Tischler View a PDF of the paper titled Detection-loophole-free nonlocality in the simplest scenario, by Nandana T Raveendranath and 9 other authors View PDF HTML (experimental) Abstract:Loophole-free quantum nonlocality often demands experiments with high complexity (defined by all parties' settings and outcomes) and multiple efficient detectors. Here, we identify the fundamental efficiency and complexity thresholds for quantum steering using two-qubit entangled states. Remarkably, it requires only one photon detector on the untrusted side, with efficiency $\epsilon > 1/X$, where $X \geq 2$ is the number of settings on that side. This threshold applies to all pure entangled states, in contrast to analogous Bell-nonlocality tests, which require almost unentangled states to be loss-tolerant. We confirm these predictions in a minimal-complexity ($X = 2$ for the untrusted party and a single three-outcome measurement for the trusted party), detection-loophole-free photonic experiment with $\epsilon = (51.6 \pm 0.4)\% $. Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2601.03817 [quant-ph] (or arXiv:2601.03817v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2601.03817 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Nora Tischler [view email] [v1] Wed, 7 Jan 2026 11:20:18 UTC (695 KB) Full-text links: Access Paper: View a PDF of the paper titled Detection-loophole-free nonlocality in the simplest scenario, by Nandana T Raveendranath and 9 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-01 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)