dorsal/arxiv
View SchemaError exponents for entanglement concentration
| Authors | Masahito Hayashi, Masato Koashi, Keiji Matsumoto, Fumiaki Morikoshi, Andreas Winter |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0206097 |
| URL | https://arxiv.org/abs/quant-ph/0206097 |
| DOI | 10.1088/0305-4470/36/2/316 |
| Journal | J. Phys. A: Math. Gen. 36, 527 (2003) |
Abstract
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.
{
"annotation_id": "51f5d26f-a0b1-416b-9267-09f61fd74522",
"date_created": "2026-03-02T18:01:51.843000Z",
"date_modified": "2026-03-02T18:01:51.843000Z",
"file_hash": "deb782fb086cd85968981ef7941fec4416c2796d6f596a28a13d2992d2586c1d",
"private": false,
"record": {
"abstract": "Consider entanglement concentration schemes that convert n identical copies\nof a pure state into a maximally entangled state of a desired size with success\nprobability being close to one in the asymptotic limit. We give the distillable\nentanglement, the number of Bell pairs distilled per copy, as a function of an\nerror exponent, which represents the rate of decrease in failure probability as\nn tends to infinity. The formula fills the gap between the least upper bound of\ndistillable entanglement in probabilistic concentration, which is the\nwell-known entropy of entanglement, and the maximum attained in deterministic\nconcentration. The method of types in information theory enables the detailed\nanalysis of the distillable entanglement in terms of the error rate. In\naddition to the probabilistic argument, we consider another type of\nentanglement concentration scheme, where the initial state is deterministically\ntransformed into a (possibly mixed) final state whose fidelity to a maximally\nentangled state of a desired size converges to one in the asymptotic limit. We\nshow that the same formula as in the probabilistic argument is valid for the\nargument on fidelity by replacing the success probability with the fidelity.\nFurthermore, we also discuss entanglement yield when optimal success\nprobability or optimal fidelity converges to zero in the asymptotic limit\n(strong converse), and give the explicit formulae for those cases.",
"arxiv_id": "quant-ph/0206097",
"authors": [
"Masahito Hayashi",
"Masato Koashi",
"Keiji Matsumoto",
"Fumiaki Morikoshi",
"Andreas Winter"
],
"categories": [
"quant-ph"
],
"doi": "10.1088/0305-4470/36/2/316",
"journal_ref": "J. Phys. A: Math. Gen. 36, 527 (2003)",
"title": "Error exponents for entanglement concentration",
"url": "https://arxiv.org/abs/quant-ph/0206097"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "0209e476-324d-4772-a430-c7f9b0378147",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}