Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0411200 · Physical Review A

Inefficiency and classical communication bounds for conversion between partially entangled pure bipartite states

Ben Fortescue, Hoi‐Kwong Lo

Published Sep 28, 2005• 4 citations
arXivHTMLPDF

Abstract

We derive lower limits on the inefficiency and classical communication costs of dilution between two-term bipartite pure states that are partially entangled. We first calculate explicit relations between the allowable error and classical communication costs of entanglement dilution using a previously described protocol, then consider a two-stage dilution from singlets with this protocol followed by some unknown protocol for conversion between partially entangled states. Applying overall lower bounds on classical communication and inefficiency to this two-stage protocol, we derive bounds for the unknown protocol. In addition we derive analogous (but looser) bounds for general pure states.

DOI
10.1103/physreva.72.032336

Related papers

Inefficiency and classical communication bounds for conversion between partially entangled pure bipartite quantum states

Ben Fortescue, Hoi‐Kwong Lo

We present explicit bounds on the classical communication cost and inefficiency of entanglement dilution via the Lo-Popescu protocol, for the case of two-term (single-qubit) entangled states. By considering a two-stage dilution, we consequently use prior results to obtain meaningful bounds on the classical communication cost and inefficiency of dilution between two-term partially entangled states.

IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2005•0 citations

A Tight Lower Bound on the Classical Communication Cost of Entanglement Dilution

Aram W. Harrow, Hoi‐Kwong Lo

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 /spl radic/N. 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 /spl Omega/(/spl radic/N) 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 /spl Omega/(/spl radic/N). Moreover, we introduce two new tools - /spl 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.

arXiv:quant-ph/0204096•IEEE Transactions on Information Theory•Feb 1, 2004•51 citations

Reexamination of quantum state transformations with zero communication

Ian George, Eric Chitambar

It is known that general convertibility of bipartite entangled states is not possible to arbitrary error without some classical communication. While some tradeoffs between communication cost and conversion error have been proven, these bounds can be very loose. In particular, there are many cases in which tolerable error might be achievable using zero-communication protocols. In this work we address these cases by deriving the optimal fidelity of pure quantum state conversions under local unitaries as well as local operations and shared randomness. We also use these results to explore catalytic conversions between pure states using zero communication.

arXiv:2301.04735•Physical Review A•Jun 12, 2024•7 citations

Asymptotic convertibility of entanglement: An information-spectrum approach to entanglement concentration and dilution

Yong Jiao, Eyuri Wakakuwa, Tomohiro Ogawa

We consider asymptotic convertibility of an arbitrary sequence of bipartite pure states into another by local operations and classical communication (LOCC). We adopt an information-spectrum approach to address cases where each element of the sequences is not necessarily a tensor power of a bipartite pure state. We derive necessary and sufficient conditions for the LOCC convertibility of one sequence to another in terms of spectral entropy rates of entanglement of the sequences. Based on these results, we also provide simple proofs for previously known results on the optimal rates of entanglement concentration and dilution of general sequences of bipartite pure states.

arXiv:1701.09050•Journal of Mathematical Physics•Feb 1, 2018•4 citations

Communication cost of entanglement transformations

Patrick M. Hayden, Andreas Winter

We study the amount of communication needed for two parties to transform some given joint pure state into another one, either exactly or with some fidelity. Specifically, we present a method to lower bound this communication cost even when the amount of entanglement does not increase. Moreover, the bound applies even if the initial state is supplemented with unlimited entanglement in the form of EPR (Einstein-Podolsky-Rosen) pairs and the communication is allowed to be quantum mechanical. We then apply the method to the determination of the communication cost of asymptotic entanglement concentration and dilution. While concentration is known to require no communication whatsoever, the best known protocol for dilution, discovered by H.-K. Lo and S. Popescu [Phys. Rev. Lett. 83, 1459 (1999)], requires exchange of a number of bits that is of the order of the square root of the number of EPR pairs. Here we prove a matching lower bound of the same asymptotic order, demonstrating the optimality of the Lo-Popescu protocol up to a constant factor and establishing the existence of a fundamental asymmetry between the concentration and dilution tasks. We also discuss states for which the minimal communication cost is proportional to their entanglement, such as the states recently introduced in the context of ``embezzling entanglement'' (W. van Dam and P. Hayden, e-print quant-ph/0201041).

arXiv:quant-ph/0204092•Physical Review A•Jan 31, 2003•73 citations

