EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Generalised Entropy Accumulation

Tony Metger iD, Omar Fawzi, David Sutter, Renato Renner

Communications in Mathematical Physics · 2024-11 · 405 (11)

DOI: 10.1007/s00220-024-05121-4 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Communications in Mathematical Physics, online erschienen am 12.10.2024. Verfasst von Tony Metger und 3 weiteren Autor:innen. Beteiligte Einrichtung: Institute for Theoretical Physics, ETH Zurich, 8093 Zurich, Switzerland. Die Arbeit wurde bisher 23-mal zitiert (Crossref) und nennt 51 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Center of Competence in Research Quantum Science and Technology, Air Force Office of Scientific Research, Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Consider a sequential process in which each step outputs a system $$A_i$$ A i and updates a side information register E . We prove that if this process satisfies a natural “non-signalling” condition between past outputs and future side information, the min-entropy of the outputs $$A_1, \dots , A_n$$ A 1 , ⋯ , A n conditioned on the side information E at the end of the process can be bounded from below by a sum of von Neumann entropies associated with the individual steps. This is a generalisation of the entropy accumulation theorem (EAT) (Dupuis et al. in Commun Math Phys 379: 867–913, 2020), which deals with a more restrictive model of side information: there, past side information cannot be updated in subsequent rounds, and newly generated side information has to satisfy a Markov condition. Due to its more general model of side-information, our generalised EAT can be applied more easily and to a broader range of cryptographic protocols. As examples, we give the first multi-round security proof for blind randomness expansion and a simplified analysis of the E91 QKD protocol. The proof of our generalised EAT relies on a new variant of Uhlmann’s theorem and new chain rules for the Rényi divergence and entropy, which might be of independent interest.

Autor:innen und Institutionen

  • Institute for Theoretical Physics, ETH Zurich, 8093 Zurich, Switzerland.
  • Univ Lyon, Inria, ENS Lyon, UCBL, LIP, 69342 Lyon, France.
  • IBM Quantum, IBM Research Europe, Zurich, Switzerland.

ORCID-Profile: Tony Metger

Förderung

  • National Center of Competence in Research Quantum Science and Technology
  • Air Force Office of Scientific Research
  • Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung
  • QuantERA
  • European Research Council
  • QuantERA II Programme
  • Agence Nationale de la Recherche
  • Swiss Federal Institute of Technology Zurich

Zitieren

APA

Metger, T., Fawzi, O., Sutter, D., & Renner, R. (2024). Generalised Entropy Accumulation. Communications in Mathematical Physics, 405(11). https://doi.org/10.1007/s00220-024-05121-4

Vancouver

Metger T, Fawzi O, Sutter D, Renner R. Generalised Entropy Accumulation. Communications in Mathematical Physics. 2024;405(11). doi:10.1007/s00220-024-05121-4

BibTeX
@article{Metger2024,
  author = {Metger, Tony and Fawzi, Omar and Sutter, David and Renner, Renato},
  title = {Generalised Entropy Accumulation},
  journal = {Communications in Mathematical Physics},
  year = {2024},
  volume = {405},
  number = {11},
  doi = {10.1007/s00220-024-05121-4}
}
Kostenlos starten →