Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2304.04890 · Micromachines

Optimal High-Dimensional Entanglement Concentration for Pure Bipartite Systems

Lukas Palma Torres, M. A. Solís-Prosser, O. Jiménez, Esteban S. Gómez, A. Delgado

Published Jun 7, 2023• 1 citation
arXivHTMLPDF

Abstract

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.

DOI
10.3390/mi14061207

Related papers

Qubit- and entanglement-assisted optimal entanglement concentration

Somshubhro Bandyopadhyay

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.

arXiv:quant-ph/9911013•Physical Review A•Aug 17, 2000•16 citations

Enhancement of entanglement concentration using catalysts

Siddhartha Santra, Vladimir S. Malinovsky

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.

The Journal of Chemical Physics•Apr 2, 2021•3 citations

Error exponents for entanglement concentration

Masahito Hayashi, Masato Koashi, Keiji Matsumoto +2 more

Consider entanglement concentration schemes that convert n identical copies of a pure state into a maximally entangled state of a desired size with success probability being close to one in the asymptotic limit. We give the distillable entanglement, the number of Bell pairs distilled per copy, as a function of an error exponent , which represents the rate of decrease in failure probability as n tends to infinity. The formula fills the gap between the least upper bound of distillable entanglement in probabilistic concentration, which is the well-known entropy of entanglement, and the maximum attained in deterministic concentration. The method of types in information theory enables the detailed analysis of the distillable entanglement in terms of the error rate. In addition to the probabilistic argument, we consider another type of entanglement concentration scheme, where the initial state is deterministically transformed into a (possibly mixed) final state whose fidelity to a maximally entangled state of a desired size converges to one in the asymptotic limit. We show that the same formula as in the probabilistic argument is valid for the argument on fidelity by replacing the success probability with the fidelity. Furthermore, we also discuss entanglement yield when optimal success probability or optimal fidelity converges to zero in the asymptotic limit (strong converse), and give the explicit formulae for those cases.

arXiv:quant-ph/0206097•Journal of Physics A Mathematical and General•Dec 17, 2002•45 citations

Optimal nonlocal multipartite entanglement concentration based on projection measurements

Fu‐Guo Deng

We propose an optimal nonlocal entanglement concentration protocol (ECP) for multiphoton systems in a partially entangled pure state, resorting to the projection measurement on an additional photon. One party in quantum communication first performs a parity-check measurement on her photon in an $N$-photon system and an additional photon, and then she projects the additional photon into an orthogonal Hilbert space for dividing the original $N$-photon systems into two groups. In the first group, the $N$ parties will obtain a subset of $N$-photon systems in a maximally entangled state. In the second group, they will obtain some less-entangled $N$-photon systems which are the resource for the entanglement concentration in the next round. By iterating the entanglement concentration process several times, the present ECP has the maximal success probability, which is just equivalent to the entanglement of the partially entangled state. That is, this ECP is an optimal one.

arXiv:1112.1355•Physical Review A•Feb 8, 2012•194 citations

Efficient quantum repeater with respect to both entanglement-concentration rate and complexity of local operations and classical communication

Zhaofeng Su, Ji Guan, Lvzhou Li

Quantum entanglement is an indispensable resource for many significant quantum information processing tasks. However, in practice, it is difficult to distribute quantum entanglement over a long distance, due to the absorption and noise in quantum channels. A solution to this challenge is a quantum repeater, which can extend the distance of entanglement distribution. In this scheme, the time consumption of classical communication and local operations takes an important place with respect to time efficiency. Motivated by this observation, we consider a basic quantum repeater scheme that focuses on not only the optimal rate of entanglement concentration but also the complexity of local operations and classical communication. First, we consider the case where two different two-qubit pure states are initially distributed in the scenario. We construct a protocol with the optimal entanglement-concentration rate and less consumption of local operations and classical communication. We also find a criterion for the projective measurements to achieve the optimal probability of creating a maximally entangled state between the two ends. Second, we consider the case in which two general pure states are prepared and general measurements are allowed. We get an upper bound on the probability for a successful measurement operation to produce a maximally entangled state without any further local operations.

arXiv:1710.02805•Physical Review A•Jan 22, 2018•18 citations

Entanglement transformation with no classical communication

