A tight lower bound on the classical communication cost of entanglement dilution
摘要
Entanglement concentration requires no classical communication, but the best prior art result for diluting to N copies of a partially entangled state requires an amount of communication on the order of sqrt(N) bits. Our main result is to prove this prior art result optimal up to a constant factor; any procedure for creating N partially entangled states from singlets requires Omega(sqrt(N)) bits of classical communication. Previously not even a constant bound was known for approximate entanglement transforms. We also prove a lower bound on the inefficiency of the process: to dilute singlets to N copies of a partially entangled state, the entropy of entanglement must decrease by Omega(sqrt(N)).
引用
@article{arxiv.quant-ph/0204096,
title = {A tight lower bound on the classical communication cost of entanglement dilution},
author = {Aram Harrow and Hoi-Kwong Lo},
journal= {arXiv preprint arXiv:quant-ph/0204096},
year = {2007}
}
备注
10 pages, 2 figures, RevTeX. v2 improved presentation, added remarks