Numerical study finds many three-outcome Bell inequalities certify substantial min-entropy with noise robustness, including simple ones using fewer settings that achieve near-maximal randomness.
Bell inequalities tailored to optimal global randomness certification
2 Pith papers cite this work. Polarity classification is still indexing.
abstract
We present two novel families of bipartite Bell inequalities designed to achieve optimal global randomness certification for an arbitrary number of outputs $d$. We first use symmetry arguments to argue that their maximal quantum violations certify $2\log d$ random bits. For the first family, we construct a quantum realization using $d\times d$ maximally entangled states which provides a quantum violation that we conjecture to be optimal for any $d$. It is then numerically shown that the obtained quantum violation certifies optimal global randomness, up to numerical precision, for $d=3,4$. For the second family, we provide the optimal quantum violation and its quantum realization for any $d$, again using $d\times d$ maximally entangled states and projective measurements over at least two unbiased bases on one of the parties. We self-test this realization for $d=3$, which implies the optimal certification of two fully random trits.
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Projective measurements using mutually unbiased bases achieve the theoretical maximum device-independent randomness rate of 2 log(d) bits from bipartite systems in every dimension d ≥ 2.
citing papers explorer
-
Noise robustness of three outcome Bell certified quantum randomness
Numerical study finds many three-outcome Bell inequalities certify substantial min-entropy with noise robustness, including simple ones using fewer settings that achieve near-maximal randomness.
-
Maximal global device-independent randomness from projective measurements in every dimension
Projective measurements using mutually unbiased bases achieve the theoretical maximum device-independent randomness rate of 2 log(d) bits from bipartite systems in every dimension d ≥ 2.