Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2601.19182 · IEEE Transactions on Information Theory

The strong converse exponent of composable randomness extraction against quantum side information

Roberto Rubboli, Marco Tomamichel

quant-phSubmitted Jan 27, 2026• Announced Jan 28, 2026• 8 citations• Revised Sep 26, 2026 (v2)
v1 · Jan 27, 2026v2 · Sep 26, 2026
arXivHTMLPDF

Abstract

We find a tight characterization of the strong converse exponent for randomness extraction against quantum side information. In contrast to previous tight bounds, we employ a composable error criterion given by the fidelity (or purified distance) to a uniform distribution in product with the marginal state. Our characterization is formulated in terms of the club-sandwiched conditional entropy, recently introduced by Rubboli, Goodarzi, and Tomamichel. It extends the corresponding result for classical side information, whose strong converse exponent was first established by Berta and Yao and later recovered by Li, Li, and Yu within this entropic framework. This provides the first precise operational interpretation of this family of conditional entropies in the quantum setting.

Comments
Added a section on universal protocols

Related papers

Strong Converse Exponents of Quantum Soft Covering and Privacy Amplification

Shi-Bing Li, Hongsen Qiu, Xinyu Zhang

We determine the exact strong converse exponent of quantum soft covering under the sandwiched R{é}nyi divergence for all orders $α\in[\frac{1}{2},\infty)$. For $α\in[\frac{1}{2},1)$, the exponent is characterized by the two-parameter club-sandwiched mutual information, whereas for $α\in[1,\infty)$, it is characterized by the order-$α$ sandwiched R{é}nyi mutual information. We also determine the exact strong converse exponent of privacy amplification against quantum side information under the sandwiched R{é}nyi divergence for $α\in(2,\infty)$, expressed in terms of the corresponding order-$α$ sandwiched R{é}nyi conditional entropy. To the best of our knowledge, these results provide the first exact characterization of the strong converse exponent of quantum soft covering and the first precise operational interpretation of the two-parameter club-sandwiched mutual information in the quantum setting. The key ingredient is that we establish the exponential rate of the $K$-functional, which is instrumental in deriving the strong converse exponent of quantum soft covering for $α\in[\frac{1}{2},1)$.

quant-pharXiv:2608.16452•Aug 18, 2026•0 citations

Strong Converse Exponent of Quantum State Merging

Mario Berta, Hao-Chung Cheng, Roberto Rubboli +1 more

We determine the strong converse exponent for the entanglement cost of quantum state merging, showing that it is characterized by the optimized $α$-$z$ conditional Rényi entropies with $z=α/2\in[1/2,1]$. This contrasts with the sandwiched conditional Rényi entropies that typically govern strong converse exponents in quantum information theory. As a consequence, we derive the strong converse exponent of the partially smoothed conditional min-entropy in purified distance. This exponent is governed by club-sandwiched conditional entropies, whereas global smoothing leads to a sandwiched expression.

quant-pharXiv:2608.27202•Aug 28, 2026•4 citations

Rethinking quantum smooth entropies: Tight one-shot analysis of quantum privacy amplification

Bartosz Regula, Marco Tomamichel

We introduce an improved one-shot characterisation of randomness extraction against quantum side information (privacy amplification), strengthening known one-shot bounds and providing a unified derivation of the tightest known asymptotic constraints. Our main tool is a new class of smooth conditional entropies defined by lifting classical smooth divergences through measurements. A key role is played by the measured smooth Rényi relative entropy of order 2, which we show to admit an equivalent variational form: it can be understood as allowing for smoothing over not only states, but also non-positive Hermitian operators. Building on this, we establish a tightened leftover hash lemma, significantly improving over all known smooth min-entropy bounds on extractable randomness and recovering the sharpest classical achievability results. We extend these methods to decoupling, the coherent analogue of privacy amplification, obtaining a corresponding improved one-shot bound. Relaxing our smooth entropy bounds leads to one-shot achievability results in terms of measured Rényi divergences, tightening the bounds of [Dupuis, arXiv:2105.05342] and recovering state-of-the-art asymptotic i.i.d. error exponents. We show an approximate optimality of our results by giving a matching one-shot converse bound up to additive logarithmic terms. This yields an optimal second-order asymptotic expansion of privacy amplification under trace distance, establishing a significantly tighter one-shot achievability result than previously shown in [Shen et al., arXiv:2202.11590] and proving its optimality for all hash functions.

quant-pharXiv:2603.04493•Mar 6, 2026•11 citations

Error Exponents and Strong Converse Exponents for Classical Data Compression with Quantum Side Information

Hao–Chung Cheng, Eric P. Hanson, Nilanjana Datta +1 more

