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:2208.02132 · PRX Quantum

Simple and Tighter Derivation of Achievability for Classical Communication Over Quantum Channels

Hao–Chung Cheng

Published Nov 22, 2023• 13 citations
arXivHTMLPDF

Abstract

A judicious application of the so-called pretty-good measurement in quantum coding considerably simplifies the derivation of one-shot achievability, sharpening many existing quantum information-processing protocols.
DOI
10.1103/prxquantum.4.040330

Related papers

Error Exponents for Quantum Packing Problems via An Operator Layer Cake Theorem

Hao–Chung Cheng, Po-Chieh Liu

In this work, we prove a one-shot random coding bound for classical-quantum channel coding, a problem conjectured by Burnashev and Holevo in 1998. By choosing the optimal input distribution, the bound implies the optimal error exponent (i.e., the reliability function) of classical-quantum channels for rates above the critical rate, even in infinite-dimensional Hilbert spaces. Our result extends to various quantum packing-type problems, including classical communication over any fully quantum channel with or without entanglement-assistance, constant composition codes, and classical data compression with quantum side information via fixed-length or variable-length coding. Our technical ingredient is to establish an operator layer cake theorem - the directional derivative of an operator logarithm admits an integral representation of certain projections. This shows that a kind of pretty-good measurement is equivalent to a randomized Holevo-Helstrom measurement, which provides an operational explanation of why the pretty-good measurement is pretty good.

arXiv:2507.06232•Jul 8, 2025•0 citations

The Quantum Reverse Shannon Theorem Based on One-Shot Information Theory

Mario Berta, Matthias Christandl, Renato Renner

•Sep 1, 2011•119 citations

On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity

Shengyu Zhang

Lecture notes in computer science•Jan 1, 2011•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•0 citations

A Simple and Tighter Derivation of Achievability for Classical-Quantum Channel Coding

Hao–Chung Cheng

In this paper, we propose an elegant and simple one-shot achievability proof for classical-quantum channel coding. The established one-shot bound admits a closed-form expression as in the celebrated Holevo–Helstrom Theorem. Namely, the average error probability of sending M messages through a classical-quantum channel is upper bounded by the minimum error of distinguishing the joint state between channel input and output against (M−1)-many products of its marginals. Our result provides the tightest achievable one-shot capacity for classical-quantum channel coding, and it improves the third-order coding rate in the asymptotic scenario. Moreover, the derived bound directly leads to asymptotic achievability results in the large deviation, small deviation, and moderate deviation regimes in a unified manner.The full version of the manuscript can be found at [arXiv:2208.02132] [1].

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

Minimal classical communication and measurement complexity for quantum information splitting of a two-qubit state

Prasanta Kumar Panigrahi, Siddharth Karumanchi, Sreraman Muralidharan

Pramana•Sep 1, 2009•14 citations
In this work, we prove a one-shot random coding bound for classical-quantum channel coding, a problem conjectured by Burnashev and Holevo in 1998. By choosing the optimal input distribution, the bound implies the optimal error exponent (i.e., the reliability function) of classical-quantum channels for rates above the critical rate, even in infinite-dimensional Hilbert spaces. Our result extends to various quantum packing-type problems, including classical communication over any fully quantum channel with or without entanglement-assistance, constant composition codes, and classical data compression with quantum side information via fixed-length or variable-length coding. Our technical ingredient is to establish an operator layer cake theorem - the directional derivative of an operator logarithm admits an integral representation of certain projections. This shows that a kind of pretty-good measurement is equivalent to a randomized Holevo-Helstrom measurement, which provides an operational explanation of why the pretty-good measurement is pretty good.
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.
In this paper, we propose an elegant and simple one-shot achievability proof for classical-quantum channel coding. The established one-shot bound admits a closed-form expression as in the celebrated Holevo–Helstrom Theorem. Namely, the average error probability of sending M messages through a classical-quantum channel is upper bounded by the minimum error of distinguishing the joint state between channel input and output against (M−1)-many products of its marginals. Our result provides the tightest achievable one-shot capacity for classical-quantum channel coding, and it improves the third-order coding rate in the asymptotic scenario. Moreover, the derived bound directly leads to asymptotic achievability results in the large deviation, small deviation, and moderate deviation regimes in a unified manner.The full version of the manuscript can be found at [arXiv:2208.02132] [1].