2010/09/13 by Wei Cui, Eric Chitambar, Hoi-Kwong Lo · 1 citation
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph
paper · pdf · doi:10.1103/physreva.82.062314
published as Phys. Rev. A 82, 062314 (2010)
arxiv created 2010/09/13 · openalex publication_date 2010/12/14 · arxiv updated 2011/08/16 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/30
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\ifmmode \mbox\cs\else \cs\fi 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\ifmmode \mbox\cs\else \cs\fi 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.