A tight lower bound on the classical communication cost of entanglement dilution
| dc.creator | Harrow, Aram | |
| dc.creator | Lo, Hoi-Kwong | |
| dc.date | 2002-04-17 | |
| dc.date | 2002-06-28 | |
| dc.date.accessioned | 2026-07-07T06:03:59Z | |
| dc.date.available | 2026-07-07T06:03:59Z | |
| dc.description | 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)). | |
| dc.description | 10 pages, 2 figures, RevTeX. v2 improved presentation, added remarks | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0204096 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0204096 | |
| dc.identifier | IEEE Trans. Inf. Theory, Vol. 50, No. 2, (2004) p.319-327 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/90147 | |
| dc.subject | Quantum Physics | |
| dc.title | A tight lower bound on the classical communication cost of entanglement dilution | |
| dc.type | text |