Upper bounds on entangling rates of bipartite Hamiltonians

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

14 pages, 4 figures

Scientific paper

10.1103/PhysRevA.76.052319

We discuss upper bounds on the rate at which unitary evolution governed by a non-local Hamiltonian can generate entanglement in a bipartite system. Given a bipartite Hamiltonian H coupling two finite dimensional particles A and B, the entangling rate is shown to be upper bounded by c*log(d)*norm(H), where d is the smallest dimension of the interacting particles, norm(H) is the operator norm of H, and c is a constant close to 1. Under certain restrictions on the initial state we prove analogous upper bound for the ancilla-assisted entangling rate with a constant c that does not depend upon dimensions of local ancillas. The restriction is that the initial state has at most two distinct Schmidt coefficients (each coefficient may have arbitrarily large multiplicity). Our proof is based on analysis of a mixing rate -- a functional measuring how fast entropy can be produced if one mixes a time-independent state with a state evolving unitarily.

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

Upper bounds on entangling rates of bipartite Hamiltonians 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 Upper bounds on entangling rates of bipartite Hamiltonians, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Upper bounds on entangling rates of bipartite Hamiltonians will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-386923

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