Amortization does not enhance the max-Rains information of a quantum channel
arXiv:1709.04907 · doi:10.1088/1367-2630/aac153
Abstract
Given an entanglement measure , the entanglement of a quantum channel is defined as the largest amount of entanglement that can be generated from the channel, if the sender and receiver are not allowed to share a quantum state before using the channel. The amortized entanglement of a quantum channel is defined as the largest net amount of entanglement that can be generated from the channel, if the sender and receiver are allowed to share an arbitrary state before using the channel. Our main technical result is that amortization does not enhance the entanglement of an arbitrary quantum channel, when entanglement is quantified by the max-Rains relative entropy. We prove this statement by employing semi-definite programming (SDP) duality and SDP formulations for the max-Rains relative entropy and a channel's max-Rains information, found recently in [Wang et al., arXiv:1709.00200]. The main application of our result is a single-letter, strong-converse, and efficiently computable upper bound on the capacity of a quantum channel for transmitting qubits when assisted by positive-partial-transpose preserving (PPT-P) channels between every use of the channel. As the class of local operations and classical communication (LOCC) is contained in PPT-P, our result establishes a benchmark for the LOCC-assisted quantum capacity of an arbitrary quantum channel, which is relevant in the context of distributed quantum computation and quantum key distribution.
arXiv commentv2: 24 pages, 1 figure, final version accepted for publication in New Journal of Physics
References in corpus (37)
- Quantum entanglement
- Mixed State Entanglement and Quantum Error Correction
- Separability Criterion for Density Matrices
- Separability of Mixed States: Necessary and Sufficient Conditions
- Entanglement Measures and Purification Procedures
- Fundamental Limits of Repeaterless Quantum Communications
- General Benchmarks for Quantum Repeaters
- Quantum Nonlocality without Entanglement
- Min- and Max- Relative Entropies and a New Entanglement Monotone
- "Squashed Entanglement" - An Additive Entanglement Measure
- Capacities of Quantum Erasure Channels
- Secure key from bound entanglement
- An improved bound on distillable entanglement
- Converse bounds for private communication over quantum channels
- General paradigm for distilling classical key from quantum states
- On the capacities of bipartite Hamiltonians and unitary gates
- Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
- The squashed entanglement of a quantum channel
- Resource Theory of Coherence - Beyond States
- Optimal Entanglement Generation from Quantum Operations
- Asymptotic Relative Entropy of Entanglement for Orthogonally Invariant States
- On Variational Expressions for Quantum Relative Entropies
- Relative Entropy Bounds on Quantum, Private and Repeater Capacities
- Entanglement Cost of Quantum Channels
- Quantum key distribution based on private states: unconditional security over untrusted channels with zero quantum capacity
- Strong converse rates for quantum communication
- Improved Semidefinite Programming Upper Bound on Distillable Entanglement
- The Fidelity of Recovery is Multiplicative
- Nonlocal Entanglement Transformations Achievable by Separable Operations
- Positivity of linear maps under tensor powers
- Quantum Proofs
- Amortized entanglement of a quantum channel and approximately teleportation-simulable channels
- Unconditional privacy over channels which cannot convey quantum information
- Versatile relative entropy bounds for quantum networks
- "Pretty strong" converse for the quantum capacity of degradable channels
- Squashed entanglement and approximate private states
- A semidefinite programming upper bound of quantum capacity
Cited by in corpus (26)
- Quantifying the magic of quantum channels
- Amortized Channel Divergence for Asymptotic Quantum Channel Discrimination
- Fundamental limitations on distillation of quantum channel resources
- Entanglement cost and quantum channel simulation
- No-go theorems for quantum resource purification II: new approach and channel theory
- Semidefinite programming converse bounds for quantum communication
- Geometric distinguishability measures limit quantum channel estimation and discrimination
- Fundamental limits on the capacities of bipartite quantum interactions
- Entanglement and secret-key-agreement capacities of bipartite quantum interactions and read-only memory devices
- Causal limit on quantum communication
- Defining quantum divergences via convex optimization
- Energy-constrained two-way assisted private and quantum capacities of quantum channels
- Pursuing the fundamental limits for quantum communication
- Resource theory of unextendibility and non-asymptotic quantum capacity
- Capacity Estimates via comparison with TRO channels
- Bounding the forward classical capacity of bipartite quantum channels
- Exact entanglement cost of quantum states and channels under PPT-preserving operations
- Quantifying the performance of approximate teleportation and quantum error correction via symmetric two-PPT-extendibility
- Geometric Rényi Divergence and its Applications in Quantum Channel Capacities
- A hierarchy of efficient bounds on quantum capacities exploiting symmetry
- Computable lower bounds on the entanglement cost of quantum channels
- The squashed entanglement of the noiseless quantum Gaussian attenuator and amplifier
- Information-theoretic aspects of the generalized amplitude damping channel
- Unextendible entanglement of quantum channels
- The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the multimode extreme bosonic Gaussian channels
- Information storage and transmission under Markovian noise