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:2608.27202

Strong Converse Exponent of Quantum State Merging

Mario Berta, Hao-Chung Cheng, Roberto Rubboli, Marco Tomamichel

quant-phcs.ITSubmitted Aug 27, 2026• Announced Aug 28, 2026• 4 citations
arXivHTMLPDF

Abstract

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.

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 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

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

Roberto Rubboli, Marco Tomamichel

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.

quant-pharXiv:2601.19182•IEEE Transactions on Information Theory•Jan 28, 2026•8 citations

Tight any-shot quantum decoupling

Mario Berta, Hao-Chung Cheng, Yongsheng Yao

Quantum information decoupling is a fundamental primitive in quantum information theory, underlying various applications in quantum physics. We prove a novel one-shot decoupling theorem formulated in terms of quantum relative entropy distance, with the decoupling error bounded by two sandwiched Rényi conditional entropies. In the asymptotic i.i.d. setting of standard information decoupling via partial trace, we show that this bound is ensemble-tight in quantum relative entropy distance and thereby yields a characterization of the associated decoupling error exponent in the low-cost-rate regime. Leveraging this framework, we derive several operational applications formulated in terms of purified distance: (i) single-letter expressions for the exact error exponents of quantum state merging in the low-entanglement-cost and high-entanglement-distillation-rate regimes, in terms of Petz-Rényi conditional entropies, and (ii) regularized expressions for achievable error exponents of entanglement distillation and quantum channel coding in terms of Petz-Rényi coherent informations. We further prove that these achievable bounds are tight for maximally correlated states and generalized dephasing channels, respectively, for the high distillation-rate/coding-rate regimes.

quant-pharXiv:2602.17430•Feb 20, 2026•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 a strong converse theorem for the task of quantum state redistribution. More precisely, we establish the strong converse property for the boundary of the entire achievable rate region in the (e, q)-plane, where the entanglement cost e and quantum communication cost q are the operational rates describing a state redistribution protocol. The strong converse property is deduced from explicit bounds on the fidelity of the protocol in terms of a Rényi generalization of the optimal rates. Hence, we identify candidates for the strong converse exponents for entanglement cost e and quantum communication cost q, respectively. 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 to the fidelity of two quantum states.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2016•0 citations

Exponents for Classical-Quantum Channel Simulation in Purified Distance

Aadil Oufkir, Yongsheng Yao, Mario Berta

We determine the exact error and strong converse exponent for entanglement-assisted classical-quantum channel simulation in worst case input purified distance. The error exponent is expressed as a single-letter formula optimized over sandwiched Rényi divergences of order $α\in [1, \infty)$, notably without the need for a critical rate--a sharp contrast to the error exponent for classical-quantum channel coding. The strong converse exponent is expressed as a single-letter formula optimized over sandwiched Rényi divergences of order $α\in [\frac{1}{2},1]$. As in the classical work [Oufkir et al., arXiv:2410.07051], we start with the goal of asymptotically expanding the meta-converse for channel simulation in the relevant regimes. However, to deal with non-commutativity issues arising from classical-quantum channels and entanglement-assistance, we critically use various properties of the quantum fidelity, additional auxiliary channel techniques, approximations via Chebyshev inequalities, and entropic continuity bounds.

arXiv:2410.10770•IEEE Transactions on Information Theory•May 6, 2026•6 citations
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 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 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.
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.
Quantum information decoupling is a fundamental primitive in quantum information theory, underlying various applications in quantum physics. We prove a novel one-shot decoupling theorem formulated in terms of quantum relative entropy distance, with the decoupling error bounded by two sandwiched Rényi conditional entropies. In the asymptotic i.i.d. setting of standard information decoupling via partial trace, we show that this bound is ensemble-tight in quantum relative entropy distance and thereby yields a characterization of the associated decoupling error exponent in the low-cost-rate regime. Leveraging this framework, we derive several operational applications formulated in terms of purified distance: (i) single-letter expressions for the exact error exponents of quantum state merging in the low-entanglement-cost and high-entanglement-distillation-rate regimes, in terms of Petz-Rényi conditional entropies, and (ii) regularized expressions for achievable error exponents of entanglement distillation and quantum channel coding in terms of Petz-Rényi coherent informations. We further prove that these achievable bounds are tight for maximally correlated states and generalized dephasing channels, respectively, for the high distillation-rate/coding-rate regimes.
We use a Rényi entropy method to prove a strong converse theorem for the task of quantum state redistribution. More precisely, we establish the strong converse property for the boundary of the entire achievable rate region in the (e, q)-plane, where the entanglement cost e and quantum communication cost q are the operational rates describing a state redistribution protocol. The strong converse property is deduced from explicit bounds on the fidelity of the protocol in terms of a Rényi generalization of the optimal rates. Hence, we identify candidates for the strong converse exponents for entanglement cost e and quantum communication cost q, respectively. 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 to the fidelity of two quantum states.
We determine the exact error and strong converse exponent for entanglement-assisted classical-quantum channel simulation in worst case input purified distance. The error exponent is expressed as a single-letter formula optimized over sandwiched Rényi divergences of order α∈[1,∞)α\in [1, \infty)α∈[1,∞), notably without the need for a critical rate--a sharp contrast to the error exponent for classical-quantum channel coding. The strong converse exponent is expressed as a single-letter formula optimized over sandwiched Rényi divergences of order α∈[12,1]α\in [\frac{1}{2},1]α∈[21​,1]. As in the classical work [Oufkir et al., arXiv:2410.07051], we start with the goal of asymptotically expanding the meta-converse for channel simulation in the relevant regimes. However, to deal with non-commutativity issues arising from classical-quantum channels and entanglement-assistance, we critically use various properties of the quantum fidelity, additional auxiliary channel techniques, approximations via Chebyshev inequalities, and entropic continuity bounds.