ترغب بنشر مسار تعليمي؟ اضغط هنا

Relaxed Bell Inequalities with Arbitrary Measurement Dependence for Each Observer

39   0   0.0 ( 0 )
 نشر من قبل David Kaiser
 تاريخ النشر 2018
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

Bells inequality was originally derived under the assumption that experimenters are free to select detector settings independently of any local hidden variables that might affect the outcomes of measurements on entangled particles. This assumption has come to be known as measurement independence (also referred to as freedom of choice or settings independence). For a two-setting, two-outcome Bell test, we derive modified Bell inequalities that relax measurement independence, for either or both observers, while remaining locally causal. We describe the loss of measurement independence for each observer using the parameters $M_1$ and $M_2$, as defined by Hall in 2010, and also by a more complete description that adds two new parameters, which we call $hat{M}_1$ and $hat{M}_2$, deriving a modified Bell inequality for each description. These relaxed inequalities subsume those considered in previous work as special cases, and quantify how much the assumption of measurement independence needs to be relaxed in order for a locally causal model to produce a given violation of the standard Bell-Clauser-Horne-Shimony-Holt (Bell-CHSH) inequality. We show that both relaxed Bell inequalities are tight bounds on the CHSH parameter by constructing locally causal models that saturate them. For any given Bell inequality violation, the new two-parameter and four-parameter models each require significantly less mutual information between the hidden variables and measurement settings than previous models. We conjecture that the new models, with optimal parameters, require the minimum possible mutual information for a given Bell violation. We further argue that, contrary to various claims in the literature, relaxing freedom of choice need not imply superdeterminism.

قيم البحث

اقرأ أيضاً

Derivation of the full set of Bell inequalities involving correlation functions, for two parties, with binary observables, and N possible local settings is not as easy as it seemed. The proof of v1 is wrong. Additionaly one can find a counterexample, which will be presented soon. Thus our thesis is dead. Still the series of Bell inequalities discussed in the manuscript (v1) form a necessary condition for local realism, and are tight. They are tight and complete (sufficient) only for N=3 settings per observer (as shown in quant-ph/0611086, fortunately using an entirely different approach).
Finding all Bell inequalities for a given number of parties, measurement settings, and measurement outcomes is in general a computationally hard task. We show that all Bell inequalities which are symmetric under the exchange of parties can be found b y examining a symmetrized polytope which is simpler than the full Bell polytope. As an illustration of our method, we generate 238885 new Bell inequalities and 1085 new Svetlichny inequalities. We find, in particular, facet inequalities for Bell experiments involving two parties and two measurement settings that are not of the Collins-Gisin-Linden-Massar-Popescu type.
Bell inequalities are important tools in contrasting classical and quantum behaviors. To date, most Bell inequalities are linear combinations of statistical correlations between remote parties. Nevertheless, finding the classical and quantum mechanic al (Tsirelson) bounds for a given Bell inequality in a general scenario is a difficult task which rarely leads to closed-form solutions. Here we introduce a new class of Bell inequalities based on products of correlators that alleviate these issues. Each such Bell inequality is associated with a unique coordination game. In the simplest case, Alice and Bob, each having two random variables, attempt to maximize the area of a rectangle and the rectangles area is represented by a certain parameter. This parameter, which is a function of the correlations between their random variables, is shown to be a Bell parameter, i.e. the achievable bound using only classical correlations is strictly smaller than the achievable bound using non-local quantum correlations We continue by generalizing to the case in which Alice and Bob, each having now n random variables, wish to maximize a certain volume in n-dimensional space. We term this parameter a multiplicative Bell parameter and prove its Tsirelson bound. Finally, we investigate the case of local hidden variables and show that for any deterministic strategy of one of the players the Bell parameter is a harmonic function whose maximum approaches the Tsirelson bound as the number of measurement devices increases. Some theoretical and experimental implications of these results are discussed.
We introduce Bell inequalities based on covariance, one of the most common measures of correlation. Explicit examples are discussed, and violations in quantum theory are demonstrated. A crucial feature of these covariance Bell inequalities is their n onlinearity; this has nontrivial consequences for the derivation of their local bound, which is not reached by deterministic local correlations. For our simplest inequality, we derive analytically tight bounds for both local and quantum correlations. An interesting application of covariance Bell inequalities is that they can act as shared randomness witnesses: specifically, the value of the Bell expression gives device-independent lower bounds on both the dimension and the entropy of the shared random variable in a local model.
Device independent protocols based on Bell nonlocality, such as quantum key distribution and randomness generation, must ensure no adversary can have prior knowledge of the measurement outcomes. This requires a measurement independence assumption: th at the choice of measurement is uncorrelated with any other underlying variables that influence the measurement outcomes. Conversely, relaxing measurement independence allows for a fully `causal simulation of Bell nonlocality. We construct the most efficient such simulation, as measured by the mutual information between the underlying variables and the measurement settings, for the Clauser-Horne-Shimony-Holt (CHSH) scenario, and find that the maximal quantum violation requires a mutual information of just $sim 0.080$ bits. Any physical device built to implement this simulation allows an adversary to have full knowledge of a cryptographic key or `random numbers generated by a device independent protocol based on violation of the CHSH inequality. We also show that a previous model for the CHSH scenario, requiring only $sim 0.046$ bits to simulate the maximal quantum violation, corresponds to the most efficient `retrocausal simulation, in which future measurement settings necessarily influence earlier source variables. This may be viewed either as an unphysical limitation of the prior model, or as an argument for retrocausality on the grounds of its greater efficiency. Causal and retrocausal models are also discussed for maximally entangled two-qubit states, as well as superdeterministic, one-sided and zigzag causal models.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا