Chain rules for conditional entropies in quantum cryptography: limitations and improvements

• URL: http://arxiv.org/abs/2605.29787v1
• Date: Thu, 28 May 2026 11:35:27 GMT
• Title: Chain rules for conditional entropies in quantum cryptography: limitations and improvements
• Abstract summary: Chain rules are a key ingredient in entropy accumulation theorems (EATs)<n>Recent chain rules in the setting of trusted devices have lead to tight i.i.d. reductions at a finite number of rounds.<n>We show that a natural tightening of the chain rule of Dupuis et al. cannot hold, highlighting a limitation of the current DI security proof approach.
• Score: 6.983998742574596
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Security proofs in quantum cryptography rely on conditional entropies. In a many-round protocol, their estimation is a challenging task; one must account for the most general attacks by an eavesdropper, including those that are not independently and identically distributed (i.i.d.) across all rounds. Chain rules address this problem by relating the conditional entropy of a structured, but non-i.i.d. process to a sum of entropy contributions from each round. They are a key ingredient in entropy accumulation theorems (EATs), which provide a versatile security proof framework for many protocols in quantum cryptography. Recently, chain rules in the setting of trusted devices have lead to tight i.i.d. reductions at a finite number of rounds, and whether analogous results can be recovered in the device-independent (DI) setting has not been addressed. Surprisingly, we show that a natural tightening of the chain rule of Dupuis et al. [Commun. Math. Phys. 379, 867-913, (2020)] that would answer this question affirmatively cannot hold, highlighting a limitation of the current DI security proof approach. Nonetheless, we show that an intermediate improvement is possible by proving a new chain rule in this setting. Following the framework of Arqand et al. [Phys. Rev. X 15, 041013 (2025)], we use our chain rule to provide a slightly tighter version of the Rényi EAT in certain contexts. In addition, we provide a self-contained framework that unifies existing chain rules and compares their applications, framing our results in a broader context.

Related papers

• The SIGReg Objective as Variational Free Energy: A Theoretical Active-Inference Account of JEPA World Models [47.471225029744424]
  Joint-Embedding Predictive Architectures (JEPAs) are the dominant design for latent world models.<n>We show that the choice of anti-collapse regulariser determines whether a JEPA's training objective, a prediction loss plus a weighted embedding regulariser, is a valid Active Inference (AIF) variational free energy.
  arXiv  Detail & Related papers  (2026-07-15T08:59:36Z)
• Post-Quantum Cryptography from Quantum Stabilizer Decoding [40.84312119358882]
  Post-quantum cryptography currently rests on a small number of hardness assumptions.<n>We argue that decoding random quantum stabilizer codes is an excellent candidate.<n>We prove that the average-case hardness of quantum stabilizer decoding implies the core primitives of classical Cryptomania.
  arXiv  Detail & Related papers  (2026-03-19T16:35:31Z)
• Quantile Advantage Estimation for Entropy-Safe Reasoning [44.192277495613695]
  Reinforcement Learning with Verifiable Rewards (RLVR) strengthens LLM reasoning, but training often oscillates between entropy collapse and entropy explosion<n>We trace both hazards to the mean baseline used in value-free RL, which improperly penalizes negative-advantage samples under reward outliers.<n>We propose Quantile Advantage Estimation (QAE), replacing the mean with a group-wise K-quantile baseline.
  arXiv  Detail & Related papers  (2025-09-26T17:37:52Z)
• Quantum Lifting for Invertible Permutations and Ideal Ciphers [47.33103206862089]
  We derive the first lifting theorems for establishing security in the quantum random permutation and ideal cipher models.<n>These theorems relate the success probability of an arbitrary quantum adversary to that of a classical algorithm making only a small number of classical queries.
  arXiv  Detail & Related papers  (2025-04-25T09:07:55Z)
