Quantum Random Number Generator based on Violations of the Free CHSH-3 Inequality

Abstract

We describe a protocol for generating random numbers based on the existence of quantum violations of a free Clauser-Horne-Shimony-Holt inequality, namely CHSH-3. Our method uses semidefinite programming relaxations to compute such violations. In a standard setting the CHSH-3 inequality involves two separated qutrits and compatible measurement, that is, commuting with each other, yielding the known quantum bound of $1+\sqrt{11/3}\approx 2.9149$. In our framework, $d$-dimensional quantum systems (qudits) where $d$ is not fixed a priori, and measurement operators possibly not compatible, are allowed. This loss of constraints yields a higher value for the maximum expectation of the CHSH-3 inequality. Based on such upper bound on the violation of CHSH-3, we develop a random number generator of type prepare-and-measure, but with one part. Our protocol generates a maximal entropy and its security is based, through self testing arguments, on the attainability of the maximal violation of the free CHSH-3 for quantum systems.

arXiv comment11 pages, 1 figure ; it replaces the preprint "Maximal violations of CHSH-3 inequality" of the same authors

References in corpus (10)

• Bell inequalities for arbitrarily high dimensional systems
• A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
• The operational meaning of min- and max-entropy
• A simple test for hidden variables in spin-1 system
• Quantum non-locality in two three-level systems
• Tsirelson bounds for generalized Clauser-Horne-Shimony-Holt inequalities
• Maximal violation of Clauser-Horne-Shimony-Holt inequality for two qutrits
• Exploring Quantum Contextuality to Generate True Random Numbers
• More randomness from a prepare-and-measure scenario with independent devices
• A Quantum Key Distribution Protocol for qudits with better noise resistance