Geometric Rényi Divergence and its Applications in Quantum Channel Capacities
arXiv:1909.05758 · doi:10.1007/s00220-021-04064-4
Abstract
We present a systematic study of the geometric Rényi divergence (GRD), also known as the maximal Rényi divergence, from the point of view of quantum information theory. We show that this divergence, together with its extension to channels, has many appealing structural properties. For example we prove a chain rule inequality that immediately implies the "amortization collapse" for the geometric Rényi divergence, addressing an open question by Berta et al. [arXiv:1808.01498, Equation (55)] in the area of quantum channel discrimination. As applications, we explore various channel capacity problems and construct new channel information measures based on the geometric Rényi divergence, sharpening the previously best-known bounds based on the max-relative entropy while still keeping the new bounds single-letter efficiently computable. A plethora of examples are investigated and the improvements are evident for almost all cases.
References in corpus (76)
- Fault-tolerant quantum computation by anyons
- Separability of Mixed States: Necessary and Sufficient Conditions
- Quantum Teleportation is a Universal Computational Primitive
- The logarithmic negativity: A full entanglement monotone that is not convex
- Improved Simulation of Stabilizer Circuits
- Entanglement Measures and Purification Procedures
- Fundamental Limits of Repeaterless Quantum Communications
- General Benchmarks for Quantum Repeaters
- A Theory of Fault-Tolerant Quantum Computation
- Fault-tolerant quantum computation with high threshold in two dimensions
- The capacity of the noisy quantum channel
- On quantum Renyi entropies: a new generalization and some properties
- Quantum data processing and error correction
- General Entanglement Breaking Channels
- Superadditivity of communication capacity using entangled inputs
- The Quantum Chernoff Bound
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
- The Resource Theory of Stabilizer Computation
- Min- and Max- Relative Entropies and a New Entanglement Monotone
- A complete family of separability criteria
- Information transmission through a noisy quantum channel
- Magic state distillation with low overhead
- Methodology for quantum logic gate constructions
- Distinguishing separable and entangled states
- Quantum Information Processing with Finite Resources -- Mathematical Foundations
- Quantum Channel Capacity of Very Noisy Channels
- A Sharp Fannes-type Inequality for the von Neumann Entropy
- Computing quantum discord is NP-complete
- Coding Theorems for Quantum Channels
- Quantum Reverse Shannon Theorem
- Additivity for a class of unital qubit channels
- On Quantum Fidelities and Channel Capacities
- Decoherence in Solid State Qubits
- The Chernoff lower bound for symmetric quantum hypothesis testing
- Converse bounds for private communication over quantum channels
- On the capacities of bipartite Hamiltonians and unitary gates
- Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
- Quantifying the magic of quantum channels
- Quantifying magic for multi-qubit operations
- Approaches for approximate additivity of the Holevo information of quantum channels
- The squashed entanglement of a quantum channel
- Fault-Tolerant Computing With Biased-Noise Superconducting Qubits
- Reverse Coherent Information
- Amortized Channel Divergence for Asymptotic Quantum Channel Discrimination
- Unbounded number of channel uses are required to see quantum capacity
- Efficiently computable bounds for magic state distillation
- Different quantum f-divergences and the reversibility of quantum operations
- Semidefinite approximations of the matrix logarithm
- The quantum capacity with symmetric side channels
- Relative Entropy Bounds on Quantum, Private and Repeater Capacities
- Entanglement Cost of Quantum Channels
- Approximate Degradable Quantum Channels
- Structured Codes Improve the Bennett-Brassard-84 Quantum Key Rate
- Strong converse rates for quantum communication
- Semidefinite programming strong converse bounds for classical capacity
- Dephrasure channel and superadditivity of coherent information
- A chain rule for the quantum relative entropy
- The sum-of-squares hierarchy on the sphere, and applications in quantum information theory
- Efficient optimization of the quantum relative entropy
- Distillation with sublogarithmic overhead
- Entanglement of a bipartite channel
- Fault-Tolerant Postselected Quantum Computation: Threshold Analysis
- Semidefinite programming converse bounds for quantum communication
- Positivity of linear maps under tensor powers
- Fundamental limits on the capacities of bipartite quantum interactions
- Superadditivity of private information for any number of uses of the channel
- Additive Extensions of a Quantum Channel
- Amortization does not enhance the max-Rains information of a quantum channel
- Efficient Approximation of Quantum Channel Capacities
- On converse bounds for classical communication over quantum channels
- A semidefinite programming upper bound of quantum capacity
- A strengthened data processing inequality for the Belavkin-Staszewski relative entropy
- Lower and upper bounds on nonunital qubit channel capacities
- Capacity Bounds via Operator Space Methods
- Strong converse for the quantum capacity of the erasure channel for almost all codes
- Information-theoretic aspects of the generalized amplitude damping channel
Cited by in corpus (5)
- A chain rule for the quantum relative entropy
- No-go theorems for quantum resource purification II: new approach and channel theory
- Exponential decay of mutual information for Gibbs states of local Hamiltonians
- Defining quantum divergences via convex optimization
- Black hole microstates vs. the additivity conjectures