Faithful teleportation with partially entangled states

Gilad Gour

We write explicitly a general protocol for faithful teleportation of a $d$-state particle (qudit) via a partially entangled pair of (pure) $n$-state particles. The classical communication cost (CCC) of the protocol is ${\mathrm{log}}_{2}(nd)$ bits, and it is implemented by a projective measurement performed by Alice, and a unitary operator performed by Bob (after receiving from Alice the measurement result). We prove the optimality of our protocol by a comparison with the concentrate and teleport strategy. We also show that if $d>n∕2$, or if there is no residual entanglement left after the faithful teleportation, the CCC of any protocol is at least ${\mathrm{log}}_{2}(nd)$ bits. Furthermore, we find a lower bound on the CCC in the process transforming one bipartite state to another by means of local operation and classical communication.

arXiv:quant-ph/0402133•Physical Review A•Oct 4, 2004•33 citations
We derive lower limits on the inefficiency and classical communication costs of dilution between two-term bipartite pure states that are partially entangled. We first calculate explicit relations between the allowable error and classical communication costs of entanglement dilution using a previously described protocol, then consider a two-stage dilution from singlets with this protocol followed by some unknown protocol for conversion between partially entangled states. Applying overall lower bounds on classical communication and inefficiency to this two-stage protocol, we derive bounds for the unknown protocol. In addition we derive analogous (but looser) bounds for general pure states.
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 /spl radic/N. 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 /spl Omega/(/spl radic/N) 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 /spl Omega/(/spl radic/N). Moreover, we introduce two new tools - /spl 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.
It is known that general convertibility of bipartite entangled states is not possible to arbitrary error without some classical communication. While some tradeoffs between communication cost and conversion error have been proven, these bounds can be very loose. In particular, there are many cases in which tolerable error might be achievable using zero-communication protocols. In this work we address these cases by deriving the optimal fidelity of pure quantum state conversions under local unitaries as well as local operations and shared randomness. We also use these results to explore catalytic conversions between pure states using zero communication.
We consider asymptotic convertibility of an arbitrary sequence of bipartite pure states into another by local operations and classical communication (LOCC). We adopt an information-spectrum approach to address cases where each element of the sequences is not necessarily a tensor power of a bipartite pure state. We derive necessary and sufficient conditions for the LOCC convertibility of one sequence to another in terms of spectral entropy rates of entanglement of the sequences. Based on these results, we also provide simple proofs for previously known results on the optimal rates of entanglement concentration and dilution of general sequences of bipartite pure states.
We study the amount of communication needed for two parties to transform some given joint pure state into another one, either exactly or with some fidelity. Specifically, we present a method to lower bound this communication cost even when the amount of entanglement does not increase. Moreover, the bound applies even if the initial state is supplemented with unlimited entanglement in the form of EPR (Einstein-Podolsky-Rosen) pairs and the communication is allowed to be quantum mechanical. We then apply the method to the determination of the communication cost of asymptotic entanglement concentration and dilution. While concentration is known to require no communication whatsoever, the best known protocol for dilution, discovered by H.-K. Lo and S. Popescu [Phys. Rev. Lett. 83, 1459 (1999)], requires exchange of a number of bits that is of the order of the square root of the number of EPR pairs. Here we prove a matching lower bound of the same asymptotic order, demonstrating the optimality of the Lo-Popescu protocol up to a constant factor and establishing the existence of a fundamental asymmetry between the concentration and dilution tasks. We also discuss states for which the minimal communication cost is proportional to their entanglement, such as the states recently introduced in the context of ``embezzling entanglement'' (W. van Dam and P. Hayden, e-print quant-ph/0201041).
We write explicitly a general protocol for faithful teleportation of a ddd-state particle (qudit) via a partially entangled pair of (pure) nnn-state particles. The classical communication cost (CCC) of the protocol is log2(nd){\mathrm{log}}_{2}(nd)log2​(nd) bits, and it is implemented by a projective measurement performed by Alice, and a unitary operator performed by Bob (after receiving from Alice the measurement result). We prove the optimality of our protocol by a comparison with the concentrate and teleport strategy. We also show that if d>n∕2d>n∕2d>n∕2, or if there is no residual entanglement left after the faithful teleportation, the CCC of any protocol is at least log2(nd){\mathrm{log}}_{2}(nd)log2​(nd) bits. Furthermore, we find a lower bound on the CCC in the process transforming one bipartite state to another by means of local operation and classical communication.