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

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Revised version: 8 pages, 3 figures, two-column. Have added bounds for general pure states, corrected typos and updated format

Scientific paper

10.1103/PhysRevA.72.032336

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 the protocol of Lo-Popescu and then consider a two-stage dilution from singlets with this protocol followed by some unknown protocol for conversion between partially entangled states. Applying the lower bounds on classical communication and inefficiency of Harrow-Lo and Hayden-Winter to this two-stage protocol, we derive bounds for the unknown protocol. In addition we derive analogous (but looser) bounds for general pure states.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Inefficiency and classical communication bounds for conversion between partially entangled pure bipartite states 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 Inefficiency and classical communication bounds for conversion between partially entangled pure bipartite states, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Inefficiency and classical communication bounds for conversion between partially entangled pure bipartite states will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-14321

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.