A communication-efficient nonlocal measurement with application to communication complexity and bipartite gate capacities

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

6 pages

Scientific paper

Two dual questions in quantum information theory are to determine the communication cost of simulating a bipartite unitary gate, and to determine their communication capacities. We present a bipartite unitary gate with two surprising properties: 1) simulating it with the assistance of unlimited EPR pairs requires far more communication than with a better choice of entangled state, and 2) its communication capacity is far lower than its capacity to create entanglement. This suggests that 1) unlimited EPR pairs are not the most general model of entanglement assistance for two-party communication tasks, and 2) the entangling and communicating abilities of a unitary interaction can vary nearly independently. The technical contribution behind these results is a communication-efficient protocol for measuring whether an unknown shared state lies in a specified rank-one subspace or its orthogonal complement.

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

A communication-efficient nonlocal measurement with application to communication complexity and bipartite gate capacities 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 communication-efficient nonlocal measurement with application to communication complexity and bipartite gate capacities, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A communication-efficient nonlocal measurement with application to communication complexity and bipartite gate capacities will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-586824

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