Skip to content
Quantum.world

The Signal

Quantum paper introduces marginal-constrained entropy accumulation theorem

A paper in Quantum presents a variant of Rényi entropy accumulation that allows specified marginal-state constraints on the input to each channel in a sequence. The result extends a security-proof technique developed for prepare-and-measure QKD and can in principle support protocols that update entropy estimation during the protocol.

Quantum paper introduces marginal-constrained entropy accumulation theorem

A theorem for constrained inputs

A paper published in Quantum presents the marginal-constrained entropy accumulation theorem, a new variant of Rényi entropy accumulation for sequences of channels. The theorem allows specific forms of marginal-state constraint to be imposed on the input state to each individual channel. It generalizes a security-proof technique developed to analyze prepare-and-measure quantum key distribution (QKD) with no limitations on the repetition rate.

The result is built on a chain rule for a family of channel conditional entropies. The paper says the family covers both von Neumann and sandwiched Rényi entropies. It also establishes that these channel conditional entropies equal their regularized versions and are additive across tensor products of channels.

Using the chain rule

Applying the chain rule to sequences of channels yields the new entropy-accumulation variant. Its marginal constraints apply to the input states of individual channels, rather than requiring the analysis to use one undifferentiated constraint for the whole sequence. This is the feature that extends the security-proof method to a broader range of input conditions.

The paper connects the theorem to prepare-and-measure QKD, a setting in which the security analysis can use the generalized result while retaining the no-repetition-rate-limit property of the technique it generalizes. The theorem is also relevant to protocols that adjust their entropy estimates as they run: the paper says it yields “fully adaptive” protocols that can, in principle, update the entropy-estimation procedure during the protocol itself. It compares that capability to the quantum probability estimation framework.

Scope of the result

The paper’s contribution combines a channel-entropy chain rule with marginal constraints in a Rényi entropy-accumulation method. The chain rule covers two named entropy families, while additivity across tensor products is one of the properties established for the channel conditional entropies. The cryptographic application is the resulting analysis of channel sequences, including the possibility of updating entropy estimation during a protocol.

Source

  1. Quantum

Related stories

Explore

More articles