In this paper, we analyze classical data compression with quantum side information (also known as the classical-quantum Slepian- Wolf protocol) in the so-called large and moderate deviation regimes. In the non-asymptotic setting, the protocol involves compressing classical sequences of finite length n and decoding them with the assistance of quantum side information. In the large deviation regime, the compression rate is fixed, and we obtain bounds on the error exponent function, which characterizes the minimal probability of error as a function of the rate. Devetak and Winter showed that the asymptotic data compression limit for this protocol is given by a conditional entropy. For any protocol with a rate below this quantity, the probability of error converges to one asymptotically and its speed of convergence is given by the strong converse exponent function. We obtain finite blocklength bounds on this function, and determine exactly its asymptotic value, thus improving on previous results by Tomamichel. In the moderate deviation regime for the compression rate, the latter is no longer considered to be fixed. It is allowed to depend on the blocklength n, but assumed to decay slowly to the asymptotic data compression limit. Starting from a rate above this limit, we determine the speed of convergence of the error probability to zero and show that it is given in terms of the conditional information variance. Our results complement earlier results obtained by Tomamichel and Hayashi, in which they analyzed the so-called small deviation regime of this protocol.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2018•1 citation

Strong Converse for Privacy Amplification against Quantum Side Information

Yuchen Shen, Li Gao, Hao–Chung Cheng

