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:quant-ph/0206187 · IEEE Transactions on Information Theory

General formulas for fixed-length quantum entanglement concentration

Masahito Hayashi

Published Apr 28, 2006• 36 citations
arXivHTMLPDF

Abstract

In this paper, we derive general formulas for the amount of entanglement that can be concentrated from general sequences of partially entangled, bipartite pure states. The formulas are obtained by using an information-spectrum approach. The formulas obtained express the optimal rate under constant error constraints or exponential error constraints in the asymptotic framework. Since the formulas treat general sequences, they can be applied to i.i.d. sequences as well as sequences with correlations

DOI
10.1109/tit.2006.872976

Related papers

General asymptotic formulas for fixed-length quantum entanglement concentration

Masahito Hayashi

General formulas of entanglement concentration are derived by using an information-spectrum approach not only for i.i.d. sequences, but also for the general sequences of partially entangled pure states. From these formulas, not only can the achievable rates be calculated, but also the error exponents, resulting in a general relation between the performance of the entanglement concentration and the eigenvalues of the partially traced state.

IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2003•6 citations

An information-spectrum approach to fixed-length quantum entanglement concentration with the general source

Masahito Hayashi

Using an information-spectrum approach, we derive general formulas of entanglement concentration not only concerning the i.i.d. sequence, but also concerning the general sequence of partially entanglement pure states. From these formulas, we can calculate not only the achievable rate but also error exponents. These discussions discover a general relation between the performance of entanglement concentration and the eigen values of the paritial traced state.

•Jun 27, 2002•0 citations

Asymptotic convertibility of entanglement: An information-spectrum approach to entanglement concentration and dilution

Yong Jiao, Eyuri Wakakuwa, Tomohiro Ogawa

We consider asymptotic convertibility of an arbitrary sequence of bipartite pure states into another by local operations and classical communication (LOCC). We adopt an information-spectrum approach to address cases where each element of the sequences is not necessarily a tensor power of a bipartite pure state. We derive necessary and sufficient conditions for the LOCC convertibility of one sequence to another in terms of spectral entropy rates of entanglement of the sequences. Based on these results, we also provide simple proofs for previously known results on the optimal rates of entanglement concentration and dilution of general sequences of bipartite pure states.

arXiv:1701.09050•Journal of Mathematical Physics•Feb 1, 2018•4 citations

Asymptotic Entanglement Manipulation of Bipartite Pure States

Garry Bowen, Nilanjana Datta

Entanglement of pure states of bipartite quantum systems has been shown to have a unique measure in terms of the von Neumann entropy of the reduced states of either of its subsystems. The measure is established under entanglement manipulation of an asymptotically large number of copies of the bipartite pure state. In this paper, two different asymptotic measures of entanglement for arbitrary sequences of bipartite pure states are established. These are shown to coincideonly whenthe sequence isinformation stable, in terms of the quantum spectral information rates of its corresponding sequence of subsystem states. Additional bounds on the optimal rates of entanglement manipulation protocols in quantum information theory are also presented. These include bounds given by generalizations of the coherent information bounds, Rains' bound, and the relative entropy of entanglement.

arXiv:quant-ph/0610199•IEEE Transactions on Information Theory•Jul 24, 2008•18 citations

Optimal High-Dimensional Entanglement Concentration for Pure Bipartite Systems

Lukas Palma Torres, M. A. Solís-Prosser, O. Jiménez +2 more

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.

arXiv:2304.04890•Micromachines•Jun 7, 2023•1 citation

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
In this paper, we derive general formulas for the amount of entanglement that can be concentrated from general sequences of partially entangled, bipartite pure states. The formulas are obtained by using an information-spectrum approach. The formulas obtained express the optimal rate under constant error constraints or exponential error constraints in the asymptotic framework. Since the formulas treat general sequences, they can be applied to i.i.d. sequences as well as sequences with correlations
We consider asymptotic convertibility of an arbitrary sequence of bipartite pure states into another by local operations and classical communication (LOCC). We adopt an information-spectrum approach to address cases where each element of the sequences is not necessarily a tensor power of a bipartite pure state. We derive necessary and sufficient conditions for the LOCC convertibility of one sequence to another in terms of spectral entropy rates of entanglement of the sequences. Based on these results, we also provide simple proofs for previously known results on the optimal rates of entanglement concentration and dilution of general sequences of bipartite pure states.
Entanglement of pure states of bipartite quantum systems has been shown to have a unique measure in terms of the von Neumann entropy of the reduced states of either of its subsystems. The measure is established under entanglement manipulation of an asymptotically large number of copies of the bipartite pure state. In this paper, two different asymptotic measures of entanglement for arbitrary sequences of bipartite pure states are established. These are shown to coincideonly whenthe sequence isinformation stable, in terms of the quantum spectral information rates of its corresponding sequence of subsystem states. Additional bounds on the optimal rates of entanglement manipulation protocols in quantum information theory are also presented. These include bounds given by generalizations of the coherent information bounds, Rains' bound, and the relative entropy of entanglement.
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.
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.