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/0207154 · Physical Review A

Local permutations of products of Bell states and entanglement distillation

Jeroen Dehaene, Maarten Van den Nest, Bart De Moor, Frank Verstraete

Published Feb 28, 2003• 84 citations
arXivHTMLPDF

Abstract

We present different algorithms for mixed-state multicopy entanglement distillation for pairs of qubits. Our algorithms perform significantly better than the best-known algorithms. Better algorithms can be derived that are tuned for specific initial states. These algorithms are based on a characterization of the group of all locally realizable permutations of the ${4}^{n}$ possible tensor products of n Bell states.

DOI
10.1103/physreva.67.022310

Related papers

The equivalence of two approaches to the design of entanglement distillation protocols

Erik Hostens, Jeroen Dehaene, Bart De Moor

We show the equivalence of two approaches to the design of entanglement distillation protocols. The first approach is based on local unitary operations that yield permutations of tensor products of Bell states. The second approach is based on stabilizer codes.

arXiv:quant-ph/0406017•Jun 2, 2004•10 citations

Many Copies May Be Required for Entanglement Distillation

John Watrous

A mixed quantum state $\ensuremath{\rho}$ shared between two parties is said to be distillable if, by means of a protocol involving only local quantum operations and classical communication, the two parties can transform some number of copies of $\ensuremath{\rho}$ into a single shared pair of qubits having high fidelity with the maximally entangled state $|{\ensuremath{\varphi}}^{+}\ensuremath{\rangle}=(|00\ensuremath{\rangle}+|11\ensuremath{\rangle})/\sqrt{2}$. In this Letter it is proved that there exist states that are distillable, but for which an arbitrarily large number of copies is required before any distillation procedure can produce a shared pair of qubits with even a small amount of entanglement. Specifically, for every positive integer $n$ there exists a state $\ensuremath{\rho}$ that is distillable, but, given $n$ or fewer copies of $\ensuremath{\rho}$, every distillation procedure outputting a single shared pair of qubits outputs those qubits in a separable (i.e., unentangled) state.

arXiv:quant-ph/0312123•Physical Review Letters•Jul 1, 2004•80 citations

Entanglement distillation protocols and number theory

Héctor Bombín, Miguel Angel Martin-Delgado

We show that the analysis of entanglement distillation protocols for qudits of arbitrary dimension $D$ benefits from applying basic concepts from number theory, since the set ${\mathbf{Z}}_{D}^{n}$ associated with Bell diagonal states is a module rather than a vector space. We find that a partition of ${\mathbf{Z}}_{D}^{n}$ into divisor classes characterizes the invariant properties of mixed Bell diagonal states under local permutations. We construct a very general class of recursion protocols by means of unitary operations implementing these local permutations. We study these distillation protocols depending on whether we use twirling operations in the intermediate steps or not, and we study them both analytically and numerically with Monte Carlo methods. In the absence of twirling operations, we construct extensions of the quantum privacy algorithms valid for secure communications with qudits of any dimension $D$. When $D$ is a prime number, we show that distillation protocols are optimal both qualitatively and quantitatively.

arXiv:quant-ph/0503013•Physical Review A•Sep 13, 2005•40 citations

Experimental Entanglement Distillation of Two-Qubit Mixed States under Local Operations

Zhiwei Wang, Xiang-Fa Zhou, Yun‐Feng Huang +3 more

We experimentally demonstrate optimal entanglement distillation from two forms of two-qubit mixed states under local filtering operations according to the constructive method introduced by [F. Verstraete, Phys. Rev. A 64, 010101(R) (2001)10.1103/PhysRevA.64.010101]. In principle, our setup can be easily applied to distilling entanglement from arbitrary two-qubit partially mixed states. We also test the violation of the Clauser-Horne-Shinmony-Holt inequality for the distilled state from the first form of mixed state to show its "hidden nonlocality."

arXiv:quant-ph/0511116•Physical Review Letters•Jun 8, 2006•51 citations

Bell-pair distillation under imperfect operations

András Kinyó, Tamás Kiss, Orsolya Kálmán

We recently proposed an entanglement distillation protocol based on local operations and classical communication that probabilistically and universally distills a maximally entangled Bell pair from multiple copies of an unknown two-qubit state [Phys. Rev. Lett. 135, 260202 (2025)]. Here, we investigate the robustness of this protocol against imperfections in its implementation. We consider several incoherent and coherent gate-error models, as well as measurement readout errors, and determine the regimes in which distillation enhances the fidelity with the target Bell state. We find that the protocol remains effective over substantial error ranges, although its robustness depends strongly on the type of error. We further analyze asymmetric errors between the two parties and identify conditions under which complementary postselection outcomes yield identical distillation dynamics, allowing the success probability to be enhanced.

quant-pharXiv:2610.35699•Oct 27, 2026•0 citations

Renormalizing Entanglement Distillation

Stephan Waeldchen, Janina Gertis, Earl T. Campbell +1 more

