Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 30 min ago
Peer-reviewedCC BY 4.0Quantum

Reliable Entropy Estimation from Observed Statistics for Device-Independent Quantum Cryptography

  1. 1Institute for Quantum Information, RWTH Aachen University, Aachen, Germany
  2. 2Institut für Theoretische Physik, Leibniz Universität Hannover, Germany

Abstract

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.

Related

  1. Reliable Uncertainty Estimation for Machine-Learned Multigroup Cross Sections Without Retraining
    Joshua Nichols, Andrew Osborne, Valerio Mascolino
    arXivPreprintCC BY 4.0Full textComputational physicsarXiv
  2. Direct estimation of g(2)(0) from click statistics of a multiplexed detector
    Jaromír Fiurášek
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  3. Loss-independent time-delay estimation via Hong-Ou-Mandel photon bunching detection
    Julián Defant, Agustina G. Magnoni, Miguel A. Larotonda +1
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  4. Consecutive Measurement Tradeoffs in Quantum Cryptography
    Chen-Xun Weng, Minglong Qin, Yanglin Hu +1
    PRX QuantumPeer-reviewedPublisher termsQuantum physics & quantum informationCrossref
  5. From Quantum Cryptography to Intuitionism and beyond: relativity, many-worlds and non-locality
    Nicolas Gisin
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
BibTeX
@article{koßmann2026reliable,
  title = {{Reliable Entropy Estimation from Observed Statistics for Device-Independent Quantum Cryptography}},
  author = {Gereon Koßmann and René Schwonnek},
  journal = {Quantum},
  year = {2026},
  month = oct,
  doi = {10.22331/q-2026-10-20-2238},
  url = {https://quantum-journal.org/papers/q-2026-10-20-2238/},
  note = {CC BY 4.0},
}
RIS
TY  - JOUR
TI  - Reliable Entropy Estimation from Observed Statistics for Device-Independent Quantum Cryptography
AU  - Gereon Koßmann
AU  - René Schwonnek
PY  - 2026
DA  - 2026/10/20
JO  - Quantum
DO  - 10.22331/q-2026-10-20-2238
UR  - https://quantum-journal.org/papers/q-2026-10-20-2238/
AB  - 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.
SN  - 2521-327X
ER  -