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)

Moderate Deviation Analysis for Quantum State Transfer

Navneeth Ramakrishnan, Marco Tomamichel, Mario Berta

Published Oct 17, 2021• 0 citations
Publisher

Abstract

Quantum state transfer involves two parties who use pre-shared entanglement and noiseless communication in order to transfer parts of a quantum state. In this work, we quantity the communication cost of one-shot state splitting in terms of the partially smoothed max-information. We then give an analysis of state splitting in the moderate deviation regime, where the error in the protocol goes sub-exponentially fast to zero as a function of the number of i.i.d. copies. The main technical tool we derive is a tight relation between the partially smoothed max-information and the hypothesis testing relative entropy, which allows us to obtain the expansion of the partially smoothed max-information for i.i.d. states in the moderate deviation regime. This then also establishes the moderate deviation analysis for other variants of state transfer such as state merging and source coding.

DOI
10.1109/itw48936.2021.9611459

Related papers

Moderate Deviation Expansion for Fully Quantum Tasks

Navneeth Ramakrishnan, Marco Tomamichel, Mario Berta

The moderate deviation regime is concerned with the finite block length trade-off between communication cost and error for information processing tasks in the asymptotic regime, where the communication cost approaches a capacity-like quantity and the error vanishes at the same time. We find exact characterisations of these trade-offs for a variety of fully quantum communication tasks, including quantum source coding, quantum state splitting, entanglement-assisted quantum channel coding, and entanglement-assisted quantum channel simulation. The main technical tool we derive is a tight relation between the partially smoothed max-information and the hypothesis testing relative entropy. This allows us to obtain the expansion of the partially smoothed max-information for i.i.d. states in the moderate deviation regime.

arXiv:2112.07167•IEEE Transactions on Information Theory•Mar 29, 2023•16 citations

One-shot Multiparty State Merging

Nicolas Dutil, Patrick M. Hayden

We present a protocol for performing state merging when multiple parties share a single copy of a mixed state, and analyze the entanglement cost in terms of min- and max-entropies. Our protocol allows for interpolation between corner points of the rate region without the need for time-sharing, a primitive which is not available in the one-shot setting. We also compare our protocol to the more naive strategy of repeatedly applying a single-party merging protocol one party at a time, by performing a detailed analysis of the rates required to merge variants of the embezzling states. Finally, we analyze a variation of multiparty merging, which we call split-transfer, by considering two receivers and many additional helpers sharing a mixed state. We give a protocol for performing a split-transfer and apply it to the problem of assisted entanglement distillation.

arXiv:1011.1974•Nov 9, 2010•25 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

Partially Smoothed Information Measures

Anurag Anshu, Mario Berta, Rahul Jain +1 more

Smooth entropies are a tool for quantifying resource trade-offs in (quantum) information theory and cryptography. In typical bi- and multi-partite problems, however, some of the sub-systems are often left unchanged and this is not reflected by the standard smoothing of information measures over a ball of close states. We propose to smooth instead only over a ball of close states which also have some of the reduced states on the relevant sub-systems fixed. This partial smoothing of information measures naturally allows to give more refined characterizations of various information-theoretic problems in the one-shot setting. In particular, we immediately get asymptotic second-order characterizations for tasks such as privacy amplification against classical side information or classical state splitting. For quantum problems like state merging the general resource trade-off is tightly characterized by partially smoothed information measures as well.

arXiv:1807.05630•IEEE Transactions on Information Theory•Mar 18, 2020•40 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

Moderate Deviation Analysis for Classical-Quantum Channels and Quantum Hypothesis Testing

Hao–Chung Cheng, Min-Hsiu Hsieh

In this paper, we study the tradeoffs between the error probabilities of classical-quantum channels and the block-length n when the transmission rates approach the channel capacity at a rate lower than 1/√n, a research topic known as moderate deviation analysis. We show that the optimal error probability vanishes under this rate convergence. Our main technical contributions are a tight quantum sphere-packing bound, obtained via Chaganty and Sethuraman's concentration inequality in strong large deviation theory, and asymptotic expansions of error-exponent functions. Moderate deviation analysis for quantum hypothesis testing is also established. The converse directly follows from our channel coding result, while the achievability relies on a martingale inequality.

arXiv:1701.03195•IEEE Transactions on Information Theory•Dec 8, 2017•50 citations
Quantum state transfer involves two parties who use pre-shared entanglement and noiseless communication in order to transfer parts of a quantum state. In this work, we quantity the communication cost of one-shot state splitting in terms of the partially smoothed max-information. We then give an analysis of state splitting in the moderate deviation regime, where the error in the protocol goes sub-exponentially fast to zero as a function of the number of i.i.d. copies. The main technical tool we derive is a tight relation between the partially smoothed max-information and the hypothesis testing relative entropy, which allows us to obtain the expansion of the partially smoothed max-information for i.i.d. states in the moderate deviation regime. This then also establishes the moderate deviation analysis for other variants of state transfer such as state merging and source coding.
The moderate deviation regime is concerned with the finite block length trade-off between communication cost and error for information processing tasks in the asymptotic regime, where the communication cost approaches a capacity-like quantity and the error vanishes at the same time. We find exact characterisations of these trade-offs for a variety of fully quantum communication tasks, including quantum source coding, quantum state splitting, entanglement-assisted quantum channel coding, and entanglement-assisted quantum channel simulation. The main technical tool we derive is a tight relation between the partially smoothed max-information and the hypothesis testing relative entropy. This allows us to obtain the expansion of the partially smoothed max-information for i.i.d. states in the moderate deviation regime.
We present a protocol for performing state merging when multiple parties share a single copy of a mixed state, and analyze the entanglement cost in terms of min- and max-entropies. Our protocol allows for interpolation between corner points of the rate region without the need for time-sharing, a primitive which is not available in the one-shot setting. We also compare our protocol to the more naive strategy of repeatedly applying a single-party merging protocol one party at a time, by performing a detailed analysis of the rates required to merge variants of the embezzling states. Finally, we analyze a variation of multiparty merging, which we call split-transfer, by considering two receivers and many additional helpers sharing a mixed state. We give a protocol for performing a split-transfer and apply it to the problem of assisted entanglement distillation.
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.
Smooth entropies are a tool for quantifying resource trade-offs in (quantum) information theory and cryptography. In typical bi- and multi-partite problems, however, some of the sub-systems are often left unchanged and this is not reflected by the standard smoothing of information measures over a ball of close states. We propose to smooth instead only over a ball of close states which also have some of the reduced states on the relevant sub-systems fixed. This partial smoothing of information measures naturally allows to give more refined characterizations of various information-theoretic problems in the one-shot setting. In particular, we immediately get asymptotic second-order characterizations for tasks such as privacy amplification against classical side information or classical state splitting. For quantum problems like state merging the general resource trade-off is tightly characterized by partially smoothed information measures as well.
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.
In this paper, we study the tradeoffs between the error probabilities of classical-quantum channels and the block-length n when the transmission rates approach the channel capacity at a rate lower than 1/√n, a research topic known as moderate deviation analysis. We show that the optimal error probability vanishes under this rate convergence. Our main technical contributions are a tight quantum sphere-packing bound, obtained via Chaganty and Sethuraman's concentration inequality in strong large deviation theory, and asymptotic expansions of error-exponent functions. Moderate deviation analysis for quantum hypothesis testing is also established. The converse directly follows from our channel coding result, while the achievability relies on a martingale inequality.