Semidefinite programming strong converse bounds for classical capacity
arXiv:1610.06381 · doi:10.1109/TIT.2017.2741101
Abstract
We investigate the classical communication over quantum channels when assisted by no-signaling (NS) and positive-partial-transpose-preserving (PPT) codes, for which both the optimal success probability of a given transmission rate and the one-shot -error capacity are formalized as semidefinite programs (SDPs). Based on this, we obtain improved SDP finite blocklength converse bounds of general quantum channels for entanglement-assisted codes and unassisted codes. Furthermore, we derive two SDP strong converse bounds for the classical capacity of general quantum channels: for any code with a rate exceeding either of the two bounds of the channel, the success probability vanishes exponentially fast as the number of channel uses increases. In particular, applying our efficiently computable bounds, we derive an improved upper bound on the classical capacity of the amplitude damping channel. We also establish the strong converse property for the classical and private capacities of a new class of quantum channels. We finally study the zero-error setting and provide efficiently computable upper bounds on the one-shot zero-error capacity of a general quantum channel.
arXiv comment26 pages; v2, v3 updated reference and results; v4 published in IEEE Transactions on Information Theory
References in corpus (58)
- General Benchmarks for Quantum Repeaters
- Fundamental Limits of Repeaterless Quantum Communications
- Quantum correlations with no causal order
- Entanglement-Assisted Classical Capacity of Noisy Quantum 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
- Coding Theorem and Strong Converse for Quantum Channels
- Information Spectrum Approach to Second-Order Coding Rate in Channel Coding
- Capacities of Quantum Erasure Channels
- Secure key from bound entanglement
- Transforming quantum operations: quantum supermaps
- Quantum Information Processing with Finite Resources -- Mathematical Foundations
- One-Shot Classical-Quantum Capacity and Hypothesis Testing
- A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
- Causal and localizable quantum operations
- Additivity for a class of unital qubit channels
- The Quantum Reverse Shannon Theorem based on One-Shot Information Theory
- Strong Converse to the Quantum Channel Coding Theorem
- Unconditional security from noisy quantum storage
- Converse bounds for private communication over quantum channels
- Improving zero-error classical communication with entanglement
- Information-capacity description of spin-chain correlations
- Zero-error communication via quantum channels, non-commutative graphs and a quantum Lovasz theta function
- The squashed entanglement of a quantum channel
- Finite blocklength converse bounds for quantum channels
- Semicausal operations are semilocalizable
- Noisy channel coding via privacy amplification and information reconciliation
- A strong converse for classical channel coding using entangled inputs
- On the power of PPT-preserving and non-signalling codes
- Relative Entropy Bounds on Quantum, Private and Repeater Capacities
- On quantum non-signalling boxes
- Quantum Coding with Finite Resources
- Zero-error channel capacity and simulation assisted by non-local correlations
- Generalized relative entropies and the capacity of classical-quantum channels
- No-Signalling Assisted Zero-Error Capacity of Quantum Channels and an Information Theoretic Interpretation of the Lovasz Number
- Second-Order Asymptotics for the Classical Capacity of Image-Additive Quantum Channels
- One-shot entanglement-assisted quantum and classical communication
- Superactivation of the Asymptotic Zero-Error Classical Capacity of a Quantum Channel
- Improved Semidefinite Programming Upper Bound on Distillable Entanglement
- A linear program for the finite block length converse of Polyanskiy-Poor-Verdú via non-signalling codes
- The Fidelity of Recovery is Multiplicative
- Entanglement can increase asymptotic rates of zero-error classical communication over classical channels
- Squashed entanglement and approximate private states
- An improved semidefinite programming hierarchy for testing entanglement
- Decoding quantum information via the Petz recovery map
- Nonadditivity of Rains' bound for distillable entanglement
- Strong converse for the classical capacity of the pure-loss bosonic channel
- Extending additivity from symmetric to asymmetric channels
- A semidefinite programming upper bound of quantum capacity
- Entanglement between Two Uses of a Noisy Multipartite Quantum Channel Enables Perfect Transmission of Classical Information
- Indistinguishability of bipartite states by positive-partial-transpose operations in the many-copy scenario
- Maximal Privacy Without Coherence
- Entangled inputs cannot make imperfect quantum channels perfect
- On zero-error communication via quantum channels in the presence of noiseless feedback
- Moderate Deviation Analysis for Classical-Quantum Channels and Quantum Hypothesis Testing
- Approximate broadcasting of quantum correlations
- Maximum privacy without coherence, zero-error
- On the Complexity of Computing Zero-Error and Holevo Capacity of Quantum Channels
Cited by in corpus (42)
- One-shot coherence distillation
- Approaches for approximate additivity of the Holevo information of quantum channels
- Principles of Quantum Communication Theory: A Modern Approach
- Application of the Resource Theory of Channels to Communication Scenarios
- Quantum Channel Simulation and the Channel's Smooth Max-Information
- Semidefinite programming relaxations for quantum correlations
- Entanglement of a bipartite channel
- Fundamental limitations on distillation of quantum channel resources
- Non-asymptotic entanglement distillation
- Semidefinite programming converse bounds for quantum communication
- Defining quantum divergences via convex optimization
- Quantum Channel Marginal Problem
- On converse bounds for classical communication over quantum channels
- Semidefinite programming hierarchies for constrained bilinear optimization
- Generic nonadditivity of quantum capacity in simple channels
- Pursuing the fundamental limits for quantum communication
- The Communication Value of a Quantum Channel
- Bounding the forward classical capacity of bipartite quantum channels
- Variational Quantum Algorithms for Semidefinite Programming
- The platypus of the quantum channel zoo
- Bounding quantum capacities via partial orders and complementarity
- Geometric Rényi Divergence and its Applications in Quantum Channel Capacities
- Quantifying the performance of approximate teleportation and quantum error correction via symmetric two-PPT-extendibility
- Separation between quantum Lovász number and entanglement-assisted zero-error classical capacity
- Lower and upper bounds on nonunital qubit channel capacities
- Degradability of Fermionic Gaussian Channels
- Operational Interpretation of the Choi Rank Through k-State Exclusion
- The noisy Werner-Holevo channel and its properties
- Upper Bounds on the Distillable Randomness of Bipartite Quantum States
- Moderate Deviation Analysis for Classical-Quantum Channels and Quantum Hypothesis Testing
- Computable entanglement cost under positive partial transpose operations
- Shadow Simulation of Quantum Processes
- Optimality of meta-converse for channel simulation
- How Deep the Theory of Quantum Communications Goes: Superadditivity, Superactivation and Causal Activation
- Capacities of a two-parameter family of noisy Werner-Holevo channels
- Information-theoretic aspects of the generalized amplitude damping channel
- Converse bounds for classical communication over quantum networks
- Extendible quantum measurements and limitations on classical communication
- Classical communication cost of a bipartite quantum channel assisted by non-signalling correlations
- Joint Power and User Grouping Optimization in Cell-Free Massive MIMO Systems
- Tripartite-to-bipartite Entanglement Transformation by Stochastic Local Operations and Classical Communication and the Structure of Matrix Spaces
- Information storage and transmission under Markovian noise