Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
arXiv:quant-ph/0207090
Abstract
Quantum entanglement distillation protocols are LOCC protocols between Alice and Bob that convert imperfect EPR pairs, or, in general, partially entangled bipartite states into perfect or near-perfect EPR pairs. The classical communication complexity of these protocols is the minimal amount of classical communication needed for the conversion. In this paper, we focus on the communication complexity of protocols that operate with incomplete information, i.e., where the inputs are mixed states and/or prepared adversarially. We study 3 models of imperfect EPR pairs. In the measure-r model, r out of n EPR pairs are measured by an adversary; in the depolarization model, Bob's share of qubits underwent a depolarization channel; in the fidelity model, the only information Alice and Bob possess is the fidelity of the shared state. For the measure-r model and the depolarization model, we prove tight and almost-tight bounds on the outcome of LOCC protocols that don't use communication. For the fidelity model, we prove a lower bound on the communication complexity that matches the upper bound given by Ambainis, Smith, and Yang [ASY02].
20 pages, no figure
References in corpus (19)
- Mixed State Entanglement and Quantum Error Correction
- Concentrating Partial Entanglement by Local Operations
- Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
- Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
- A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
- Conditions for a class of entanglement transformations
- A Theory of Fault-Tolerant Quantum Computation
- Classical Communication Cost in Distributed Quantum Information Processing - A generalization of Quantum Communication Complexity
- Entanglement of pure states for a single copy
- An improved bound on distillable entanglement
- A rigorous treatment of distillable entanglement
- Approximate quantum error correction can lead to better codes
- Minimal conditions for local pure-state entanglement manipulation
- Quantum communication complexity of symmetric predicates
- Quantum Cryptography
- The classical communication cost of entanglement manipulation: Is entanglement an inter-convertible resource?
- On the communication cost of entanglement transformations
- A Method of Areas for Manipulating the Entanglement Properties of One Copy of a Two-Particle Pure State
- Error Correction in Quantum Communication