Extendibility limits the performance of quantum processors

Abstract

Resource theories in quantum information science are helpful for the study and quantification of the performance of information-processing tasks that involve quantum systems. These resource theories also find applications in other areas of study; e.g., the resource theories of entanglement and coherence have found use and implications in the study of quantum thermodynamics and memory effects in quantum dynamics. In this paper, we introduce the resource theory of unextendibility, which is associated to the inability of extending quantum entanglement in a given quantum state to multiple parties. The free states in this resource theory are the k-extendible states, and the free channels are k-extendible channels, which preserve the class of k-extendible states. We make use of this resource theory to derive non-asymptotic, upper bounds on the rate at which quantum communication or entanglement preservation is possible by utilizing an arbitrary quantum channel a finite number of times, along with the assistance of k-extendible channels at no cost. We then show that the bounds obtained are significantly tighter than previously known bounds for quantum communication over both the depolarizing and erasure channels.

7 pages, 2 figures, see companion paper at arXiv:1803.10710

References in corpus (46)

• Quantum entanglement
• Mixed State Entanglement and Quantum Error Correction
• Satellite-to-ground quantum key distribution
• The capacity of the noisy quantum channel
• Quantum data processing and error correction
• Building logical qubits in a superconducting quantum computing system
• Quantum cloning
• Multipartite entanglement for continuous variables: A quantum teleportation network
• Optimal Universal and State-Dependent Quantum Cloning
• Experimental Comparison of Two Quantum Computing Architectures
• Min- and Max- Relative Entropies and a New Entanglement Monotone
• A simple all-microwave entangling gate for fixed-frequency superconducting qubits
• Fundamental rate-loss tradeoff for optical quantum key distribution
• A complete family of separability criteria
• Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)
• Information transmission through a noisy quantum channel
• Codes for the Quantum Erasure Channel
• Capacities of Quantum Erasure Channels
• The general structure of quantum resource theories
• Distinguishing separable and entangled states
• An improved bound on distillable entanglement
• One-Shot Classical-Quantum Capacity and Hypothesis Testing
• Quantum cloning and the capacity of the Pauli channel
• On Quantum Fidelities and Channel Capacities
• The quantum capacity of channels with arbitrarily correlated noise
• Fault tolerant quantum computation with very high threshold for loss errors
• Converse bounds for private communication over quantum channels
• Optimizing practical entanglement distillation
• Fundamental bound on the reliability of quantum information transmission
• On the strong converses for the quantum channel capacity theorems
• The squashed entanglement of a quantum channel
• Finite blocklength converse bounds for quantum channels
• Degradability of Bosonic Gaussian channels
• The quantum capacity with symmetric side channels
• Quantum Coding with Finite Resources
• Remarks on the classical capacity of quantum channel
• Quantum and private capacities of low-noise channels
• Fundamental limits on the capacities of bipartite quantum interactions
• Amortized entanglement of a quantum channel and approximately teleportation-simulable channels
• Realization schemes for quantum instruments in finite dimensions
• Entanglement and secret-key-agreement capacities of bipartite quantum interactions and read-only memory devices
• Thresholds for correcting errors, erasures, and faulty syndrome measurements in degenerate quantum codes
• "Pretty strong" converse for the quantum capacity of degradable channels
• Compatible quantum correlations: on extension problems for Werner and isotropic states
• One-way quantum key distribution: Simple upper bound on the secret key rate
• Simple test for quantum channel capacity

Cited by in corpus (23)

• Quantifying the magic of quantum channels
• Semidefinite programming relaxations for quantum correlations
• Entanglement cost and quantum channel simulation
• Geometric distinguishability measures limit quantum channel estimation and discrimination
• Quantum Channel Marginal Problem
• Quantum marginal problem and incompatibility
• Unifying different notions of quantum incompatibility into a strict hierarchy of resource theories of communication
• Semidefinite programming hierarchies for constrained bilinear optimization
• Resource theory of unextendibility and non-asymptotic quantum capacity
• Extendibility of bosonic Gaussian states
• Testing symmetry on quantum computers
• Bounding the forward classical capacity of bipartite quantum channels
• Quantifying the performance of approximate teleportation and quantum error correction via symmetric two-PPT-extendibility
• Estimate distillable entanglement and quantum capacity by squeezing useless entanglement
• Cycle Index Polynomials and Generalized Quantum Separability Tests
• Quantifying the unextendibility of entanglement
• Schrödinger as a Quantum Programmer: Estimating Entanglement via Steering
• A Post-Quantum Associative Memory
• Quantum Computational Complexity and Symmetry
• Extendible quantum measurements and limitations on classical communication
• Squashed quantum non-Markovianity: a measure of genuine quantum non-Markovianity in states
• Unextendible entanglement of quantum channels
• Extendibility limits quantum-secured communication and key distillation