Detection-loophole-free nonlocality in the simplest scenario
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908751313764352 |
|---|---|
| author | Raveendranath, Nandana T Baker, Travis J. Polino, Emanuele Haddara, Marwan Shalm, Lynden K. Verma, Varun B. Pryde, Geoff J. Slussarenko, Sergei Wiseman, Howard M. Tischler, Nora |
| author_facet | Raveendranath, Nandana T Baker, Travis J. Polino, Emanuele Haddara, Marwan Shalm, Lynden K. Verma, Varun B. Pryde, Geoff J. Slussarenko, Sergei Wiseman, Howard M. Tischler, Nora |
| contents | 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 $ε> 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 $ε= (51.6 \pm 0.4)\% $. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_03817 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Detection-loophole-free nonlocality in the simplest scenario Raveendranath, Nandana T Baker, Travis J. Polino, Emanuele Haddara, Marwan Shalm, Lynden K. Verma, Varun B. Pryde, Geoff J. Slussarenko, Sergei Wiseman, Howard M. Tischler, Nora Quantum Physics 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 $ε> 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 $ε= (51.6 \pm 0.4)\% $. |
| title | Detection-loophole-free nonlocality in the simplest scenario |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2601.03817 |