Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
From MaRDI portal
Publication:2630723
Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum state estimation, approximate cloning (81P50) Quantum coding (general) (81P70) Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40) Other types of codes (94B60)
Abstract: 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 relative entropy registered between the channels. The strong converse part of the lemma states that any attempt to make the Type II error decay to zero at a rate faster than the channel relative entropy implies that the Type I error necessarily converges to one. We then refine this latter result by identifying the optimal strong converse exponent for this task. As a consequence of these results, we can establish a strong converse theorem for the quantum-feedback-assisted capacity of a channel, sharpening a result due to Bowen. Furthermore, our channel discrimination result demonstrates the asymptotic optimality of a non-adaptive tensor-power strategy in the setting of quantum illumination, as was used in prior work on the topic. The sandwiched Renyi relative entropy is a key tool in our analysis. Finally, by combining our results with recent results of Hayashi and Tomamichel, we find a novel operational interpretation of the mutual information of a quantum channel N as the optimal type II error exponent when discriminating between a large number of independent instances of N and an arbitrary "worst-case" replacer channel chosen from the set of all replacer channels.
Recommendations
- Amortized channel divergence for asymptotic quantum channel discrimination
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy
- Strong converse exponent for classical-quantum channel coding
- Multiplicativity of completely bounded \(p\)-norms implies a strong converse for entanglement-assisted capacity
- Strong converse for identification via quantum channels
Cites work
- A Fully Quantum Asymptotic Equipartition Property
- A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
- A Minkowski type trace inequality and strong subadditivity of quantum entropy. II: Convexity and concavity
- A relation between completely bounded norms and conjugate channels
- Asymptotic error rates in quantum hypothesis testing
- Concavity of certain maps on positive definite matrices and applications to Hadamard products
- Conditional expectation in an operator algebra. IV. Entropy and information
- Convex trace functions and the Wigner-Yanase-Dyson conjecture
- Discrimination of Two Channels by Adaptive Methods and Its Application to Quantum System
- Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
- Feedback does not affect the reliability function of a DMC at rates above capacity (Corresp.)
- General formulas for capacity of classical-quantum channels
- scientific article; zbMATH DE number 1216173 (Why is no real title available?)
- scientific article; zbMATH DE number 3071410 (Why is no real title available?)
- Hypothesis testing and information theory
- Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing
- Minimax Theorems
- Monotonicity of a relative Rényi entropy
- Multiplicativity of completely bounded p-norms implies a new additivity result
- Multiplicativity of completely bounded \(p\)-norms implies a strong converse for entanglement-assisted capacity
- On entanglement-assisted classical capacity
- On Error Exponents in Quantum Hypothesis Testing
- On quantum Rényi entropies: a new generalization and some properties
- On the Quantum Rényi Relative Entropies and Related Capacity Formulas
- On the reliability function for a quantum communication channel.
- Quantum Feedback Channels
- Quantum hypothesis testing and the operational interpretation of the quantum Rényi relative entropies
- Quantum information theory. An introduction.
- Quasi-entropies for finite quantum systems
- Reliability function of a discrete memoryless channel at rates above capacity (Corresp.)
- Reliability function of general classical-quantum channel
- Sandwiched Rényi divergence satisfies data processing inequality
- Second-order asymptotics for quantum hypothesis testing
- SECURITY OF QUANTUM KEY DISTRIBUTION
- Strong converse and Stein's lemma in quantum hypothesis testing
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy
- Strong Converse Rates for Quantum Communication
- The capacity of the quantum channel with general signal states
- The proper formula for relative entropy and its asymptotics in quantum probability
- The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels
Cited in
(45)- Quantum channel discrimination without entanglement
- Geometric Rényi divergence and its applications in quantum channel capacities
- On distinguishability distillation and dilution exponents
- Strong converse for the feedback-assisted classical capacity of entanglement-breaking channels
- Amortized channel divergence for asymptotic quantum channel discrimination
- Data processing for the sandwiched Rényi divergence: a condition for equality
- Strong converse exponent for classical-quantum channel coding
- An entropy function of a quantum channel
- Quantifying dynamical total coherence in a resource non-increasing framework
- Geometric distinguishability measures limit quantum channel estimation and discrimination
- Strong converse theorems using Rényi entropies
- Correlation detection and an operational interpretation of the Rényi mutual information
- Swiveled Rényi entropies
- Preservation of a quantum Rényi relative entropy implies existence of a recovery map
- Applications of position-based coding to classical communication over quantum channels
- On the second-order asymptotics for entanglement-assisted communication
- DISCRIMINATING QUANTUM CHANNELS WITH RELATIVE ENTROPY
- Rényi relative entropies of quantum Gaussian states
- Optimized quantum f-divergences and data processing
- Sandwiched Rényi relative entropy on density operators
- Computation of sandwiched relative α-entropy of two n-mode Gaussian states
- Strong convergence of quantum channels: Continuity of the Stinespring dilation and discontinuity of the unitary dilation
- Chain rules for quantum Rényi entropies
- Rényi generalizations of the conditional quantum mutual information
- Temperature driven quenches in the Ising model: appearance of negative Rényi mutual information
- Different quantum f-divergences and the reversibility of quantum operations
- A Strong Converse Theorem for Quantum Multiple Access Channels
- Recoverability for optimized quantum f-divergences
- The strong converse exponent of discriminating infinite-dimensional quantum states
- Generalized smooth mutual max-information of quantum channel
- Memory effects displayed in the evolution of continuous variable system
- Operational interpretation of the sandwiched Rényi divergence of order 1/2 to 1 as strong converse exponents
- Reliability function of quantum information decoupling via the sandwiched Rényi divergence
- Space-time generalization of mutual information
- Comparing two entropy functions of a quantum channel
- Smooth min-entropy lower bounds for approximation chains
- Postselected communication over quantum channels
- Error exponent of activated non-signaling-assisted classical-quantum channel coding
- Structure theorem for quantum replacer codes
- Asymptotic equipartition theorems in von Neumann algebras
- Sampling complexity of quantum channel discrimination
- Generalized -observational entropy
- Fundamental limitations on the recoverability of quantum processes
- Continuity inequalities for sandwiched Rényi and Tsallis conditional entropies with application to the channel entropy continuity
- Generalized quantum asymptotic equipartition
This page was built for publication: Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2630723)
