Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0109008 · Physical Review A

Nonlocality, closing the detection loophole, and communication complexity

Serge Massar

Published Mar 1, 2002• 96 citations
arXivHTMLPDF

Abstract

It is shown that the detection loophole that arises when trying to rule out local realistic theories as alternatives for quantum mechanics can be closed if the detection efficiency $\ensuremath{\eta}>~{\mathrm{Cd}}^{3/4}{2}^{\ensuremath{-}0.0035d}$ where d is the dimension of the bipartite entangled system and C is a positive constant. Furthermore it is argued that such an exponential decrease of the detector efficiency required to close the detection loophole is almost optimal. This optimality argument is based on a close connection that exists between closing the detection loophole and the amount of classical communication required to simulate quantum correlations when the detectors are perfect.

DOI
10.1103/physreva.65.032121

Related papers

Using Linear Programming to Construct Better Criteria for Closing the Detection Loophole in Epr Experiments

James H. Bigelow

I formulate the problem of closing the detection loophole as a constrained optimization problem. Numerical methods can then be used to maximize the detector efficiency subject to the constraint that there exists a local realist explanation for the quantum correlations observed in the EPR experiment in question. Any detector efficiency larger than this maximum rules out all local realist explanations, and hence closes the detection loophole.

arXiv:0805.0387•May 3, 2008•1 citation

Minimum detection efficiencies for a loophole-free observable-asymmetric Bell-type test

Gianni Garbarino

We discuss the problem of finding the most favorable conditions for closing the detection loophole in a test of local realism with a Bell inequality. For a generic nonmaximally entangled two-qubit state and two incompatible bases to be adopted for alternative measurements of two observables $\mathrm{a\ifmmode \hat{}\else \^{}\fi{}}$ and $\mathrm{b\ifmmode \hat{}\else \^{}\fi{}}$ on each party, we apply Hardy's proof of nonlocality without inequality and derive an Eberhard-like inequality. For an infinity of nonmaximally entangled states we find that it is possible to refute local realism by requiring perfect detection efficiency for only one of the two observables, say $\mathrm{b\ifmmode \hat{}\else \^{}\fi{}}$, to be measured on each party: The test is free from the detection loophole for any value of the detection efficiency corresponding to the other observable $\mathrm{a\ifmmode \hat{}\else \^{}\fi{}}$. The maximum tolerable noise in such a loophole-free observable-asymmetric test is also evaluated.

arXiv:0912.2258•Physical Review A•Mar 8, 2010•18 citations

Detection-loophole-free nonlocality in the simplest scenario

Nandana T Raveendranath, Travis J. Baker, Emanuele Polino +7 more

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)\% $.

quant-pharXiv:2601.03817•Jan 8, 2026•0 citations

Loophole-free Bell tests with randomly chosen subsets of measurement settings

Jaskaran Singh, Adán Cabello

There are bipartite quantum nonlocal correlations requiring very low detection efficiency to reach the loophole-free regime but that need too many measurement settings to be practical for actual experiments. This leads to the general problem of what can be concluded about loophole-free Bell nonlocality if only a random subset of these settings is tested. Here we develop a method to address this problem. We show that, in some cases, it is possible to detect loophole-free Bell nonlocality by testing only a small random fraction of the settings. The consequence is a higher detection efficiency. The method allows for the design of loophole-free Bell tests in which, given a quantum correlation that violates a Bell inequality, one can calculate the minimum fraction of contexts needed to reach the detection-loophole-free regime. The results also enforce a different way of thinking about how local realistic models or classical communication can be used to simulate quantum nonlocal correlations, as it shows that the amount of resources that are needed can be made arbitrarily large simply by considering more contexts.

arXiv:2309.00442•Physical Review A•Feb 6, 2024•2 citations

Combinatorics and Quantum Nonlocality

Harry Buhrman, Peter Høyer, Serge Massar +1 more

