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

IEEE Information Theory Workshop (ITW)

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

Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi

Published Nov 1, 2017• 0 citations
Publisher

Abstract

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.

DOI
10.1109/itw.2017.8277963

Related papers

A One-Shot Achievability Result for Quantum State Redistribution

Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi

We study the problem of entanglement-assisted quantum state redistribution in the one-shot setting and provide a new achievability result on the quantum communication required. Our bounds are in terms of the max-relative entropy and the hypothesis testing relative entropy. We use the techniques of convex split and position-based decoding to arrive at our result. We show that our result is upper bounded by the result obtained in Berta et al. (2016).

arXiv:1702.02396•IEEE Transactions on Information Theory•Nov 29, 2017•21 citations

Smooth min-max relative entropy based bounds for one-shot classical and quantum state redistribution.

Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi

We study the problem of state redistribution both in the classical (shared randomness assisted) and quantum (entanglement assisted) one-shot settings and provide new upper bounds on the communication required. Our classical bounds are in terms of smooth-min and max relative entropies and the quantum bounds are in terms of max relative entropy and Renyi relative entropy of order $\frac{1}{2}$. We also consider a special case of this problem in the classical setting, previously studied by Braverman and Rao (2011). We show that their upper bound is optimal. In addition we provide an alternate protocol achieving a priory different looking upper bound. However, we show that our upper bound is essentially the same as their upper bound and hence also optimal. For the quantum case, we show that our achievability result is upper bounded by the achievability result obtained in Berta, Christandl, Touchette (2016).

•Feb 8, 2017•2 citations

Induced Quantum Divergence: A New Lens on Communication and Source Coding

Gilad Gour

This paper introduces the induced divergence, a new quantum divergence measure that replaces the hypothesis testing divergence in position-based decoding, simplifying the analysis of quantum communication and state redistribution while yielding tighter achievability bounds. Derived from a parent quantum relative entropy, it retains key properties such as data processing inequality and Löwner monotonicity. Like the hypothesis testing divergence, it depends on a smoothing parameter and interpolates between the parent relative entropy (as the smoothing parameter approaches one) and the min-relative entropy (as it approaches zero), the latter holding when applied to the sandwiched Rényi relative entropy of order $α\in[0,2]$. This framework refines the position-based decoding lemma, extending its applicability to a broader class of states and improving decoding success probabilities. Two key applications are considered: classical communication over quantum channels, where the induced divergence improves lower bounds on the distillable communication rate, and quantum state redistribution, where it leads to sharper bounds on communication costs. These results provide new insights into fundamental single-shot quantum information protocols and enhance existing analytical techniques.

arXiv:2502.13669•Feb 19, 2025•1 citation

Convex-Split and Hypothesis Testing Approach to One-Shot Quantum Measurement Compression and Randomness Extraction

Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi

This paper concerns the problem of quantum measurement compression with side information in the one-shot setting with shared-randomness. In this problem, Alice shares a pure quantum state with Bob and the reference system. She performs a measurement on her registers and wishes to communicate the outcome to Bob using shared-randomness and classical communication. The outcome that Bob receives must be correctly correlated with the reference system and his own registers. Our goal is to concurrently minimize the classical communication and shared-randomness cost. The suggested protocol presented in this paper is based on convex-split and position based decoding. The communication is upper bounded in terms of smooth max and hypothesis testing relative entropies. A second protocol addresses the task of strong randomness extraction in the presence of quantum side information. The protocol provides an error guarantee in terms of relative entropy (as opposed to trace distance) and extracts close to the optimal number of uniform bits. As an application, we provide a new achievability result for the task of quantum measurement compression without feedback, in which Alice does not need to know the outcome of the measurement. The result achieves the optimal number of bits communicated and the required number of bits of shared-randomness, for the same task in the asymptotic and i.i.d. setting.

arXiv:1703.02342•IEEE Transactions on Information Theory•May 8, 2019•27 citations

Building Blocks for Communication Over Noisy Quantum Nerworks

Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi

Capacity of a quantum channel characterizes the limits of reliable communication through a noisy quantum channel. This fundamental information theoretic question is very well studied specially in the setting of many independent uses of the channel. An important scenario, both from practical and conceptual point of view, is when the channel can be used only once. This is known as the one-shot channel coding problem. We provide a tight characterization of the one-shot entanglement assisted classical capacity of a quantum channel. We arrive at our result by introducing a simple decoding technique which we refer to as position-based decoding. We also consider two other important quantum network scenarios: quantum channel with a jammer and quantum broadcast channel. For these problems, we use the recently introduced convex split technique [1] in addition to position based decoding. Our approach exhibits that the simultaneous use of these two techniques provides a uniform and conceptually simple framework for designing communication protocols for quantum networks.

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

Applications of position-based coding to classical communication over quantum channels

Haoyu Qi, Qingle Wang, Mark M. Wilde

