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

Convex Split Lemma without Inequalities

Gilad Gour

Published Feb 10, 2025• 5 citations
arXivHTMLPDF

Abstract

We introduce a refinement to the convex split lemma by replacing the max mutual information with the collision mutual information, transforming the inequality into an equality. This refinement yields tighter achievability bounds for quantum source coding tasks, including state merging and state splitting. Furthermore, we derive a universal upper bound on the smoothed max mutual information, where "universal" signifies that the bound depends exclusively on Rényi entropies and is independent of the system's dimensions. This result has significant implications for quantum information processing, particularly in applications such as the reverse quantum Shannon theorem.

DOI
10.48550/arxiv.2502.06526

Related papers

Quantum Reverse Shannon Theorem Simplified

Gilad Gour

We revisit the quantum reverse Shannon theorem, a central result in quantum information theory that characterizes the resources needed to simulate quantum channels when entanglement is freely available. We derive a universal additive upper bound on the smoothed max-information in terms of the sandwiched Rényi mutual information. This bound yields tighter single-shot results, eliminates the need for the post-selection technique, and leads to a conceptually simpler proof of the quantum reverse Shannon theorem. By consolidating and streamlining earlier approaches, our result provides a clearer and more direct understanding of the resource costs of simulating quantum channels.

arXiv:2510.04552•Oct 6, 2025•0 citations

Achievability bounds on quantum state redistribution using convex split and position based decoding

Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi

Quantum state redistribution is a fundamental quantum information theoretic primitive that captures a generic quantum communication scenario. In this work, we study the problem of entanglement assisted quantum state redistribution in one-shot setting and provide a new achievability result on the quantum communication required. Our bounds are in terms of max relative entropy and Rényi relative entropy of order 2. We show that our result is upper bounded by the result obtained in Berta, Christandl, Touchette (2016) (which is in terms of smooth conditional max and min entropies). We use the techniques of convex split and position based decoding (through pretty good measurement) to arrive at our result. Furthermore, in order to clarify the connection between our result and other recent results that use convex split and position based decoding, we prove a new relation between the hypothesis testing relative entropy and Rényi relative entropy of order 2.

IEEE Information Theory Workshop (ITW)•Nov 1, 2017•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

One-shot inner bounds for quantum multiple-access one-time pad

CHENG Feiran, LIU Xiaoming, Zhengjun Xi

We consider the one-shot coding of multiple access channels one-time pad. Suppose that the senders and the receiver share an entangled state in the multi-party systems. Using the position-based coding, each sender encodes the classical messages on their systems, then they transmit their systems over the ideal quantum channels. The receiver applies a decoding operator to all the systems in order to figure out which message was transmitted with respect to the quantum joint typicality lemma. We provide the upper bound of the information leakage by the convex split lemma. Combining quantum max-information with quantum hypothesis testing mutual information, we give the inner bound of the achievable rate.

Zhongguo kexue. Wulixue Lixue Tianwenxue•Feb 27, 2025•0 citations

Reliability Function of Quantum Information Decoupling

Ke Li, Yongsheng Yao

Quantum information decoupling is an important quantum information processing task, which has found broad applications. In this paper, we characterize the performance of catalytic quantum information decoupling regarding the exponential rate under which perfect decoupling is approached, namely, the reliability function. We have obtained the exact formula when the decoupling cost is not larger than a critical value. In the situation of high cost, we provide upper and lower bounds. This result is then applied to quantum state merging and correlation erasure, exploiting their connection to decoupling. As technical tools, we derive the exponents for smoothing the conditional min-entropy and max-information, and we prove a novel bound for the convex-split lemma. Our results are given in terms of the sandwiched Renyi divergence, providing it with operational meanings in characterizing how fast the performance of quantum information tasks approach the perfect.

•Nov 11, 2021•4 citations

Tight Analysis of Convex Splitting with Applications in Quantum Information Theory

Hao–Chung Cheng, Li Gao

Convex splitting is a powerful technique in quantum information theory that applies to proving the achievability of numerous information-processing protocols. In this paper, we establish a one-shot error exponent and a one-shot strong converse for convex splitting with trace distance as the error criterion. Our result exhibits the following features. Firstly, the derived error exponent is given in terms of a generalized sandwiched Rényi mutual information which is additive for product states. Hence, our bound directly applies to the n-fold product scenario for any blocklength. Secondly, the one-shot error bound is meaningful in the sense that the error exponent is all positive on the achievable rate region. This leads to new one-shot exponent results in various tasks in quantum information theory. Conversely, we prove a one-shot strong converse to demonstrate that the convex splitting error converges to one exponentially fast at rates outside the achievable rate region. We also establish an optimal one-shot characterization of the sample complexity for convex splitting, which yields matched second-order asymptotics, showing the tightness of our result. This then leads to a stronger one-shot analysis in quantum information theory.Our technique is to introduce a unified functional analytic approach using Kosaki’s noncommutative weighted Lpnorm. Our results then follow from tight analysis based on such a norm framework.The full version of the manuscript can be found at [arXiv:2304.12055] [1].