We use techniques for lower bounds on communication to derive necessary conditions (in terms of detector efficiency or amount of superluminal communication) for being able to reproduce the quantum correlations occurring in Einstein-Podolsky-Rosen-type experiments with classical local hidden-variable theories. As an application, we consider n parties sharing a Greenberger-Horne-Zeilinger-type state and show that the amount of superluminal classical communication required to reproduce the correlations is at least n(log((2)n-3) bits and the maximum detector efficiency eta(*) for which the resulting correlations can still be reproduced by a local hidden-variable theory is upper bounded by eta(*)</=8/n and thus decreases with n.

arXiv:quant-ph/0209052•Physical Review Letters•Jul 25, 2003•38 citations

Classical simulation of quantum entanglement without local hidden variables

Serge Massar, Dave Bacon, Nicolas J. Cerf +1 more

Recent work has extended Bell's theorem by quantifying the amount of communication required to simulate entangled quantum systems with classical information. The general scenario is that a bipartite measurement is given from a set of possibilities and the goal is to find a classical scheme that reproduces exactly the correlations that arise when an actual quantum system is measured. Previous results have shown that, using local hidden variables, a finite amount of communication suffices to simulate the correlations for a Bell state. We extend this in a number of ways. First, we show that, when the communication is merely required to be finite on average, Bell states can be simulated without any local hidden variables. More generally, we show that arbitrary positive operator valued measurements on systems of n Bell states can be simulated with ${O(n2}^{n})$ bits of communication on average (again, without local hidden variables). On the other hand, when the communication is required to be absolutely bounded, we show that a finite number of bits of local hidden variables is insufficient to simulate a Bell state. This latter result is based on an analysis of the nondeterministic communication complexity of the NOT-EQUAL function, which is constant in the quantum model and logarithmic in the classical model.

arXiv:quant-ph/0009088•Physical Review A•Apr 16, 2001•82 citations
It is shown that the detection loophole that arises when trying to rule out local realistic theories as alternatives for quantum mechanics can be closed if the detection efficiency \ensuremathη> Cd3/42\ensuremath−0.0035d\ensuremath{\eta}>~{\mathrm{Cd}}^{3/4}{2}^{\ensuremath{-}0.0035d}\ensuremathη> Cd3/42\ensuremath−0.0035d where d is the dimension of the bipartite entangled system and C is a positive constant. Furthermore it is argued that such an exponential decrease of the detector efficiency required to close the detection loophole is almost optimal. This optimality argument is based on a close connection that exists between closing the detection loophole and the amount of classical communication required to simulate quantum correlations when the detectors are perfect.
We discuss the problem of finding the most favorable conditions for closing the detection loophole in a test of local realism with a Bell inequality. For a generic nonmaximally entangled two-qubit state and two incompatible bases to be adopted for alternative measurements of two observables $\mathrm{a\ifmmode \hat{}\else \^{}\fi{}}$ and $\mathrm{b\ifmmode \hat{}\else \^{}\fi{}}$ on each party, we apply Hardy's proof of nonlocality without inequality and derive an Eberhard-like inequality. For an infinity of nonmaximally entangled states we find that it is possible to refute local realism by requiring perfect detection efficiency for only one of the two observables, say $\mathrm{b\ifmmode \hat{}\else \^{}\fi{}}$, to be measured on each party: The test is free from the detection loophole for any value of the detection efficiency corresponding to the other observable $\mathrm{a\ifmmode \hat{}\else \^{}\fi{}}$. The maximum tolerable noise in such a loophole-free observable-asymmetric test is also evaluated.
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ε> 1/Xε>1/X, where X≥2X \geq 2X≥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=2X = 2X=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)\% $.
There are bipartite quantum nonlocal correlations requiring very low detection efficiency to reach the loophole-free regime but that need too many measurement settings to be practical for actual experiments. This leads to the general problem of what can be concluded about loophole-free Bell nonlocality if only a random subset of these settings is tested. Here we develop a method to address this problem. We show that, in some cases, it is possible to detect loophole-free Bell nonlocality by testing only a small random fraction of the settings. The consequence is a higher detection efficiency. The method allows for the design of loophole-free Bell tests in which, given a quantum correlation that violates a Bell inequality, one can calculate the minimum fraction of contexts needed to reach the detection-loophole-free regime. The results also enforce a different way of thinking about how local realistic models or classical communication can be used to simulate quantum nonlocal correlations, as it shows that the amount of resources that are needed can be made arbitrarily large simply by considering more contexts.
We use techniques for lower bounds on communication to derive necessary conditions (in terms of detector efficiency or amount of superluminal communication) for being able to reproduce the quantum correlations occurring in Einstein-Podolsky-Rosen-type experiments with classical local hidden-variable theories. As an application, we consider n parties sharing a Greenberger-Horne-Zeilinger-type state and show that the amount of superluminal classical communication required to reproduce the correlations is at least n(log((2)n-3) bits and the maximum detector efficiency eta(*) for which the resulting correlations can still be reproduced by a local hidden-variable theory is upper bounded by eta(*)</=8/n and thus decreases with n.
Recent work has extended Bell's theorem by quantifying the amount of communication required to simulate entangled quantum systems with classical information. The general scenario is that a bipartite measurement is given from a set of possibilities and the goal is to find a classical scheme that reproduces exactly the correlations that arise when an actual quantum system is measured. Previous results have shown that, using local hidden variables, a finite amount of communication suffices to simulate the correlations for a Bell state. We extend this in a number of ways. First, we show that, when the communication is merely required to be finite on average, Bell states can be simulated without any local hidden variables. More generally, we show that arbitrary positive operator valued measurements on systems of n Bell states can be simulated with O(n2n){O(n2}^{n})O(n2n) bits of communication on average (again, without local hidden variables). On the other hand, when the communication is required to be absolutely bounded, we show that a finite number of bits of local hidden variables is insufficient to simulate a Bell state. This latter result is based on an analysis of the nondeterministic communication complexity of the NOT-EQUAL function, which is constant in the quantum model and logarithmic in the classical model.