Optimal one-shot entanglement sharing

Abstract

Sharing entanglement across quantum interconnects is fundamental for quantum information processing. We discuss a practical setting where this interconnect, modeled by a quantum channel, is used once with the aim of sharing high fidelity entanglement. For any channel, we provide methods to easily find both this maximum fidelity and optimal inputs that achieve it. Unlike most metrics for sharing entanglement, this maximum fidelity can be shown to be multiplicative. This ensures a complete understanding in the sense that the maximum fidelity and optimal inputs found in our one-shot setting extend even when the channel is used multiple times, possibly with other channels. Optimal inputs need not be fully entangled. We find the minimum entanglement in these optimal inputs can even vary discontinuously with channel noise. Generally, noise parameters are hard to identify and remain unknown for most channels. However, for all qubit channels with qubit environments, we provide a rigorous noise parametrization which we explain in-terms of no-cloning. This noise parametrization and a channel representation we call the standard Kraus decomposition have pleasing properties that make them both useful more generally.

arXiv commentEssentially matches published version

References in corpus (34)

• The Quantum Internet
• Mixed State Entanglement and Quantum Error Correction
• Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
• The capacity of the noisy quantum channel
• From Classical to Quantum Shannon Theory
• Quantum Communication With Zero-Capacity Channels
• Quantum cloning and the capacity of the Pauli channel
• The quantum capacity of channels with arbitrarily correlated noise
• Optimal teleportation with a mixed state of two qubits
• Two qubit copying machine for economical quantum eavesdropping
• The structure of degradable quantum channels
• Finite blocklength converse bounds for quantum channels
• On the fidelity of mixed states of two qubits
• Unbounded number of channel uses are required to see quantum capacity
• Quantum Capacities of Channels with small Environment
• One shot entanglement assisted classical and quantum communication over noisy quantum channels: A hypothesis testing and convex split approach
• Optimal Copying of One Quantum Bit
• Quantum Coding with Finite Resources
• The apex of the family tree of protocols: Optimal rates and resource inequalities
• One-shot entanglement-assisted quantum and classical communication
• Entanglement-annihilating and entanglement-breaking channels
• Semidefinite programming converse bounds for quantum communication
• Local two-qubit entanglement-annihilating channels
• Decoding quantum information via the Petz recovery map
• Capacity estimation and verification of quantum channels with arbitrarily correlated errors
• Generic nonadditivity of quantum capacity in simple channels
• Entropic singularities give rise to quantum transmission
• Optimal fidelity for a quantum channel may be attained by non-maximally entangled states
• Ultimate entanglement robustness of two-qubit states against general local noises
• One-shot quantum error correction of classical and quantum information
• One-shot Capacity bounds on the Simultaneous Transmission of Classical and Quantum Information
• Entanglement sharing through noisy qubit channels: One-shot optimal singlet fraction
• Degradable Quantum Channels Using Pure to Product of Pure States Isometries
• Entanglement sharing via qudit channels: Nonmaximally entangled states may be necessary for one-shot optimal singlet fraction and negativity

Cited by in corpus (2)

• Distilled remote entanglement between superconducting qubits across optical channels
• Maximum expectation of observables with restricted purity states