Bounding the forward classical capacity of bipartite quantum channels
arXiv:2010.01058 · doi:10.1109/TIT.2022.3233924
Abstract
We introduce various measures of forward classical communication for bipartite quantum channels. Since a point-to-point channel is a special case of a bipartite channel, the measures reduce to measures of classical communication for point-to-point channels. As it turns out, these reduced measures have been reported in prior work of Wang et al. on bounding the classical capacity of a quantum channel. As applications, we show that the measures are upper bounds on the forward classical capacity of a bipartite channel. The reduced measures are upper bounds on the classical capacity of a point-to-point quantum channel assisted by a classical feedback channel. Some of the various measures can be computed by semi-definite programming.
arXiv commentv3: 29 pages, 6 figures, final version accepted for publication in IEEE Transactions on Information Theory
References in corpus (48)
- Mixed State Entanglement and Quantum Error Correction
- On quantum Renyi entropies: a new generalization and some properties
- General Entanglement Breaking Channels
- Superadditivity of communication capacity using entangled inputs
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
- Codes for the Quantum Erasure Channel
- An improved bound on distillable entanglement
- One-Shot Classical-Quantum Capacity and Hypothesis Testing
- A Fully Quantum Asymptotic Equipartition Property
- Monotonicity of a relative Rényi entropy
- Causal and localizable quantum operations
- The quantum capacity of channels with arbitrarily correlated noise
- Additivity of the Classical Capacity of Entanglement-Breaking Quantum Channels
- On the quantum Renyi relative entropies and related capacity formulas
- On the capacities of bipartite Hamiltonians and unitary gates
- Separability properties of tripartite states with UxUxU-symmetry
- Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
- Approaches for approximate additivity of the Holevo information of quantum channels
- Properties of Conjugate Channels with Applications to Additivity and Multiplicativity
- Semicausal operations are semilocalizable
- On entanglement-assisted classical capacity
- Amortized Channel Divergence for Asymptotic Quantum Channel Discrimination
- On the power of PPT-preserving and non-signalling codes
- Principles of Quantum Communication Theory: A Modern Approach
- On quantum non-signalling boxes
- Semidefinite programming strong converse bounds for classical capacity
- Extensive nonadditivity of privacy
- Remarks on the classical capacity of quantum channel
- Generalized Entropies
- Geometric distinguishability measures limit quantum channel estimation and discrimination
- Optimized quantum f-divergences and data processing
- Fundamental limits on the capacities of bipartite quantum interactions
- Extendibility limits the performance of quantum processors
- Entanglement and secret-key-agreement capacities of bipartite quantum interactions and read-only memory devices
- Classical communication over a quantum interference channel
- Amortization does not enhance the max-Rains information of a quantum channel
- Defining quantum divergences via convex optimization
- Compatible quantum correlations: on extension problems for Werner and isotropic states
- Entropy power inequalities for qudits
- On converse bounds for classical communication over quantum channels
- Quantum -divergences in von Neumann algebras II. Maximal -divergences
- Two-way quantum communication channels
- Strong converse exponents for the feedback-assisted classical capacity of entanglement-breaking channels
- A new quantum version of f-divergence
- Quantum enhancement of randomness distribution
- The Limit of the Sharp Quantum Rényi Divergence
- Bipartite Quantum Interactions: Entangling and Information Processing Abilities
- Entropy Bound for the Classical Capacity of a Quantum Channel Assisted by Classical Feedback
Cited by in corpus (10)
- Semidefinite programming relaxations for quantum correlations
- The platypus of the quantum channel zoo
- Some continuity properties of quantum Rényi divergences
- Quantum algorithms for matrix geometric means
- Upper Bounds on the Distillable Randomness of Bipartite Quantum States
- Optimized protocols for duplex quantum transduction
- Classical communication cost of a bipartite quantum channel assisted by non-signalling correlations
- Unextendible entanglement of quantum channels
- Extendibility limits quantum-secured communication and key distillation
- Exact Quantum Capacity of Decohering Channels in Arbitrary Dimensions