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

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

Masahito Hayashi

Published Jun 27, 2002• 0 citations
OpenAlex

Abstract

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.

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•4 citations

General formulas for fixed-length quantum entanglement concentration

Masahito Hayashi

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

arXiv:quant-ph/0206187•IEEE Transactions on Information Theory•Apr 28, 2006•32 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

Error exponents for entanglement concentration

Hayashi, M, Koashi, M, Matsumoto, K +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.

•Jun 14, 2002•21 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•35 citations

Quantum Coding Theorems for Arbitrary Sources, Channels and Entanglement Resources

Garry Bowen, Nilanjana Datta

The information spectrum approach gives general formulae for optimal rates of various information theoretic protocols, under minimal assumptions on the nature of the sources, channels and entanglement resources involved. This paper culminates in the derivation of the dense coding capacity for a noiseless quantum channel, assisted by arbitrary shared entanglement, using this approach. We also review the currently known coding theorems, and their converses, for protocols such as data compression for arbitrary quantum sources and transmission of classical information through arbitrary quantum channels. In addition, we derive the optimal rate of data compression for a mixed source

arXiv:quant-ph/0610003•Sep 30, 2006•13 citations
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.
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.
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.
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.
The information spectrum approach gives general formulae for optimal rates of various information theoretic protocols, under minimal assumptions on the nature of the sources, channels and entanglement resources involved. This paper culminates in the derivation of the dense coding capacity for a noiseless quantum channel, assisted by arbitrary shared entanglement, using this approach. We also review the currently known coding theorems, and their converses, for protocols such as data compression for arbitrary quantum sources and transmission of classical information through arbitrary quantum channels. In addition, we derive the optimal rate of data compression for a mixed source