We introduce a numerical framework for reliably estimating conditional von Neumann entropies, a central quantity in device-independent quantum cryptography and randomness generation. Our method is based on semidefinite relaxations derived from the Navascués--Pironio--Acín hierarchy and provides entropy bounds directly from observed statistics, assuming only the validity of quantum mechanics. The approach builds on a recent integral representation of entropy and substantially improves efficiency: it requires about half as many support variables as existing methods, while allowing these variables to be chosen projectively, leading to a significant reduction in runtime. These advances enable the practical certification of randomness and security even in noisy conditions, while integrating seamlessly with modern entropy accumulation theorems. Consequently, our framework becomes a versatile tool for quantum cryptographic protocols, broadening the possibilities for secure communication in untrusted environments.
No takes yet. Share an insight, caveat, or question.
Koßmann et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: