Optimal entanglement transformations among N-qubit W-class states

Wei Cui, Eric Chitambar, and Hoi-Kwong Lo
Phys. Rev. A 82, 062314 – Published 14 December 2010; Erratum Phys. Rev. A 89, 059904 (2014)

Abstract

We investigate the physically allowed probabilities for transforming one N-partite W-class state to another by means of local operations assisted with classical communication. Recently,   S. Kintaş and S. Turgut [J. Math. Phys. 51, 092202 (2010)] obtained an upper bound for the maximum probability of transforming two such states. Here, we provide a simple sufficient and necessary condition for when this upper bound can be satisfied and, thus, when optimality of state transformation can be achieved. Our discussion involves obtaining lower bounds for the transformation of arbitrary W-class states and showing precisely when this bound saturates the bound of Kintaş and Turgut. Finally, we consider the question of transforming symmetric W-class states and find that, in general, the optimal one-shot procedure for converting two symmetric states requires a nonsymmetric filter by all the parties.

  • Figure
  • Figure
  • Received 29 September 2010

DOI:https://doi.org/10.1103/PhysRevA.82.062314

© 2010 The American Physical Society

Erratum

Authors & Affiliations

Wei Cui*, Eric Chitambar, and Hoi-Kwong Lo

  • Center for Quantum Information and Quantum Control (CQIQC), Department of Physics and Department of Electrical & Computer Engineering, University of Toronto, Toronto, Ontario M5S 3G4, Canada

  • *cuiwei@physics.utoronto.ca
  • e.chitambar@utoronto.ca
  • hklo@comm.utoronto.ca

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 82, Iss. 6 — December 2010

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×