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:1508.01494 · Physical Review A

Bell inequalities violated using detectors of low efficiency

Károly F. Pál, Tamás Vértesi

Published Nov 9, 2015• 30 citations
arXivHTMLPDF

Abstract

We define a family of binary-outcome $n$-party $m\ensuremath{\le}n$ settings per party Bell inequalities whose members require the least detection efficiency for their violation among all known inequalities of the same type. This gives upper bounds for the minimum value of the critical efficiency---below which no violation is possible---achievable for such inequalities. For $m=2$, our family reduces to the one given by Larsson and Semitecolos in 2001 [Phys. Rev. A 63, 022117 (2001)]. For $m>2$, a gap remains between these bounds and the best lower bounds. The violating state near the threshold efficiency always approaches a product state of $n$ qubits.

DOI
10.1103/physreva.92.052104

Related papers

Quantum bounds on Bell inequalities

Károly F. Pál, Tamás Vértesi

We have determined the maximum quantum violation of 241 tight bipartite Bell inequalities with up to five two-outcome measurement settings per party by constructing the appropriate measurement operators in up to six-dimensional complex and eight-dimensional real-component Hilbert spaces using numerical optimization. Out of these inequalities 129 have been introduced here. In 43 cases higher-dimensional component spaces gave larger violation than qubits, and in three occasions the maximum was achieved with six-dimensional spaces. We have also calculated upper bounds on these Bell inequalities using a method proposed recently. For all but 20 inequalities the best solution found matched the upper bound. Surprisingly, the simplest inequality of the set examined, with only three measurement settings per party, was not among them, despite the high dimensionality of the Hilbert space considered. We also computed detection threshold efficiencies for the maximally entangled qubit pair. These could be lowered in several instances if degenerate measurements were also allowed.

arXiv:0810.1615•Physical Review A•Feb 26, 2009•85 citations

Complete list of tight Bell inequalities for two parties with four binary settings

Emmanuel Zambrini Cruzeiro, Nicolas Gisin

We give the complete list of 175 facets of the local polytope for the case where Alice and Bob each choose their measurements from a set of four binary outcome measurements. For each inequality we compute the maximum quantum violation for qubits, the resistance to noise, and the minimal detection efficiency required for closing the detection loophole with maximally entangled qubit states, in the case where both detectors have the same efficiency (symmetric case).

arXiv:1811.11820•Physical Review A•Feb 5, 2019•18 citations

Multipartite bound entanglement and three-setting Bell inequalities

Dagomir Kaszlikowski, L. C. Kwek, Jing‐Ling Chen +1 more

It was shown by Dur [Phys. Rev. Lett. $87,$ 230402 (2001)] that N $(N>~4)$ qubits described by a certain one-parameter family $\mathcal{F}$ of bound entangled states violate the Mermin-Klyshko inequality for $N>~8.$ In this paper we prove that the states from the family $\mathcal{F}$ violate Bell inequalities derived by \ifmmode \dot{Z}\else \.{Z}\fi{}ukowski and Kaszlikowski [Phys. Rev. A $56,$ R1682 (1997)], in which each observer measures three noncommuting sets of orthogonal projectors, for $N>~7.$ We also derive a simple one-parameter family of entanglement witnesses that detect entanglement for all the states belonging to $\mathcal{F}.$ It is possible that these entanglement witnesses could be generated by some Bell inequalities.

arXiv:quant-ph/0206031•Physical Review A•Nov 18, 2002•24 citations

How likely are you to observe non-locality with imperfect detection efficiency and random measurement settings?

Paweł Cieśliński, Tamás Vértesi, Mateusz Kowalczyk +1 more

Abstract Imperfect detection efficiency remains one of the major obstacles in achieving loophole-free Bell tests over long distances. At the same time, the challenge of establishing a common reference frame for measurements becomes more pronounced as the separation between parties increases. In this work, we tackle both of these issues by examining the impact of limited detection efficiency on the probability of Bell inequality violation with Haar random measurement settings. We derive analytical lower bounds on the violation probability for a two-qubit maximally entangled state, which is tight for correlation inequalities and perfect detection efficiencies. We further investigate it numerically for more qubits and settings using two detection efficiency models and an original method based on the linear programming. Beyond that, we show that the so-called typicality of Bell inequality violation, i.e. almost certain violation of local realism with sufficiently many particles or random measurement directions, holds even if the detection efficiency is limited. Our findings reveal that increasing the number of measurement settings can compensate for efficiency losses above the critical threshold. Additionally, we determine critical detection efficiencies for both two-party and three-party scenarios. For two parties, we recover previously established results, while for three parties, we derive a symmetric critical efficiency of η crit = 2 / 3 for the W and GHZ states within the binning model. In cases involving the no-detection outcome, we present a modified inequality using a pair of orthogonal observables for each party with η crit ≈ 0.7208 , which is notably less than 0.75 for the GHZ state. These results offer deeper insights into the limitations and possibilities for certifying non-locality in the presence of limited detection efficiency, shedding light on its robustness in practical Bell tests.

arXiv:2503.21519•New Journal of Physics•Jun 27, 2025•2 citations

Upper bounds on violation of Bell-type inequalities by a multipartite quantum state

Elena R. Loubenets

