Open-system dynamics of graph-state entanglement

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

4 pages, 2 figs - accepted by PRL

Scientific paper

10.1103/PhysRevLett.103.030502

We consider graph states of arbitrary number of particles undergoing generic decoherence. We present methods to obtain lower and upper bounds for the system's entanglement in terms of that of considerably smaller subsystems. For an important class of noisy channels, namely the Pauli maps, these bounds coincide and thus provide the exact analytical expression for the entanglement evolution. All the results apply also to (mixed) graph-diagonal states, and hold true for any convex entanglement monotone. Since any state can be locally depolarized to some graph-diagonal state, our method provides a lower bound for the entanglement decay of any arbitrary state. Finally, this formalism also allows for the direct identification of the robustness under size scaling of graph states in the presence of decoherence, merely by inspection of their connectivities.

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

Open-system dynamics of graph-state entanglement 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 Open-system dynamics of graph-state entanglement, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Open-system dynamics of graph-state entanglement will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-314813

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