Globe-hopping
From MaRDI portal
Publication:5160980
Abstract: We consider versions of the grasshopper problem (Goulko and Kent, 2017) on the circle and the sphere, which are relevant to Bell inequalities. For a circle of circumference , we show that for unconstrained lawns of any length and arbitrary jump lengths, the supremum of the probability for the grasshopper's jump to stay on the lawn is one. For antipodal lawns, which by definition contain precisely one of each pair of opposite points and have length , we show this is true except when the jump length is of the form with coprime and odd. For these jump lengths we show the optimal probability is and construct optimal lawns. For a pair of antipodal lawns, we show that the optimal probability of jumping from one onto the other is for coprime, odd and even, and one in all other cases. For an antipodal lawn on the sphere, it is known (Kent and Pital'ua-Garc'ia, 2014) that if , where , then the optimal retention probability of for the grasshopper's jump is provided by a hemispherical lawn. We show that in all other cases where , hemispherical lawns are not optimal, disproving the hemispherical colouring maximality hypotheses (Kent and Pital'ua-Garc'ia, 2014). We discuss the implications for Bell experiments and related cryptographic tests.
Recommendations
Cites work
- scientific article; zbMATH DE number 850648 (Why is no real title available?)
- Finite Precision Measurement Nullifies the Kochen-Specker Theorem
- Non-contextuality, finite precision measurement and the Kochen-Specker theorem
- Noncontextual Hidden Variables and Physical Measurements
- On rational approximations to irrational numbers
- Proposed experiment to test local hidden-variable theories
- Simulating quantum mechanics by non-contextual hidden variables.
- The grasshopper problem
- Wringing out better Bell inequalities
Cited in
(3)
This page was built for publication: Globe-hopping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5160980)