We present an optimal method for concentrating entanglement from pure entangled states. However a prior knowledge of the Schmidt coefficients is required. Concentrating entanglement from N-partite cat like states is also discussed.
We present two methods for optimal entanglement concentration from pure entangled states by local actions only. However, a prior knowledge of the Schmidt coefficients is required. The first method is optimally efficient only when a finite ensemble of pure entangled states are available, whereas the second method realizes the single pair optimal concentration probability. We also propose an entanglement-assisted method that is again optimally efficient even for a single pair. We also discuss concentrating entanglement from N-partite catlike states.
Considering pure quantum states, entanglement concentration is the procedure where, from N copies of a partially entangled state, a single state with higher entanglement can be obtained. Obtaining a maximally entangled state is possible for N=1. However, the associated success probability can be extremely low when increasing the system’s dimensionality. In this work, we study two methods to achieve a probabilistic entanglement concentration for bipartite quantum systems with a large dimensionality for N=1, regarding a reasonably good probability of success at the expense of having a non-maximal entanglement. Firstly, we define an efficiency function Q considering a tradeoff between the amount of entanglement (quantified by the I-Concurrence) of the final state after the concentration procedure and its success probability, which leads to solving a quadratic optimization problem. We found an analytical solution, ensuring that an optimal scheme for entanglement concentration can always be found in terms of Q. Finally, a second method was explored, which is based on fixing the success probability and searching for the maximum amount of entanglement attainable. Both ways resemble the Procrustean method applied to a subset of the most significant Schmidt coefficients but obtaining non-maximally entangled states.
Entanglement concentration is essential for quantum technologies, yet rigorous bounds on the success probability for universal protocols (those requiring no prior knowledge about the input state) have remained underexplored. We establish such fundamental limits for conclusive protocols distilling a perfect Bell state from pure two-qubit states by deriving the optimal success probability starting with two copies of a state with known Schmidt basis and four copies of a state with unknown Schmidt basis, using concatenated two-qubit operations. We prove that a known protocol achieves these bounds, confirming its optimality. Crucially, universality imposes an inherent efficiency trade-off, yielding an average success probability of just 2/105 over Haar measure.