arXiv:2610.05766
Certified Randomness Generation against Quantum Adversaries via Energy Constraints
Thomas A. Hahn, Efrat Gerchkovitz, Ester Yehuda, Rotem Arnon
Abstract
For quantum random number generators (QRNGs), strong security guarantees can be obtained under various assumptions. The most well-known assumptions are the non-signalling assumption (needed for device-independent (DI) QRNG) and post-quantum computational assumptions (needed for computationally bounded single-prover QRNG protocols). In this work, we study a third model: a simple prepare-and-measure QRNG whose security relies on physically motivated energy constraints. This physically motivated set-up allows for easier implementations of QRNGs and can supply better rates. So far, previous works that studied the energy-constrained model either assumed that the adversary is classical in their security proof or supplied relatively weak bounds on the certified randomness, by bounding the conditional min-entropy. In this work, we prove a new, essentially tight, lower bound on the single-round von Neumann entropy against adversaries holding both classical and quantum side-information. Our work reveals that working with the von Neumann entropy, rather than the min-entropy, in the quantum case can lead to a major improvement, nearly matching the classical bound in many cases. We further study the robustness of our entropy bound. Since the single-round von Neumann entropy is the main quantity of interest when characterizing the key rate of QRNGs, our bound establishes the main ingredient for rigorous security proofs against general quantum attacks in this framework.
AI Summary
The paper studies randomness certification in an energy-constrained, semi-device-independent prepare-and-measure QRNG with two preparation inputs and one binary-output measurement. It asks how much single-round conditional von Neumann entropy $H(A|E\Lambda,X=0)$ can be certified when an adversary holds quantum side information, including a purification of the emitted state, alongside shared classical information. The assumptions include measurement independence and average energy bounds relative to an operator with a unique ground state and a normalized spectral gap. The construction reduces the relevant systems to qubits using Jordan’s lemma and classical refinements. For each fixed classical strategy, it derives the bound $H(A|E,\Lambda=\lambda,X=0)\geq h_2((1-E_0^\lambda)/2)-h_2((1-\sqrt{q_\star})/2)$, where $q_\star$ is obtained from a small SDP minimizing the preparation’s squared Bloch-vector length. This bound is saturable for behaviors realizable with qubit states and projective measurements. Piecewise-affine entropy approximations and a finite-mixture reduction then produce computable SDP lower bounds incorporating arbitrary classical mixtures. Numerical evaluations use grids with up to $16^2=256$ cells. Optimized quantum-side-information bounds nearly match classical-adversary bounds and substantially exceed previous min-entropy bounds in several regimes. At equal energy bounds $\omega_0=\omega_1=0.05$, the reported largest classical–quantum gap is approximately $0.027$ bits. The paper supplies a single-round ingredient rather than a complete finite-size security proof against general sequential attacks. Global tightness is not established, the more general entanglement-assisted adversarial model is excluded, and a direct numerical comparison with concurrent von Neumann entropy results is unavailable.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 24 pages, 6 figures