dorsal/arxiv
View SchemaExtracting Quantum Entanglement (General Entanglement Purification Protocols)
| Authors | Andris Ambainis, Ke Yang |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0110011 |
| URL | https://arxiv.org/abs/quant-ph/0110011 |
Abstract
We study the problem of general entanglement purification protocols. Suppose Alice and Bob share a bipartite state $\rho$ which is ``reasonably close'' to perfect EPR pairs. The only information Alice and Bob possess is a lower bound on the fidelity of $\rho$ and a maximally entangled state. They wish to ``purify'' $\rho$ using local operations and classical communication and create a state that is arbitrarily close to EPR pairs. We prove that on average, Alice and Bob cannot increase the fidelity of the input state significantly. We also construct protocols that may fail with a small probability, and otherwise will output states arbitrarily close to EPR pairs with very high probability. Our constructions are efficient, i.e., they can be implemented by polynomial-size quantum circuits.
{
"annotation_id": "37c00c2b-8bc7-45b0-a3dc-56a3f7aa5ecd",
"date_created": "2026-03-02T18:01:45.794000Z",
"date_modified": "2026-03-02T18:01:45.794000Z",
"file_hash": "bfb667da3c5ee28949d516df2519fad6d11f70f45e9c33d48bf53b7fcef10494",
"private": false,
"record": {
"abstract": "We study the problem of general entanglement purification protocols. Suppose\nAlice and Bob share a bipartite state $\\rho$ which is ``reasonably close\u0027\u0027 to\nperfect EPR pairs. The only information Alice and Bob possess is a lower bound\non the fidelity of $\\rho$ and a maximally entangled state. They wish to\n``purify\u0027\u0027 $\\rho$ using local operations and classical communication and create\na state that is arbitrarily close to EPR pairs. We prove that on average, Alice\nand Bob cannot increase the fidelity of the input state significantly. We also\nconstruct protocols that may fail with a small probability, and otherwise will\noutput states arbitrarily close to EPR pairs with very high probability. Our\nconstructions are efficient, i.e., they can be implemented by polynomial-size\nquantum circuits.",
"arxiv_id": "quant-ph/0110011",
"authors": [
"Andris Ambainis",
"Ke Yang"
],
"categories": [
"quant-ph"
],
"title": "Extracting Quantum Entanglement (General Entanglement Purification Protocols)",
"url": "https://arxiv.org/abs/quant-ph/0110011"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "161e9722-5c6b-406e-bc1b-853ed9aef461",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}