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

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Koßmann, Gereon, Schwonnek, René
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866909745761222656
author Koßmann, Gereon
Schwonnek, René
author_facet Koßmann, Gereon
Schwonnek, René
contents This paper introduces a numerical framework for establishing lower bounds on the conditional von-Neumann entropy in device-independent quantum cryptography and randomness extraction scenarios. Leveraging a hierarchy of semidefinite programs derived from the Navascués-Pironio-Acin (NPA) hierarchy, our tool enables efficient computation of entropy bounds based solely on observed statistics, assuming the validity of quantum mechanics. The method's computational efficiency is ensured by its reliance on projective operators within the non-commutative polynomial optimization problem. The method facilitates provable bounds for extractable randomness in noisy scenarios and aligns with modern entropy accumulation theorems. Consequently, the framework offers an adaptable tool for practical quantum cryptographic protocols, expanding secure communication possibilities in untrusted environments.
format Preprint
id arxiv_https___arxiv_org_abs_2411_04858
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Reliable Entropy Estimation from Observed Statistics for Device-Independent Quantum Cryptography
Koßmann, Gereon
Schwonnek, René
Quantum Physics
This paper introduces a numerical framework for establishing lower bounds on the conditional von-Neumann entropy in device-independent quantum cryptography and randomness extraction scenarios. Leveraging a hierarchy of semidefinite programs derived from the Navascués-Pironio-Acin (NPA) hierarchy, our tool enables efficient computation of entropy bounds based solely on observed statistics, assuming the validity of quantum mechanics. The method's computational efficiency is ensured by its reliance on projective operators within the non-commutative polynomial optimization problem. The method facilitates provable bounds for extractable randomness in noisy scenarios and aligns with modern entropy accumulation theorems. Consequently, the framework offers an adaptable tool for practical quantum cryptographic protocols, expanding secure communication possibilities in untrusted environments.
title Reliable Entropy Estimation from Observed Statistics for Device-Independent Quantum Cryptography
topic Quantum Physics
url https://arxiv.org/abs/2411.04858