We present the new exact upper bounds on the maximal Bell violation for the generalized N-qubit GHZ state, the N-qudit GHZ state and, in general, for an arbitrary N-partite quantum state, possibly infinite-dimensional. Our results indicate that, for an N-partite quantum state of any Hilbert space dimension, violation of any Bell-type inequality (either on correlation functions or on joint probabilities) with S settings and any number of outcomes at each site cannot exceed (2S-1)^{N-1}.

arXiv:1108.0263•Aug 1, 2011•1 citation

Device-Independent Bounds on Detection Efficiency

Jochen Szangolies, Hermann Kampermann, Dagmar Bruß

In many quantum information applications, a minimum detection efficiency must be exceeded to ensure success. Protocols depending on the violation of a Bell inequality, for instance, may be subject to the so-called detection loophole: Imperfect detectors may yield spurious violations, which consequently cannot be used to ensure, say, quantum cryptographic security. Hence, we investigate the possibility of giving lower bounds on detector efficiency even if an adversary has full control over both the source and the detectors. To this end, we present a technique to systematically derive Bell inequalities free from the detection loophole using only the observed measurements statistics. The violation of these inequalities certifies that the detectors used exceed a certain minimal efficiency.

arXiv:1609.06126•Physical Review Letters•Jun 27, 2017•12 citations
We define a family of binary-outcome nnn-party m\ensuremath≤nm\ensuremath{\le}nm\ensuremath≤n settings per party Bell inequalities whose members require the least detection efficiency for their violation among all known inequalities of the same type. This gives upper bounds for the minimum value of the critical efficiency---below which no violation is possible---achievable for such inequalities. For m=2m=2m=2, our family reduces to the one given by Larsson and Semitecolos in 2001 [Phys. Rev. A 63, 022117 (2001)]. For m>2m>2m>2, a gap remains between these bounds and the best lower bounds. The violating state near the threshold efficiency always approaches a product state of nnn qubits.
We have determined the maximum quantum violation of 241 tight bipartite Bell inequalities with up to five two-outcome measurement settings per party by constructing the appropriate measurement operators in up to six-dimensional complex and eight-dimensional real-component Hilbert spaces using numerical optimization. Out of these inequalities 129 have been introduced here. In 43 cases higher-dimensional component spaces gave larger violation than qubits, and in three occasions the maximum was achieved with six-dimensional spaces. We have also calculated upper bounds on these Bell inequalities using a method proposed recently. For all but 20 inequalities the best solution found matched the upper bound. Surprisingly, the simplest inequality of the set examined, with only three measurement settings per party, was not among them, despite the high dimensionality of the Hilbert space considered. We also computed detection threshold efficiencies for the maximally entangled qubit pair. These could be lowered in several instances if degenerate measurements were also allowed.
It was shown by Dur [Phys. Rev. Lett. 87,87,87, 230402 (2001)] that N (N> 4)(N>~4)(N> 4) qubits described by a certain one-parameter family F\mathcal{F}F of bound entangled states violate the Mermin-Klyshko inequality for N> 8.N>~8.N> 8. In this paper we prove that the states from the family F\mathcal{F}F violate Bell inequalities derived by \ifmmode \dot{Z}\else \.{Z}\fi{}ukowski and Kaszlikowski [Phys. Rev. A 56,56,56, R1682 (1997)], in which each observer measures three noncommuting sets of orthogonal projectors, for N> 7.N>~7.N> 7. We also derive a simple one-parameter family of entanglement witnesses that detect entanglement for all the states belonging to F.\mathcal{F}.F. It is possible that these entanglement witnesses could be generated by some Bell inequalities.
Abstract Imperfect detection efficiency remains one of the major obstacles in achieving loophole-free Bell tests over long distances. At the same time, the challenge of establishing a common reference frame for measurements becomes more pronounced as the separation between parties increases. In this work, we tackle both of these issues by examining the impact of limited detection efficiency on the probability of Bell inequality violation with Haar random measurement settings. We derive analytical lower bounds on the violation probability for a two-qubit maximally entangled state, which is tight for correlation inequalities and perfect detection efficiencies. We further investigate it numerically for more qubits and settings using two detection efficiency models and an original method based on the linear programming. Beyond that, we show that the so-called typicality of Bell inequality violation, i.e. almost certain violation of local realism with sufficiently many particles or random measurement directions, holds even if the detection efficiency is limited. Our findings reveal that increasing the number of measurement settings can compensate for efficiency losses above the critical threshold. Additionally, we determine critical detection efficiencies for both two-party and three-party scenarios. For two parties, we recover previously established results, while for three parties, we derive a symmetric critical efficiency of η crit = 2 / 3 for the W and GHZ states within the binning model. In cases involving the no-detection outcome, we present a modified inequality using a pair of orthogonal observables for each party with η crit ≈ 0.7208 , which is notably less than 0.75 for the GHZ state. These results offer deeper insights into the limitations and possibilities for certifying non-locality in the presence of limited detection efficiency, shedding light on its robustness in practical Bell tests.
In many quantum information applications, a minimum detection efficiency must be exceeded to ensure success. Protocols depending on the violation of a Bell inequality, for instance, may be subject to the so-called detection loophole: Imperfect detectors may yield spurious violations, which consequently cannot be used to ensure, say, quantum cryptographic security. Hence, we investigate the possibility of giving lower bounds on detector efficiency even if an adversary has full control over both the source and the detectors. To this end, we present a technique to systematically derive Bell inequalities free from the detection loophole using only the observed measurements statistics. The violation of these inequalities certifies that the detectors used exceed a certain minimal efficiency.