Asymptotic Compressibility of Entanglement and Classical Communication in Distributed Quantum Computation
arXiv:1310.3991
Abstract
We consider implementations of a bipartite unitary on many pairs of unknown input states by local operation and classical communication assisted by shared entanglement. We investigate to what extent the entanglement cost and the classical communication cost can be compressed by allowing nonzero but vanishing error in the asymptotic limit of infinite pairs. We show that a lower bound on the minimal entanglement cost, the forward classical communication cost, and the backward classical communication cost per pair is given by the Schmidt strength of the unitary. We also prove that an upper bound on these three kinds of the cost is given by the amount of randomness that is required to partially decouple a tripartite quantum state associated with the unitary. In the proof, we construct a protocol in which quantum state merging is used. For generalized Clifford operators, we show that the lower bound and the upper bound coincide. We then apply our result to the problem of distributed compression of tripartite quantum states, and derive a lower and an upper bound on the optimal quantum communication rate required therein.
arXiv commentSection II and VIII added
References in corpus (30)
- Distributed Quantum Computation over Noisy Channels
- On the quantum, classical and total amount of correlations in a quantum state
- Optimal local implementation of non-local quantum gates
- Quantum Reverse Shannon Theorem
- A Resource Framework for Quantum Shannon Theory
- Quantum dynamics as a physical resource
- The exact cost of redistributing multipartite quantum states
- One-shot decoupling
- A family of quantum protocols
- Optimal quantum source coding with quantum information at the encoder and decoder
- Coherent Communication of Classical Messages
- The decoupling approach to quantum information theory
- Optimal Entanglement Generation from Quantum Operations
- Efficient implementation of bipartite nonlocal unitary gates using prior entanglement and classical communication
- A triangle of dualities: reversibly decomposable quantum channels, source-channel duality, and time reversal
- The entangling and disentangling power of unitary transformations are unequal
- On the efficiency of nonlocal gates generation
- Quantum state redistribution based on a generalized decoupling
- Entanglement cost of implementing controlled-unitary operations
- Local implementation of nonlocal operations of block forms
- State redistribution as merging: introducing the coherent relay
- Entanglement requirements for implementing bipartite unitary operations
- Probabilistically implementing nonlocal operation using non-maximally entangled state
- On the distributed compression of quantum information
- Relation between classical communication capacity and entanglement capability for two-qubit unitary operations
- Implementation of multipartite unitary operations with limited resources
- Optimizing local protocols implementing nonlocal quantum gates
- A probabilistic and information theoretic interpretation of quantum evolutions
- All maximally entangling unitary gates
- Lower bounds for communication capacities of two-qudit unitary operations