State exchange with quantum side information

Abstract

We consider a quantum communication task between two users Alice and Bob, in which Alice and Bob exchange their respective quantum information by means of local operations and classical communication assisted by shared entanglement. Here, we assume that Alice and Bob may have quantum side information, not transferred, and classical communication is free. In this work, we derive general upper and lower bounds for the least amount of entanglement which is necessary to perfectly perform this task, called the state exchange with quantum side information. Moreover, we show that the optimal entanglement cost can be negative when Alice and Bob make use of their quantum side information. We finally provide conditions on the initial state for the state exchange with quantum side information which give the exact optimal entanglement cost.

arXiv comment9 pages, 2 figures

References in corpus (21)

• Mixed State Entanglement and Quantum Error Correction
• Quantifying Coherence
• Quantifying Entanglement
• Measuring Quantum Coherence with Entanglement
• Distillation of secret key and entanglement from quantum states
• Quantum information can be negative
• Classical simulation of noninteracting-fermion quantum circuits
• A Sharp Fannes-type Inequality for the von Neumann Entropy
• Tight uniform continuity bounds for quantum entropies: conditional entropy, relative entropy distance and energy constraints
• Quantum state merging and negative information
• A Resource Framework for Quantum Shannon Theory
• Matchgates and classical simulation of quantum circuits
• The exact cost of redistributing multipartite quantum states
• Entanglement and coherence in quantum state merging
• A family of quantum protocols
• Optimal quantum source coding with quantum information at the encoder and decoder
• Modular architectures for quantum networks
• Multipartite entanglement outperforming bipartite entanglement under limited quantum system sizes
• A Coding Theorem for Bipartite Unitaries in Distributed Quantum Computation
• Quantum state redistribution with local coherence
• State transfer with quantum side information

Cited by in corpus (6)

• Complexity of causal order structure in distributed quantum information processing and its trade-off with entanglement
• Quantum one-time tables for unconditionally secure qubit-commitment
• One-shot quantum state exchange
• Quantum state rotation: Circularly transferring quantum states of multiple users
• Improved bounds on quantum uncommon information
• Counterfactual Full-Duplex Communication