Generalized R\'enyi entropy accumulation theorem and generalized quantum probability estimation

Understand

The entropy accumulation theorem, and its subsequent generalized version, is a powerful tool in the security analysis of many device-dependent and device-independent cryptography protocols.

• However, it has the drawback that the finite-size bounds it yields are not necessarily optimal, and furthermore it relies on the construction of an affine min-tradeoff function, which can often be challenging to construct optimally in practice.
• In this work, we address both of these challenges simultaneously by deriving a new entropy accumulation bound.
• Our bound yields significantly better finite-size performance, and can be computed as an intuitively interpretable convex optimization, without any specification of affine min-tradeoff functions.