• Marginal-constrained entropy accumulation theorem [0.0]
  We show that channel conditional entropies are equal to their regularized version, and more generally, additive across tensor products of channels.<n>For the purposes of cryptography, applying our chain rule to sequences of channels yields a new variant of R'enyi entropy accumulation.
  arXiv  Detail & Related papers  (2025-02-04T18:37:34Z)
• Efficient Eigenstate Preparation in an Integrable Model with Hilbert Space Fragmentation [39.49473274097833]
  We consider the preparation of all the eigenstates of spin chains using quantum circuits.<n>We showivities of the growth is also achievable for interacting models where the interaction between the particles is sufficiently simple.
  arXiv  Detail & Related papers  (2024-11-22T18:57:08Z)
• Quantum Rewinding for IOP-Based Succinct Arguments [42.12045681000549]
  We prove that an interactive variant of the BCS transformation is secure in the standard model against quantum adversaries when the vector commitment scheme is collapsing.<n>As a consequence of our results, we obtain standard-model post-quantum secure succinct arguments with the best complexity known.
  arXiv  Detail & Related papers  (2024-11-08T06:33:08Z)
• Discrete-modulated continuous-variable quantum key distribution secure against general attacks [0.0]
  This work presents a security analysis of DM-CV-QKD against general sequential attacks, including finite-size effects. Remarkably, our proof considers attacks that are neither independent nor identical, and makes no assumptions about the Hilbert space dimension of the receiver.
  arXiv  Detail & Related papers  (2024-09-04T11:50:18Z)
• Mutual information chain rules for security proofs robust against device imperfections [0.0]
  We analyze quantum cryptography with imperfect devices that leak additional information to an adversary.<n>We show that these results can be used to handle some device imperfections in a variety of device-dependent and device-independent protocols.
  arXiv  Detail & Related papers  (2024-07-29T19:47:47Z)
• Generalized Rényi entropy accumulation theorem and generalized quantum probability estimation [0.0]
  entropy accumulation theorem is a powerful tool in the security analysis of many device-dependent and device-independent cryptography protocols. It relies on the construction of an affine min-tradeoff function, which can often be challenging to construct optimally in practice. We deriving a new entropy accumulation bound, which yields significantly better finite-size performance.
  arXiv  Detail & Related papers  (2024-05-09T17:11:00Z)
• Security of discrete-modulated continuous-variable quantum key distribution [4.637027109495763]
  Continuous variable quantum key distribution with discrete modulation has the potential to provide information-theoretic security. We prove finite-size security against coherent attacks for a discrete-modulated quantum key distribution protocol.
  arXiv  Detail & Related papers  (2023-03-16T12:14:07Z)
• Geometry of Banach spaces: a new route towards Position Based Cryptography [65.51757376525798]
  We study Position Based Quantum Cryptography (PBQC) from the perspective of geometric functional analysis and its connections with quantum games. The main question we are interested in asks for the optimal amount of entanglement that a coalition of attackers have to share in order to compromise the security of any PBQC protocol. We show that the understanding of the type properties of some more involved Banach spaces would allow to drop out the assumptions and lead to unconditional lower bounds on the resources used to attack our protocol.
  arXiv  Detail & Related papers  (2021-03-30T13:55:11Z)
• Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier [73.70426431502803]
  We prove that Kilian's four-message succinct argument system is post-quantum secure in the standard model. This yields the first post-quantum succinct argument system from any falsifiable assumption.
  arXiv  Detail & Related papers  (2021-03-15T05:09:17Z)
• Computing conditional entropies for quantum correlations [10.549307055348596]
  In particular, we find new upper bounds on the minimal global detection efficiency required to perform device-independent quantum key distribution. We introduce the family of iterated mean quantum R'enyi divergences with parameters $alpha_k = 1+frac12k-1$ for positive integers $k$. We show that the corresponding conditional entropies admit a particularly nice form which, in the context of device-independent optimization, can be relaxed to a semidefinite programming problem.
  arXiv  Detail & Related papers  (2020-07-24T15:27:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.