Tight bounds for the Pearle-Braunstein-Caves chained inequality without the fair-coincidence assumption

نویسندگان

  • Jonathan Jogenfors
  • Jan-Åke Larsson
چکیده

In any Bell test, loopholes can cause issues in the interpretation of the results, since an apparent violation of the inequality may not correspond to a violation of local realism. An important example is the coincidence-time loophole that arises when detector settings might influence the time when detection will occur. This effect can be observed in many experiments where measurement outcomes are to be compared between remote stations because the interpretation of an ostensible Bell violation strongly depends on the method used to decide coincidence. The coincidence-time loophole has previously been studied for the Clauser-Horne-Shimony-Holt and Clauser-Horne inequalities, but recent experiments have shown the need for a generalization. Here, we study the generalized “chained” inequality by Pearle, Braunstein, and Caves (PBC) with N 2 settings per observer. This inequality has applications in, for instance, quantum key distribution where it has been used to reestablish security. In this paper we give the minimum coincidence probability for the PBC inequality for all N 2 and show that this bound is tight for a violation free of the fair-coincidence assumption. Thus, if an experiment has a coincidence probability exceeding the critical value derived here, the coincidence-time loophole is eliminated.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Bell-type Inequality for Real Experiments and The Relevance of Fair Sampling Assumption

In the experimental verification of Bell’s inequalities in real photonic experiments, it is generally believed that the so-called fair sampling assumption (which means that a small fraction of results provide a fair statistical sample) has an unavoidable role. Here, we want to show that the interpretation of these experiments is really independent of the fair sampling assumption. For this purpo...

متن کامل

More inequalities for Laplacian indices by way of majorization

The n-tuple of Laplacian characteristic values of a graph is majorized by the conjugate sequence of its degrees. Using that result we find a collection of general inequalities for a number of Laplacian indices expressed in terms of the conjugate degrees, and then with a maximality argument, we find tight general bounds expressed in terms of the size of the vertex set n and the average degree dG...

متن کامل

ψ-pseudomonotone generalized strong vector variational inequalities with application

In this paper, we establish an existence result of the solution for an generalized strong vector variational inequality already considered in the literature and as applications we obtain a new coincidence point theorem in Hilbert spaces.    

متن کامل

Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs

In $1994,$ degree distance  of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of  multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the  multiplicative version of degree distance and multiplicative ver...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017