Abstract Recently, a coding technique called position-based coding has been used to establish achievability statements for various kinds of classical communication protocols that use quantum channels. In the present paper, we apply this technique in the entanglement-assisted setting in order to establish lower bounds for error exponents, lower bounds on the second-order coding rate, and one-shot lower bounds. We also demonstrate that position-based coding can be a powerful tool for analyzing other communication settings. In particular, we reduce the quantum simultaneous decoding conjecture for entanglement-assisted or unassisted communication over a quantum multiple access channel to open questions in multiple quantum hypothesis testing. We then determine achievable rate regions for entanglement-assisted or unassisted classical communication over a quantum multiple-access channel, when using a particular quantum simultaneous decoder. The achievable rate regions given in this latter case are generally suboptimal, involving differences of Rényi-two entropies and conditional quantum entropies.

arXiv:1704.01361•Journal of Physics A Mathematical and Theoretical•Sep 19, 2018•54 citations
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 study the problem of state redistribution both in the classical (shared randomness assisted) and quantum (entanglement assisted) one-shot settings and provide new upper bounds on the communication required. Our classical bounds are in terms of smooth-min and max relative entropies and the quantum bounds are in terms of max relative entropy and Renyi relative entropy of order 12\frac{1}{2}21​. We also consider a special case of this problem in the classical setting, previously studied by Braverman and Rao (2011). We show that their upper bound is optimal. In addition we provide an alternate protocol achieving a priory different looking upper bound. However, we show that our upper bound is essentially the same as their upper bound and hence also optimal. For the quantum case, we show that our achievability result is upper bounded by the achievability result obtained in Berta, Christandl, Touchette (2016).
This paper introduces the induced divergence, a new quantum divergence measure that replaces the hypothesis testing divergence in position-based decoding, simplifying the analysis of quantum communication and state redistribution while yielding tighter achievability bounds. Derived from a parent quantum relative entropy, it retains key properties such as data processing inequality and Löwner monotonicity. Like the hypothesis testing divergence, it depends on a smoothing parameter and interpolates between the parent relative entropy (as the smoothing parameter approaches one) and the min-relative entropy (as it approaches zero), the latter holding when applied to the sandwiched Rényi relative entropy of order α∈[0,2]α\in[0,2]α∈[0,2]. This framework refines the position-based decoding lemma, extending its applicability to a broader class of states and improving decoding success probabilities. Two key applications are considered: classical communication over quantum channels, where the induced divergence improves lower bounds on the distillable communication rate, and quantum state redistribution, where it leads to sharper bounds on communication costs. These results provide new insights into fundamental single-shot quantum information protocols and enhance existing analytical techniques.
This paper concerns the problem of quantum measurement compression with side information in the one-shot setting with shared-randomness. In this problem, Alice shares a pure quantum state with Bob and the reference system. She performs a measurement on her registers and wishes to communicate the outcome to Bob using shared-randomness and classical communication. The outcome that Bob receives must be correctly correlated with the reference system and his own registers. Our goal is to concurrently minimize the classical communication and shared-randomness cost. The suggested protocol presented in this paper is based on convex-split and position based decoding. The communication is upper bounded in terms of smooth max and hypothesis testing relative entropies. A second protocol addresses the task of strong randomness extraction in the presence of quantum side information. The protocol provides an error guarantee in terms of relative entropy (as opposed to trace distance) and extracts close to the optimal number of uniform bits. As an application, we provide a new achievability result for the task of quantum measurement compression without feedback, in which Alice does not need to know the outcome of the measurement. The result achieves the optimal number of bits communicated and the required number of bits of shared-randomness, for the same task in the asymptotic and i.i.d. setting.
Capacity of a quantum channel characterizes the limits of reliable communication through a noisy quantum channel. This fundamental information theoretic question is very well studied specially in the setting of many independent uses of the channel. An important scenario, both from practical and conceptual point of view, is when the channel can be used only once. This is known as the one-shot channel coding problem. We provide a tight characterization of the one-shot entanglement assisted classical capacity of a quantum channel. We arrive at our result by introducing a simple decoding technique which we refer to as position-based decoding. We also consider two other important quantum network scenarios: quantum channel with a jammer and quantum broadcast channel. For these problems, we use the recently introduced convex split technique [1] in addition to position based decoding. Our approach exhibits that the simultaneous use of these two techniques provides a uniform and conceptually simple framework for designing communication protocols for quantum networks.
Abstract Recently, a coding technique called position-based coding has been used to establish achievability statements for various kinds of classical communication protocols that use quantum channels. In the present paper, we apply this technique in the entanglement-assisted setting in order to establish lower bounds for error exponents, lower bounds on the second-order coding rate, and one-shot lower bounds. We also demonstrate that position-based coding can be a powerful tool for analyzing other communication settings. In particular, we reduce the quantum simultaneous decoding conjecture for entanglement-assisted or unassisted communication over a quantum multiple access channel to open questions in multiple quantum hypothesis testing. We then determine achievable rate regions for entanglement-assisted or unassisted classical communication over a quantum multiple-access channel, when using a particular quantum simultaneous decoder. The achievable rate regions given in this latter case are generally suboptimal, involving differences of Rényi-two entropies and conditional quantum entropies.