We provide the sandwiched Rényi divergence of order $α\in(\frac{1}{2},1)$, as well as its induced quantum information quantities, with an operational interpretation in the characterization of the exact strong converse exponents of quantum tasks. Specifically, we consider (a) smoothing of the max-relative entropy, (b) quantum privacy amplification, and (c) quantum information decoupling. We solve the problem of determining the exact strong converse exponents for these three tasks, with the performance being measured by the fidelity or purified distance. The results are given in terms of the sandwiched Rényi divergence of order $α\in(\frac{1}{2},1)$, and its induced quantum Rényi conditional entropy and quantum Rényi mutual information. This is the first time to find the precise operational meaning for the sandwiched Rényi divergence with Rényi parameter in the interval $α\in(\frac{1}{2},1)$.
A strong converse theorem for the classical capacity of a quantum channel states that the probability of correctly decoding a classical message converges exponentially fast to zero in the limit of many channel uses if the rate of communication exceeds the classical capacity of the channel. Along with a corresponding achievability statement for rates below the capacity, such a strong converse theorem enhances our understanding of the capacity as a very sharp dividing line between achievable and unachievable rates of communication. Here, we show that such a strong converse theorem holds for the …
RWTH Aachen University（亚琛工业大学）；Imperial College London（帝国理工学院）；National Taiwan University（台湾大学）；National Center for Theoretical Sciences（国家理论科学中心）；Hon Hai (Foxconn) Quantum Computing Center（鸿海（富士康）量子计算中心）；University of Copenhagen（哥本哈根大学）；National University of Singapore（新加坡国立大学）；Centre for Quantum Technologies（量子技术中心）
There are different inequivalent ways to define the Rényi capacity of a channel for a fixed input distribution $P$. In a 1995 paper Csiszár has shown that for classical discrete memoryless channels there is a distinguished such quantity that has an operational interpretation as a generalized cutoff rate for constant composition channel coding. We show that the analogous notion of Rényi capacity, defined in terms of the sandwiched quantum Rényi divergences, has the same operational interpretation in the strong converse problem of classical-quantum channel coding. Denoting the constant compositi…
The fully quantum reverse Shannon theorem establishes the optimal rate of noiseless classical communication required for simulating the action of many instances of a noisy quantum channel on an arbitrary input state, while also allowing for an arbitrary amount of shared entanglement of an arbitrary form. Turning this theorem around establishes a strong converse for the entanglement-assisted classical capacity of any quantum channel. This paper proves the strong converse for entanglement-assisted capacity by a completely different approach and identifies a bound on the strong converse exponent …
We study the speed of convergence of a primitive quantum time evolution towards its fixed point in the distance of sandwiched Rényi divergences. For each of these distance measures the convergence is typically exponentially fast and the best exponent is given by a constant (similar to a logarithmic Sobolev constant) depending only on the generator of the time evolution. We establish relations between these constants and the logarithmic Sobolev constants as well as the spectral gap. An important consequence of these relations is the derivation of mixing time bounds for time evolutions directly …
How well can we approximate a quantum channel output state using a random codebook with a certain size? In this work, we study the quantum soft covering problem. Namely, we use a random codebook with codewords independently sampled from a prior distribution and send it through a classical-quantum channel to approximate the target state. When using a random codebook sampled from an independent and identically distributed prior with a rate above the quantum mutual information, we show that the expected trace distance between the codebook-induced state and the target state decays with exponent gi…
This paper studies the difficulty of discriminating between an arbitrary quantum channel and a "replacer" channel that discards its input and replaces it with a fixed state. We show that, in this particular setting, the most general adaptive discrimination strategies provide no asymptotic advantage over non-adaptive tensor-power strategies. This conclusion follows by proving a quantum Stein's lemma for this channel discrimination setting, showing that a constant bound on the Type I error leads to the Type II error decreasing to zero exponentially quickly at a rate determined by the maximum rel…
Quantum entanglement can be used in a communication scheme to establish a correlation between successive channel inputs that is impossible by classical means. It is known that the classical capacity of quantum channels can be enhanced by such entangled encoding schemes, but this is not always the case. In this paper, we prove that a strong converse theorem holds for the classical capacity of an entanglement-breaking channel even when it is assisted by a classical feedback link from the receiver to the transmitter. In doing so, we identify a bound on the strong converse exponent, which determin…
We introduce a new quantum Rényi divergence $D^{\#}_α$ for $α\in (1,\infty)$ defined in terms of a convex optimization program. This divergence has several desirable computational and operational properties such as an efficient semidefinite programming representation for states and channels, and a chain rule property. An important property of this new divergence is that its regularization is equal to the sandwiched (also known as the minimal) quantum Rényi divergence. This allows us to prove several results. First, we use it to get a converging hierarchy of upper bounds on the regularized sand…
We study quantum dichotomies and the resource theory of asymmetric distinguishability using a generalization of Strassen's theorem on preordered semirings. We find that an asymptotic variant of relative submajorization, defined on unnormalized dichotomies, is characterized by real-valued monotones that are multiplicative under the tensor product and additive under the direct sum. These strong constraints allow us to classify and explicitly describe all such monotones, leading to a rate formula expressed as an optimization involving sandwiched Rényi divergences. As an application we give a new …
Continuity of Regularized Channel Rényi Divergences
Zyphra；QICI Quantum Information and Computation Initiative, School of Computing and Data Science, The University of Hong Kong（量子信息与计算倡议，计算与数据科学学院，香港大学）
Rényi and Augustin information are generalizations of mutual information defined via the Rényi divergence, playing a significant role in evaluating the performance of information processing tasks by virtue of its connection to the error exponent analysis. In quantum information theory, there are three generalizations of the classical Rényi divergence -- the Petz's, sandwiched, and log-Euclidean versions, that possess meaningful operational interpretation. However, the associated quantum Rényi and Augustin information are much less explored compared with their classical counterpart, and lacking…
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 [arXiv:1404.5940], which he used to give a new proof of the strong converse t…
Quantum Channel Stein's Lemma with an Exponential Strong Converse
Institute of Software, Chinese Academy of Sciences（中国科学院软件研究所）；University of Chinese Academy of Sciences（中国科学院大学）；Department of Computer Science and Technology, Tsinghua University（清华大学计算机科学与技术系）
This dissertation investigates relative entropies, also called generalized divergences, and how they can be used to characterize information-theoretic tasks in quantum information theory. The main goal is to further refine characterizations of the optimal rates for quantum source coding, state redistribution, and measurement compression with quantum side information via second order asymptotic expansions and strong converse theorems. The dissertation consists of a mathematical and an information-theoretic part. In the mathematical part, we focus on the $α$-sandwiched Rényi divergence ($α$-SRD)…
One possibility of defining a quantum Rényi $α$-divergence of two quantum states is to optimize the classical Rényi $α$-divergence of their post-measurement probability distributions over all possible measurements (measured Rényi divergence), and maybe regularize these quantities over multiple copies of the two states (regularized measured Rényi $α$-divergence). A key observation behind the theorem for the strong converse exponent of asymptotic binary quantum state discrimination is that the regularized measured Rényi $α$-divergence coincides with the sandwiched Rényi $α$-divergence when $α>1$…
Quantum Channel Stein Theorem beyond Definite Causal Order
QudeLeap Research, Shanghai 200030, China（科跃研究）；Thrust of Artificial Intelligence, Information Hub,The Hong Kong University of Science and Technology (Guangzhou), Guangzhou 511453, China（香港科技大学（广州）人工智能 thrust 信息枢纽）
From Symmetry to Secrecy: Covariant Classical--Quantum Wiretap Channels
School of Data Science, The Chinese University of Hong Kong, Shenzhen（香港中文大学（深圳）数据科学学院）；International Quantum Academy（国际量子学院）；Graduate School of Mathematics, Nagoya University（名古屋大学大学院数学研究科）；Dahlem Center for Complex Quantum Systems, Freie Universität Berlin（柏林自由大学达勒姆复杂量子系统中心）；Perimeter Institute for Theoretical Physics（理论物理珀米特研究所）；Institute for Quantum Computing, University of Waterloo（滑铁卢大学量子计算研究所）
Additivity of quantum relative entropies as a single-copy criterion
School of Mathematics, Institute for Research in Fundamental Sciences (IPM)（基础科学研究所）；Centre for Quantum Technologies, National University of Singapore（新加坡国立大学量子技术中心）；Department of Electrical and Computer Engineering, College of Design and Engineering, National University of Singapore（新加坡国立大学设计与工程学院电气与计算机工程系）
