Yanbao Zhang, Scott Glancy, Emanuel Knill
To quantify the evidence against local realism in an experiment, one can choose a test statistic to measure the amount of violation of local realism. It is desirable to bound the probability, according to local realism, of obtaining a test statistic at least as extreme as that observed. We describe an efficient protocol for computing such a bound from any set of Bell inequalities for any number of parties, measurement settings or outcomes. The bound depends on the choice and number of Bell inequalities, and more inequalities make the bound asymptotically tighter. We find that even trivial Bell inequalities such as those derived from no-signaling conditions can improve the tightness of the bound.
View original:
http://arxiv.org/abs/1303.7464
No comments:
Post a Comment