Curator's Take
This article tackles a fundamental question in quantum cryptography: how much truly random information can be extracted from quantum measurements when an adversary might have partial knowledge of your system. The researchers prove that certain symmetric measurements, particularly the tetrahedral SIC (Symmetric Informationally Complete) measurement, generate the minimum amount of intrinsic randomness among unbiased extremal measurements, which provides crucial benchmarks for quantum random number generators used in cryptographic applications. Most significantly, they demonstrate that the maximum possible randomness of 2 log d bits can indeed be achieved in any dimension where SIC measurements exist, solving a longstanding open problem in device-independent quantum cryptography. This work provides essential theoretical foundations for designing more secure quantum random number generators and improving the security analysis of quantum cryptographic protocols.
— Mark Eatherly
Summary
The unpredictability of quantum physics gives rise to intrinsic randomness. In an adversarial scenario, any additional degrees of freedom must be attributed to an eavesdropper with correlations to the measurement set-up. The true randomness is then quantified by the probability that she correctly guesses the measurement outcomes, optimised over all possible strategies. Extremal measurements are appealing here, since they do not allow information to leak to such an eavesdropper. Beyond projective measurements, however, a simple question remains open: how much intrinsic randomness can be generated by a given extremal measurement? In a step towards solving it, we characterise the randomness generated by any unbiased extremal rank-one measurement acting on any state, solving the problem explicitly in dimension two. Four-outcome qubit measurements of this type are tomographic, so these results hold for fully source-device-dependent randomness too. The tetrahedral symmetric informationally complete (SIC) measurement, we find, has the least intrinsic randomness within this class. We also present the skewed SIC family of measurements, and use them to partially solve an open problem: we prove that $2 \log d$ bits of randomness, the maximal amount, can be generated device-dependently (or source-device-independently) in any dimension in which there exists a SIC measurement.