We establish a one-shot strong converse bound for privacy amplification against quantum side information with trace distance as a security criterion. Firstly, our result shows that the trace distance converges to 1 exponentially fast for any finite blocklength when the rate of the extractable randomness exceeds the conditional von Neumann entropy of Alice given Eavesdropper. Secondly, we obtain a second-order converse bound for the maximal extractable randomness. Thirdly, our result extends to the moderate deviation regime. Namely, when the rate of the extractable randomness approaches the conditional von Neumann entropy from above with speed slower than $O\left( {1/\sqrt n } \right.$, the trace distance still converges to 1 asymptotically. Lastly, our result yields strong converse to entropy accumulation, which complements the recent result by Dupuis [arXiv:2105.05342]. The full manuscript can be assessed in [1], [2].

arXiv:2202.10263•IEEE International Symposium on Information Theory (ISIT)•Jun 26, 2022•13 citations

Strong converse theorems using Rényi entropies

Felix Leditzky, Mark M. Wilde, Nilanjana Datta

We use a Rényi entropy method to prove strong converse theorems for certain information-theoretic tasks which involve local operations and quantum (or classical) communication between two parties. These include state redistribution, coherent state merging, quantum state splitting, measurement compression with quantum side information, randomness extraction against quantum side information, and data compression with quantum side information. The method we employ in proving these results extends ideas developed by Sharma [preprint arXiv:1404.5940 [quant-ph] (2014)], which he used to give a new proof of the strong converse theorem for state merging. For state redistribution, we prove the strong converse property for the boundary of the entire achievable rate region in the (e, q)-plane, where e and q denote the entanglement cost and quantum communication cost, respectively. In the case of measurement compression with quantum side information, we prove a strong converse theorem for the classical communication cost, which is a new result extending the previously known weak converse. For the remaining tasks, we provide new proofs for strong converse theorems previously established using smooth entropies. For each task, we obtain the strong converse theorem from explicit bounds on the figure of merit of the task in terms of a Rényi generalization of the optimal rate. Hence, we identify candidates for the strong converse exponents for each task discussed in this paper. To prove our results, we establish various new entropic inequalities, which might be of independent interest. These involve conditional entropies and mutual information derived from the sandwiched Rényi divergence. In particular, we obtain novel bounds relating these quantities, as well as the Rényi conditional mutual information, to the fidelity of two quantum states.

arXiv:1506.02635•Journal of Mathematical Physics•Aug 1, 2016•44 citations
We find a tight characterization of the strong converse exponent for randomness extraction against quantum side information. In contrast to previous tight bounds, we employ a composable error criterion given by the fidelity (or purified distance) to a uniform distribution in product with the marginal state. Our characterization is formulated in terms of the club-sandwiched conditional entropy, recently introduced by Rubboli, Goodarzi, and Tomamichel. It extends the corresponding result for classical side information, whose strong converse exponent was first established by Berta and Yao and later recovered by Li, Li, and Yu within this entropic framework. This provides the first precise operational interpretation of this family of conditional entropies in the quantum setting.
We determine the exact strong converse exponent of quantum soft covering under the sandwiched R{é}nyi divergence for all orders α∈[12,∞)α\in[\frac{1}{2},\infty)α∈[21​,∞). For α∈[12,1)α\in[\frac{1}{2},1)α∈[21​,1), the exponent is characterized by the two-parameter club-sandwiched mutual information, whereas for α∈[1,∞)α\in[1,\infty)α∈[1,∞), it is characterized by the order-ααα sandwiched R{é}nyi mutual information. We also determine the exact strong converse exponent of privacy amplification against quantum side information under the sandwiched R{é}nyi divergence for α∈(2,∞)α\in(2,\infty)α∈(2,∞), expressed in terms of the corresponding order-ααα sandwiched R{é}nyi conditional entropy. To the best of our knowledge, these results provide the first exact characterization of the strong converse exponent of quantum soft covering and the first precise operational interpretation of the two-parameter club-sandwiched mutual information in the quantum setting. The key ingredient is that we establish the exponential rate of the KKK-functional, which is instrumental in deriving the strong converse exponent of quantum soft covering for α∈[12,1)α\in[\frac{1}{2},1)α∈[21​,1).
We determine the strong converse exponent for the entanglement cost of quantum state merging, showing that it is characterized by the optimized ααα-zzz conditional Rényi entropies with z=α/2∈[1/2,1]z=α/2\in[1/2,1]z=α/2∈[1/2,1]. This contrasts with the sandwiched conditional Rényi entropies that typically govern strong converse exponents in quantum information theory. As a consequence, we derive the strong converse exponent of the partially smoothed conditional min-entropy in purified distance. This exponent is governed by club-sandwiched conditional entropies, whereas global smoothing leads to a sandwiched expression.
We introduce an improved one-shot characterisation of randomness extraction against quantum side information (privacy amplification), strengthening known one-shot bounds and providing a unified derivation of the tightest known asymptotic constraints. Our main tool is a new class of smooth conditional entropies defined by lifting classical smooth divergences through measurements. A key role is played by the measured smooth Rényi relative entropy of order 2, which we show to admit an equivalent variational form: it can be understood as allowing for smoothing over not only states, but also non-positive Hermitian operators. Building on this, we establish a tightened leftover hash lemma, significantly improving over all known smooth min-entropy bounds on extractable randomness and recovering the sharpest classical achievability results. We extend these methods to decoupling, the coherent analogue of privacy amplification, obtaining a corresponding improved one-shot bound. Relaxing our smooth entropy bounds leads to one-shot achievability results in terms of measured Rényi divergences, tightening the bounds of [Dupuis, arXiv:2105.05342] and recovering state-of-the-art asymptotic i.i.d. error exponents. We show an approximate optimality of our results by giving a matching one-shot converse bound up to additive logarithmic terms. This yields an optimal second-order asymptotic expansion of privacy amplification under trace distance, establishing a significantly tighter one-shot achievability result than previously shown in [Shen et al., arXiv:2202.11590] and proving its optimality for all hash functions.
In this paper, we analyze classical data compression with quantum side information (also known as the classical-quantum Slepian- Wolf protocol) in the so-called large and moderate deviation regimes. In the non-asymptotic setting, the protocol involves compressing classical sequences of finite length n and decoding them with the assistance of quantum side information. In the large deviation regime, the compression rate is fixed, and we obtain bounds on the error exponent function, which characterizes the minimal probability of error as a function of the rate. Devetak and Winter showed that the asymptotic data compression limit for this protocol is given by a conditional entropy. For any protocol with a rate below this quantity, the probability of error converges to one asymptotically and its speed of convergence is given by the strong converse exponent function. We obtain finite blocklength bounds on this function, and determine exactly its asymptotic value, thus improving on previous results by Tomamichel. In the moderate deviation regime for the compression rate, the latter is no longer considered to be fixed. It is allowed to depend on the blocklength n, but assumed to decay slowly to the asymptotic data compression limit. Starting from a rate above this limit, we determine the speed of convergence of the error probability to zero and show that it is given in terms of the conditional information variance. Our results complement earlier results obtained by Tomamichel and Hayashi, in which they analyzed the so-called small deviation regime of this protocol.
We establish a one-shot strong converse bound for privacy amplification against quantum side information with trace distance as a security criterion. Firstly, our result shows that the trace distance converges to 1 exponentially fast for any finite blocklength when the rate of the extractable randomness exceeds the conditional von Neumann entropy of Alice given Eavesdropper. Secondly, we obtain a second-order converse bound for the maximal extractable randomness. Thirdly, our result extends to the moderate deviation regime. Namely, when the rate of the extractable randomness approaches the conditional von Neumann entropy from above with speed slower than O(1/nO\left( {1/\sqrt n } \right.O(1/n​, the trace distance still converges to 1 asymptotically. Lastly, our result yields strong converse to entropy accumulation, which complements the recent result by Dupuis [arXiv:2105.05342]. The full manuscript can be assessed in [1], [2].
We use a Rényi entropy method to prove strong converse theorems for certain information-theoretic tasks which involve local operations and quantum (or classical) communication between two parties. These include state redistribution, coherent state merging, quantum state splitting, measurement compression with quantum side information, randomness extraction against quantum side information, and data compression with quantum side information. The method we employ in proving these results extends ideas developed by Sharma [preprint arXiv:1404.5940 [quant-ph] (2014)], which he used to give a new proof of the strong converse theorem for state merging. For state redistribution, we prove the strong converse property for the boundary of the entire achievable rate region in the (e, q)-plane, where e and q denote the entanglement cost and quantum communication cost, respectively. In the case of measurement compression with quantum side information, we prove a strong converse theorem for the classical communication cost, which is a new result extending the previously known weak converse. For the remaining tasks, we provide new proofs for strong converse theorems previously established using smooth entropies. For each task, we obtain the strong converse theorem from explicit bounds on the figure of merit of the task in terms of a Rényi generalization of the optimal rate. Hence, we identify candidates for the strong converse exponents for each task discussed in this paper. To prove our results, we establish various new entropic inequalities, which might be of independent interest. These involve conditional entropies and mutual information derived from the sandwiched Rényi divergence. In particular, we obtain novel bounds relating these quantities, as well as the Rényi conditional mutual information, to the fidelity of two quantum states.