Bing He, János A. Bergou

We present an optimal scheme to realize the transformations between single copies of two bipartite entangled states without classical communication between the sharing parties. The scheme achieves the upper bound for the success probabilities [Phys. Rev. A 63, 022301 (2001); Phys. Rev. Lett. 83, 1455 (1999)] of generating maximally entangled states if applied to entanglement concentration. Such a strategy also dispenses with the interaction with an ancilla system in the implementation. We also show that classical communications are indispensable in realizing the deterministic transformations of a single bipartite entangled state. With a finite number of identical pairs of two entangled bosons, on the other hand, we can realize the deterministic transformation to any target entangled state of equal or less Schmidt rank through an extension of the scheme.

arXiv:0708.4184•Physical Review A•Dec 16, 2008•16 citations
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.
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.
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.
Consider entanglement concentration schemes that convert n identical copies of a pure state into a maximally entangled state of a desired size with success probability being close to one in the asymptotic limit. We give the distillable entanglement, the number of Bell pairs distilled per copy, as a function of an error exponent , which represents the rate of decrease in failure probability as n tends to infinity. The formula fills the gap between the least upper bound of distillable entanglement in probabilistic concentration, which is the well-known entropy of entanglement, and the maximum attained in deterministic concentration. The method of types in information theory enables the detailed analysis of the distillable entanglement in terms of the error rate. In addition to the probabilistic argument, we consider another type of entanglement concentration scheme, where the initial state is deterministically transformed into a (possibly mixed) final state whose fidelity to a maximally entangled state of a desired size converges to one in the asymptotic limit. We show that the same formula as in the probabilistic argument is valid for the argument on fidelity by replacing the success probability with the fidelity. Furthermore, we also discuss entanglement yield when optimal success probability or optimal fidelity converges to zero in the asymptotic limit (strong converse), and give the explicit formulae for those cases.
We propose an optimal nonlocal entanglement concentration protocol (ECP) for multiphoton systems in a partially entangled pure state, resorting to the projection measurement on an additional photon. One party in quantum communication first performs a parity-check measurement on her photon in an NNN-photon system and an additional photon, and then she projects the additional photon into an orthogonal Hilbert space for dividing the original NNN-photon systems into two groups. In the first group, the NNN parties will obtain a subset of NNN-photon systems in a maximally entangled state. In the second group, they will obtain some less-entangled NNN-photon systems which are the resource for the entanglement concentration in the next round. By iterating the entanglement concentration process several times, the present ECP has the maximal success probability, which is just equivalent to the entanglement of the partially entangled state. That is, this ECP is an optimal one.
Quantum entanglement is an indispensable resource for many significant quantum information processing tasks. However, in practice, it is difficult to distribute quantum entanglement over a long distance, due to the absorption and noise in quantum channels. A solution to this challenge is a quantum repeater, which can extend the distance of entanglement distribution. In this scheme, the time consumption of classical communication and local operations takes an important place with respect to time efficiency. Motivated by this observation, we consider a basic quantum repeater scheme that focuses on not only the optimal rate of entanglement concentration but also the complexity of local operations and classical communication. First, we consider the case where two different two-qubit pure states are initially distributed in the scenario. We construct a protocol with the optimal entanglement-concentration rate and less consumption of local operations and classical communication. We also find a criterion for the projective measurements to achieve the optimal probability of creating a maximally entangled state between the two ends. Second, we consider the case in which two general pure states are prepared and general measurements are allowed. We get an upper bound on the probability for a successful measurement operation to produce a maximally entangled state without any further local operations.
We present an optimal scheme to realize the transformations between single copies of two bipartite entangled states without classical communication between the sharing parties. The scheme achieves the upper bound for the success probabilities [Phys. Rev. A 63, 022301 (2001); Phys. Rev. Lett. 83, 1455 (1999)] of generating maximally entangled states if applied to entanglement concentration. Such a strategy also dispenses with the interaction with an ancilla system in the implementation. We also show that classical communications are indispensable in realizing the deterministic transformations of a single bipartite entangled state. With a finite number of identical pairs of two entangled bosons, on the other hand, we can realize the deterministic transformation to any target entangled state of equal or less Schmidt rank through an extension of the scheme.