Unextendible entanglement of quantum channels
arXiv:2407.15944 · doi:10.1109/TIT.2025.3566737
Abstract
Quantum communication relies on the existence of high quality quantum channels to exchange information. In practice, however, all communication links are affected by noise from the environment. Here we investigate the ability of quantum channels to perform quantum communication tasks by restricting the participants to use only local operations and one-way classical communication (one-way LOCC) along with the available quantum channel. In particular, a channel can be used to distill a highly entangled state between two parties, which further enables quantum or private communication. In this work, we invoke the framework of superchannels to study the distillation of a resourceful quantum state, such as a maximally entangled state or a private state, using multiple instances of a point-to-point quantum channel. We use the idea of -extendibility to obtain a semidefinite relaxation of the set of one-way LOCC superchannels and define a class of entanglement measures for quantum channels that decrease monotonically under such superchannels; therefore these measures, dubbed collectively the ``unextendible entanglement of a channel'', yield upper bounds on several communication-theoretic quantities of interest in the regimes of resource distillation and zero error. We then generalize the formalism of -extendibility to bipartite superchannels, thus obtaining functions that are monotone under two-extendible superchannels. This allows us to analyze probabilistic distillation of ebits or secret key bits from a bipartite state when using a resourceful quantum channel. Moreover, we propose semidefinite programs to evaluate several of these quantities, providing a computationally feasible method of comparison between quantum channels for resource distillation.
arXiv comment32+13 pages, 8 figures
References in corpus (46)
- Quantum entanglement
- The Quantum Internet
- Mixed State Entanglement and Quantum Error Correction
- On quantum Renyi entropies: a new generalization and some properties
- Feasible Entanglement Purification for Quantum Communication
- A simple formula for the average gate fidelity of a quantum dynamical operation
- Noncommuting mixed states cannot be broadcast
- General Entanglement Breaking Channels
- Creation of entangled states of distant atoms by interference
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
- Min- and Max- Relative Entropies and a New Entanglement Monotone
- A complete family of separability criteria
- Codes for the Quantum Erasure Channel
- Capacities of Quantum Erasure Channels
- Distinguishing separable and entangled states
- Secure key from bound entanglement
- Transforming quantum operations: quantum supermaps
- Quantum Channel Capacity of Very Noisy Channels
- Causal and localizable quantum operations
- On Quantum Fidelities and Channel Capacities
- General paradigm for distilling classical key from quantum states
- On the quantum Renyi relative entropies and related capacity formulas
- Optimizing practical entanglement distillation
- Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
- Comparison of Quantum Channels by Superchannels
- Approaches for approximate additivity of the Holevo information of quantum channels
- Semicausal operations are semilocalizable
- A resource theory of quantum memories and their faithful verification with minimal assumptions
- On the power of PPT-preserving and non-signalling codes
- Dynamical Entanglement
- Geometric distinguishability measures limit quantum channel estimation and discrimination
- Amortized entanglement of a quantum channel and approximately teleportation-simulable channels
- Extendibility limits the performance of quantum processors
- 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
- Semidefinite programming hierarchies for constrained bilinear optimization
- Resource theory of unextendibility and non-asymptotic quantum capacity
- Bounding the forward classical capacity of bipartite quantum channels
- On channels with positive quantum zero-error capacity having vanishing n-shot capacity
- On quantum capacity of erasure channel assisted by back classical communication
- Quantifying the performance of approximate teleportation and quantum error correction via symmetric two-PPT-extendibility
- A hierarchy of efficient bounds on quantum capacities exploiting symmetry
- Entanglement generation with a quantum channel and a shared state
- Quantifying the unextendibility of entanglement
- Maximum privacy without coherence, zero-error