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

Suppose two distant observers, Alice and Bob, share some form of entanglement-quantum correlations-in some bipartite pure quantum states. They may apply local operations and classical communication to convert one form of entanglement to another. Since entanglement is regarded as a resource in quantum information processing, it is an important question to ask how much classical communication, which is also a resource, is needed in the inter-conversion process of entanglement. In this paper, we address this important question in the many-copy case. The inter-conversion process of entanglement is usually divided into two types: concentrating the entanglement from many partially entangled states into a smaller number of maximally entangled states (i.e., singlets) and the reverse process of diluting singlets into partially entangled states. It is known that 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 rootN. Our main result is to prove that this prior art result is optimal up to a constant factor; any procedure for approximately creating N partially entangled states from singlets requires Omega (rootN) bits of classical communication. Previously not even a constant bound was known for approximate entanglement transformations. 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(rootN). Moreover, we introduce two new tools-delta-significant subspaces and the standard form protocol reduction in entanglement manipulations. We hope that these two new tools will be useful in other work in quantum information theory.