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. Getting a maximally entangled state is possible for
N=1. However, the associated success probability can be extremely low while 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.
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.
Auxiliary pure quantum entangled states shared between two parties can act as catalysts in bipartite entanglement transformations. The participation of a catalyst state in the transformation can enhance its success probability. We consider transformations involving entanglement concentration of a finite number of copies of arbitrary two-qubit pure states into a single copy of a maximally entangled two-qubit pure state using bipartite local quantum operations and classical communication aided by a catalyst state. We show the enhancement of success probabilities of the catalyst-assisted procedure compared to the case where no catalysts are used. The optimal two-qubit catalyst and the maximum probability of the transformation using such catalysts can be obtained analytically. The enhancement of concentration success probability using catalysts of higher dimensions is demonstrated numerically. Finally, catalyst aided strategies for obtaining multiple maximally entangled two-qubit states are discussed.
We present a general method to construct a universal set of quantum gates using probabilistic teleportation as a basic primitive. The technique generalizes the teleportation method of gate construction to partially entangled quantum channels. Without recourse to local filtering or entanglement concentration, using local rotation and CNOT operations followed by measurements in the computational basis, one can construct many encoded quantum operations with unit fidelity but less than unit probability. The technique can also be applied to the construction of remote quantum gates that cannot be directly performed.