Tsirelson Polytopes and Randomness Generation

Abstract

We classify the extreme points of a polytope of probability distributions in the (2,2,2) CHSH-Bell setting that is induced by a single Tsirelson bound. We do the same for a class of polytopes obtained from a parametrized family of multiple Tsirelson bounds interacting non-trivially. Such constructions can be applied to device-independent random number generation using the method of probability estimation factors [Phys. Rev. A, 98:040304(R), 2018]. We demonstrate a meaningful improvement in certified randomness applying the new polytopes characterized here.

arXiv comment17 pages

References in corpus (23)

• Experimental loophole-free violation of a Bell inequality using entangled electron spins separated by 1.3 km
• Device-independent security of quantum cryptography against collective attacks
• Significant-loophole-free test of Bell's theorem with entangled photons
• Random Numbers Certified by Bell's Theorem
• A strong loophole-free test of local realism
• A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
• Non-local correlations as an information theoretic resource
• Bounding the set of quantum correlations
• Event-Ready Bell Test Using Entangled Atoms Simultaneously Closing Detection and Locality Loopholes
• Private Randomness Expansion With Untrusted Devices
• Randomness vs Non Locality and Entanglement
• Device independent quantum random number generation
• Experimentally Generated Randomness Certified by the Impossibility of Superluminal Signals
• Source-device-independent Ultra-fast Quantum Random Number Generation
• Geometry of the set of quantum correlations
• Source-independent quantum random number generation
• Asymptotically optimal data analysis for rejecting local realism
• Detection Loophole in Bell experiments: How post-selected local correlations can look non-local
• Experimental Low-Latency Device-Independent Quantum Randomness
• High Speed Continuous Variable Source-Independent Quantum Random Number Generation
• Certifying Quantum Randomness by Probability Estimation
• New Quantum Bounds for Inequalities involving Marginal Expectations
• Geometric Decompositions of Bell Polytopes with Practical Applications

Cited by in corpus (4)

• Quantum Randomness Generation by Probability Estimation with Classical Side Information
• Asymptotically Optimal Adversarial Strategies for the Probability Estimation Framework
• Quantitative and Optimal Device-Independent Lower Bounds on Detection Efficiency
• Strength of statistical evidence for genuine tripartite nonlocality