IEEE International Symposium on Information Theory (ISIT)•Jun 25, 2023•5 citations
We introduce a refinement to the convex split lemma by replacing the max mutual information with the collision mutual information, transforming the inequality into an equality. This refinement yields tighter achievability bounds for quantum source coding tasks, including state merging and state splitting. Furthermore, we derive a universal upper bound on the smoothed max mutual information, where "universal" signifies that the bound depends exclusively on Rényi entropies and is independent of the system's dimensions. This result has significant implications for quantum information processing, particularly in applications such as the reverse quantum Shannon theorem.
We revisit the quantum reverse Shannon theorem, a central result in quantum information theory that characterizes the resources needed to simulate quantum channels when entanglement is freely available. We derive a universal additive upper bound on the smoothed max-information in terms of the sandwiched Rényi mutual information. This bound yields tighter single-shot results, eliminates the need for the post-selection technique, and leads to a conceptually simpler proof of the quantum reverse Shannon theorem. By consolidating and streamlining earlier approaches, our result provides a clearer and more direct understanding of the resource costs of simulating quantum channels.
Quantum state redistribution is a fundamental quantum information theoretic primitive that captures a generic quantum communication scenario. In this work, we study the problem of entanglement assisted quantum state redistribution in one-shot setting and provide a new achievability result on the quantum communication required. Our bounds are in terms of max relative entropy and Rényi relative entropy of order 2. We show that our result is upper bounded by the result obtained in Berta, Christandl, Touchette (2016) (which is in terms of smooth conditional max and min entropies). We use the techniques of convex split and position based decoding (through pretty good measurement) to arrive at our result. Furthermore, in order to clarify the connection between our result and other recent results that use convex split and position based decoding, we prove a new relation between the hypothesis testing relative entropy and Rényi relative entropy of order 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.
We consider the one-shot coding of multiple access channels one-time pad. Suppose that the senders and the receiver share an entangled state in the multi-party systems. Using the position-based coding, each sender encodes the classical messages on their systems, then they transmit their systems over the ideal quantum channels. The receiver applies a decoding operator to all the systems in order to figure out which message was transmitted with respect to the quantum joint typicality lemma. We provide the upper bound of the information leakage by the convex split lemma. Combining quantum max-information with quantum hypothesis testing mutual information, we give the inner bound of the achievable rate.
Quantum information decoupling is an important quantum information processing task, which has found broad applications. In this paper, we characterize the performance of catalytic quantum information decoupling regarding the exponential rate under which perfect decoupling is approached, namely, the reliability function. We have obtained the exact formula when the decoupling cost is not larger than a critical value. In the situation of high cost, we provide upper and lower bounds. This result is then applied to quantum state merging and correlation erasure, exploiting their connection to decoupling. As technical tools, we derive the exponents for smoothing the conditional min-entropy and max-information, and we prove a novel bound for the convex-split lemma. Our results are given in terms of the sandwiched Renyi divergence, providing it with operational meanings in characterizing how fast the performance of quantum information tasks approach the perfect.
Convex splitting is a powerful technique in quantum information theory that applies to proving the achievability of numerous information-processing protocols. In this paper, we establish a one-shot error exponent and a one-shot strong converse for convex splitting with trace distance as the error criterion. Our result exhibits the following features. Firstly, the derived error exponent is given in terms of a generalized sandwiched Rényi mutual information which is additive for product states. Hence, our bound directly applies to the n-fold product scenario for any blocklength. Secondly, the one-shot error bound is meaningful in the sense that the error exponent is all positive on the achievable rate region. This leads to new one-shot exponent results in various tasks in quantum information theory. Conversely, we prove a one-shot strong converse to demonstrate that the convex splitting error converges to one exponentially fast at rates outside the achievable rate region. We also establish an optimal one-shot characterization of the sample complexity for convex splitting, which yields matched second-order asymptotics, showing the tightness of our result. This then leads to a stronger one-shot analysis in quantum information theory.Our technique is to introduce a unified functional analytic approach using Kosaki’s noncommutative weighted Lpnorm. Our results then follow from tight analysis based on such a norm framework.The full version of the manuscript can be found at [arXiv:2304.12055] [1].