A tight lower bound on the classical communication cost of entanglement dilution

Details A tight lower bound on the classical communication cost of entanglement dilution A tight lower bound on the classical communication cost of entanglement dilution

2002-04-17

arxiv.org/abs/quant-ph/0204096v2

IEEE Trans. Inf. Theory, Vol. 50, No. 2, (2004) p.319-327

Physics

Quantum Physics

10 pages, 2 figures, RevTeX. v2 improved presentation, added remarks

Scientific paper

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)).

Affiliated with

Also associated with

No associations

Rating

A tight lower bound on the classical communication cost of entanglement dilution does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A tight lower bound on the classical communication cost of entanglement dilution, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A tight lower bound on the classical communication cost of entanglement dilution will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-304903