Certified Randomness Generation against Quantum Adversaries via Energy Constraints
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.
Related
- Randomness can be certified in energy-constrained semi-device-independent scenarios
- Unconditional Certified Randomness without Structure
- Metasurface quantum graphs for polarization-independent certified randomness
- Certified Randomness with Optimal Rate
- Efficient multi-basis quantum position verification secure against generalized adversaries
BibTeX
@misc{hahn2026certified,
title = {{Certified Randomness Generation against Quantum Adversaries via Energy Constraints}},
author = {Thomas A. Hahn and Efrat Gerchkovitz and Ester Yehuda and Rotem Arnon},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.05766},
eprint = {2610.05766},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.05766},
}
RIS
TY - UNPB
TI - Certified Randomness Generation against Quantum Adversaries via Energy Constraints
AU - Thomas A. Hahn
AU - Efrat Gerchkovitz
AU - Ester Yehuda
AU - Rotem Arnon
PY - 2026
DA - 2026/10/05
PB - arXiv
DO - 10.48550/arxiv.2610.05766
UR - https://arxiv.org/abs/2610.05766
AB - 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.
ER -