Entanglement distillation refers to the task of transforming a collection of weakly entangled pairs into fewer highly entangled ones. It is a core ingredient in quantum repeater protocols, which are needed to transmit entanglement over arbitrary distances in order to realize quantum key distribution schemes. Usually, it is assumed that the initial entangled pairs are identically and independently distributed and are uncorrelated with each other, an assumption that might not be reasonable at all in any entanglement generation process involving memory channels. Here, we introduce a framework that captures entanglement distillation in the presence of natural correlations arising from memory channels. Conceptually, we bring together ideas from condensed-matter physics-ideas from renormalization and matrix-product states and operators-with those of local entanglement manipulation, Markov chain mixing, and quantum error correction. We identify meaningful parameter regions for which we prove convergence to maximally entangled states, arising as the fixed points of a matrix-product operator renormalization flow.

arXiv:1503.04822•Physical Review Letters•Jan 15, 2016•18 citations
We present different algorithms for mixed-state multicopy entanglement distillation for pairs of qubits. Our algorithms perform significantly better than the best-known algorithms. Better algorithms can be derived that are tuned for specific initial states. These algorithms are based on a characterization of the group of all locally realizable permutations of the 4n{4}^{n}4n possible tensor products of n Bell states.
A mixed quantum state $\ensuremath{\rho}$ shared between two parties is said to be distillable if, by means of a protocol involving only local quantum operations and classical communication, the two parties can transform some number of copies of $\ensuremath{\rho}$ into a single shared pair of qubits having high fidelity with the maximally entangled state $|{\ensuremath{\varphi}}^{+}\ensuremath{\rangle}=(|00\ensuremath{\rangle}+|11\ensuremath{\rangle})/\sqrt{2}$. In this Letter it is proved that there exist states that are distillable, but for which an arbitrarily large number of copies is required before any distillation procedure can produce a shared pair of qubits with even a small amount of entanglement. Specifically, for every positive integer nnn there exists a state $\ensuremath{\rho}$ that is distillable, but, given nnn or fewer copies of $\ensuremath{\rho}$, every distillation procedure outputting a single shared pair of qubits outputs those qubits in a separable (i.e., unentangled) state.
We show that the analysis of entanglement distillation protocols for qudits of arbitrary dimension DDD benefits from applying basic concepts from number theory, since the set ZDn{\mathbf{Z}}_{D}^{n}ZDn​ associated with Bell diagonal states is a module rather than a vector space. We find that a partition of ZDn{\mathbf{Z}}_{D}^{n}ZDn​ into divisor classes characterizes the invariant properties of mixed Bell diagonal states under local permutations. We construct a very general class of recursion protocols by means of unitary operations implementing these local permutations. We study these distillation protocols depending on whether we use twirling operations in the intermediate steps or not, and we study them both analytically and numerically with Monte Carlo methods. In the absence of twirling operations, we construct extensions of the quantum privacy algorithms valid for secure communications with qudits of any dimension DDD. When DDD is a prime number, we show that distillation protocols are optimal both qualitatively and quantitatively.
We experimentally demonstrate optimal entanglement distillation from two forms of two-qubit mixed states under local filtering operations according to the constructive method introduced by [F. Verstraete, Phys. Rev. A 64, 010101(R) (2001)10.1103/PhysRevA.64.010101]. In principle, our setup can be easily applied to distilling entanglement from arbitrary two-qubit partially mixed states. We also test the violation of the Clauser-Horne-Shinmony-Holt inequality for the distilled state from the first form of mixed state to show its "hidden nonlocality."
We recently proposed an entanglement distillation protocol based on local operations and classical communication that probabilistically and universally distills a maximally entangled Bell pair from multiple copies of an unknown two-qubit state [Phys. Rev. Lett. 135, 260202 (2025)]. Here, we investigate the robustness of this protocol against imperfections in its implementation. We consider several incoherent and coherent gate-error models, as well as measurement readout errors, and determine the regimes in which distillation enhances the fidelity with the target Bell state. We find that the protocol remains effective over substantial error ranges, although its robustness depends strongly on the type of error. We further analyze asymmetric errors between the two parties and identify conditions under which complementary postselection outcomes yield identical distillation dynamics, allowing the success probability to be enhanced.
Entanglement distillation refers to the task of transforming a collection of weakly entangled pairs into fewer highly entangled ones. It is a core ingredient in quantum repeater protocols, which are needed to transmit entanglement over arbitrary distances in order to realize quantum key distribution schemes. Usually, it is assumed that the initial entangled pairs are identically and independently distributed and are uncorrelated with each other, an assumption that might not be reasonable at all in any entanglement generation process involving memory channels. Here, we introduce a framework that captures entanglement distillation in the presence of natural correlations arising from memory channels. Conceptually, we bring together ideas from condensed-matter physics-ideas from renormalization and matrix-product states and operators-with those of local entanglement manipulation, Markov chain mixing, and quantum error correction. We identify meaningful parameter regions for which we prove convergence to maximally entangled states, arising as the fixed points of a matrix-product operator renormalization flow.