Efficient entanglement concentration for three-photon W states with parity check measurement
Yu-Bo Sheng, Lan Zhou, and Sheng-Mei Zhao

TL;DR
This paper introduces an efficient entanglement concentration protocol for three-photon W states using parity check measurements, enhancing success probability and reusability in quantum information tasks.
Contribution
It proposes an optimal entanglement concentration method for arbitrary less-entangled W states utilizing parity check measurements, with iterative steps to maximize success probability.
Findings
Achieves higher success probability in entanglement concentration
Allows re-concentration of lesser-entangled states
Potentially optimal protocol for three-photon W states
Abstract
We present an optimal entanglement concentration ECP for an arbitrary less-entangled W state. By two of the parties say Alice and Charlie performing one parity check measurements, they can obtain the maximally entangled W state with a certain probability. Otherwise, they can obtain another lesser-entangled W state with another probability, which can be used to reconcentrated into a maximally entangled W state. By iterating this ECP several times, it has the maximal success probability. This ECP maybe an optimal one and is useful in current quantum information processing.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Quantum Mechanics and Applications
