Marginal-constrained entropy accumulation theorem

We derive a novel chain rule for a family of channel conditional entropies, covering von Neumann and sandwiched Rényi entropies. In the process, we show that these channel conditional entropies are equal to their regularized version, and more generally, additive across tensor products of channels. For the purposes of cryptography, applying our chain rule to sequences of channels yields a new variant of Rényi entropy accumulation, in which we can impose some specific forms of marginal-state constraint on the input states to each individual channel. This generalizes a recently introduced security proof technique that was developed to analyze prepare-and-measure QKD with no limitations on the repetition rate. In particular, our generalization yields “fully adaptive'' protocols that can in principle update the entropy estimation procedure during the protocol itself, similar to the quantum probability estimation framework.

Authors

Institutions

Publication Details

Journal
Quantum
Published
2026-11-18
DOI
https://doi.org/10.22331/q-2026-11-18-2273
Citations
39
Primary Topic
Quantum Information and Cryptography
Type
article
Field-Weighted Citation Impact
25.14

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Marginal-constrained entropy accumulation theorem

Amir Arqand, Ernest Y.-Z. Tan
39 citations
Quantum
Quantum Information and Cryptography
25.14
article

Marginal-constrained entropy accumulation theorem

Amir Arqand, Ernest Y.-Z. Tan
article en
39 citations

Abstract

We derive a novel chain rule for a family of channel conditional entropies, covering von Neumann and sandwiched Rényi entropies. In the process, we show that these channel conditional entropies are equal to their regularized version, and more generally, additive across tensor products of channels. For the purposes of cryptography, applying our chain rule to sequences of channels yields a new variant of Rényi entropy accumulation, in which we can impose some specific forms of marginal-state constraint on the input states to each individual channel. This generalizes a recently introduced security proof technique that was developed to analyze prepare-and-measure QKD with no limitations on the repetition rate. In particular, our generalization yields “fully adaptive'' protocols that can in principle update the entropy estimation procedure during the protocol itself, similar to the quantum probability estimation framework.

QuantumVol. 10
University of Waterloo (CA)
University of Waterloo, Natural Sciences and Engineering Research Council of Canada
Openalex Percentile: Top 0%
Quantum Information and Cryptography
25.14
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon