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

Entanglement distillation protocols and number theory

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

Published Sep 13, 2005• 40 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.72.032313

Related papers

A Novel Stabilizer-based Entanglement Distillation Protocol for Qudits

Christopher Popp, Tobias C. Sutter, Beatrix C. Hiesmayr

Entanglement distillation, the process of converting weakly entangled states into maximally entangled ones using Local Operations and Classical Communication (LOCC), is pivotal for robust entanglement-assisted quantum information processing in error-prone environments. A construction based on stabilizer codes offers an effective method for designing such protocols. By analytically investigating the effective action of stabilizer protocols for systems of prime dimension d , we establish a standard form for the output states of recurrent stabilizer-based distillation. This links the properties of input states, stabilizers, and encodings to the properties of the protocol. Based on those insights, we present a novel two-copy distillation protocol, applicable to all bipartite states in prime dimension, that maximizes the fidelity increase per iteration for Bell-diagonal states. The power of this framework and the protocol is demonstrated through numerical investigations, which provide evidence for superior performance in terms of efficiency and distillability of low-fidelity states compared to other well-established recurrence protocols. By elucidating the interplay between states, errors, and protocols, our contribution advances the systematic development of highly effective distillation protocols, enhancing our understanding of distillability.

arXiv:2408.02383•Quantum•Dec 15, 2025•3 citations

Universal distillation of quantum entanglement

Ryuji Takagi, Kaito Watanabe, Takaya Matsuura +2 more

Distillable entanglement---the maximum rate of Bell states extractable from the given noisy entangled states via local operations and classical communication (LOCC)---has been a central quantity to characterize the operational value of entangled states. However, this operational meaning had been known to be valid only under a crucial assumption: both parties know the description of the input state and can choose the protocol tailored to it, which does not necessarily reflect the natural operational setting. Here, we show that the distillable entanglement is the fundamental operational quantity even without this assumption. We present a universal LOCC protocol---whose description does not depend on the input state and thus works universally for any input---that achieves the distillable entanglement of an arbitrary unknown input state. Our result therefore lifts the distillable entanglement to a robust notion of an operationally meaningful quantity and clarifies that input-state knowledge is not necessary to achieve the optimal rate of entanglement distillation. Our protocol is based on state merging for compound states, together with the uniform convergence property of the finite-block quantity toward distillable entanglement.

quant-pharXiv:2609.40215•Oct 1, 2026•0 citations

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

Distillation of entanglement by projection on permutationally invariant subspaces

Mikołaj Czechlewski, Andrzej Grudka, Michał Horodecki +2 more

We consider distillation of entanglement from two-qubit states which are mixtures of two pure entangled states and one pure product state, which is orthogonal to them. We distill entanglement from such states by projecting n copies of the state on a permutationally invariant subspace and then applying one-way hashing protocol. We find analytical expressions for the rate of the protocol and show that for wide range of parameters, this protocol achieves higher rates than previous ones. We also generalize this method to higher-dimensional systems. To get analytical expression for two-qubit case, we faced a mathematical problem of diagonalizing a family of matrices enjoying some symmetries w.r.t. the symmetric group. We have solved this problem in two ways: (i) directly by the use of Schur–Weyl decomposition and Young symmetrizers and (ii) showing that the problem is equivalent to a problem of diagonalizing adjacency matrices in a particular instance of a so-called algebraic association scheme.

arXiv:1109.3904•Journal of Physics A Mathematical and Theoretical•Mar 5, 2012•4 citations

Computational entanglement distillation beyond pure states: efficient protocols and fundamental limitations

Takeru Utsumi, Jacopo Rizzo, Ryuji Takagi +1 more

The information-theoretic approach to entanglement typically relies on arbitrarily many input copies and unboundedly complex operations; however, the available resources are constrained in reality. This motivates the study of entanglement theory with limited resources. One of its central questions is which quantities characterize entanglement manipulations, and so far, only the idealized case of pure states has been well explored. In this work, we address entanglement distillation from mixed states and identify the Rényi coherent information as the quantity determining the optimal rate in the worst case under two distinct resource constraints. We first characterize the sample-efficient regime, in which unbounded computational power is allowed. Our universal protocol achieves this rate without knowledge of the input state under certain polynomial rank constraints. This rate is optimal among universal protocols: we construct states whose distillable entanglement is nearly extensive, yet from which no universal sample-efficient protocol attains a rate above their Rényi coherent information. We then push this characterization to the computationally efficient frontier: the same bound holds for any efficient protocol even when the input state is known, and another universal protocol achieves this rate efficiently under additional polynomial constraints on the marginal ranks. Overall, our results give the Rényi coherent information a novel operational meaning in two computational settings: universal distillation with limited copies and efficient distillation even with knowledge of the input state.

quant-pharXiv:2610.06787•Oct 6, 2026•0 citations

Quantifying entanglement properties of qudit mixed states with incomplete permutation symmetry

Artur Barasiński, Mateusz Nowotarski

The characterization of entanglement properties in mixed states is important from both a theoretical and a practical point of view. While the estimation of entanglement of bipartite pure states is well established, for mixed states it is a considerably much harder task. The key elements of the mixed-state entanglement theory are given by the exact solutions which sometimes are possible for special states of high symmetry problems. In this paper, we present the exact investigation on the entanglement properties for a five-parameter family of highly symmetric two-qudit mixed states with equal but arbitrary finite local Hilbert space dimension. We achieve this by extensive analysis of various conditions of separability and the entanglement classification with respect to stochastic local operations and classical communication. Furthermore, our results can be used for an arbitrary state by proper application of the proposed twirling operator.

Physical Review A•Apr 21, 2017•7 citations
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.
Entanglement distillation, the process of converting weakly entangled states into maximally entangled ones using Local Operations and Classical Communication (LOCC), is pivotal for robust entanglement-assisted quantum information processing in error-prone environments. A construction based on stabilizer codes offers an effective method for designing such protocols. By analytically investigating the effective action of stabilizer protocols for systems of prime dimension d , we establish a standard form for the output states of recurrent stabilizer-based distillation. This links the properties of input states, stabilizers, and encodings to the properties of the protocol. Based on those insights, we present a novel two-copy distillation protocol, applicable to all bipartite states in prime dimension, that maximizes the fidelity increase per iteration for Bell-diagonal states. The power of this framework and the protocol is demonstrated through numerical investigations, which provide evidence for superior performance in terms of efficiency and distillability of low-fidelity states compared to other well-established recurrence protocols. By elucidating the interplay between states, errors, and protocols, our contribution advances the systematic development of highly effective distillation protocols, enhancing our understanding of distillability.
Distillable entanglement---the maximum rate of Bell states extractable from the given noisy entangled states via local operations and classical communication (LOCC)---has been a central quantity to characterize the operational value of entangled states. However, this operational meaning had been known to be valid only under a crucial assumption: both parties know the description of the input state and can choose the protocol tailored to it, which does not necessarily reflect the natural operational setting. Here, we show that the distillable entanglement is the fundamental operational quantity even without this assumption. We present a universal LOCC protocol---whose description does not depend on the input state and thus works universally for any input---that achieves the distillable entanglement of an arbitrary unknown input state. Our result therefore lifts the distillable entanglement to a robust notion of an operationally meaningful quantity and clarifies that input-state knowledge is not necessary to achieve the optimal rate of entanglement distillation. Our protocol is based on state merging for compound states, together with the uniform convergence property of the finite-block quantity toward distillable entanglement.
We consider distillation of entanglement from two-qubit states which are mixtures of two pure entangled states and one pure product state, which is orthogonal to them. We distill entanglement from such states by projecting n copies of the state on a permutationally invariant subspace and then applying one-way hashing protocol. We find analytical expressions for the rate of the protocol and show that for wide range of parameters, this protocol achieves higher rates than previous ones. We also generalize this method to higher-dimensional systems. To get analytical expression for two-qubit case, we faced a mathematical problem of diagonalizing a family of matrices enjoying some symmetries w.r.t. the symmetric group. We have solved this problem in two ways: (i) directly by the use of Schur–Weyl decomposition and Young symmetrizers and (ii) showing that the problem is equivalent to a problem of diagonalizing adjacency matrices in a particular instance of a so-called algebraic association scheme.
The information-theoretic approach to entanglement typically relies on arbitrarily many input copies and unboundedly complex operations; however, the available resources are constrained in reality. This motivates the study of entanglement theory with limited resources. One of its central questions is which quantities characterize entanglement manipulations, and so far, only the idealized case of pure states has been well explored. In this work, we address entanglement distillation from mixed states and identify the Rényi coherent information as the quantity determining the optimal rate in the worst case under two distinct resource constraints. We first characterize the sample-efficient regime, in which unbounded computational power is allowed. Our universal protocol achieves this rate without knowledge of the input state under certain polynomial rank constraints. This rate is optimal among universal protocols: we construct states whose distillable entanglement is nearly extensive, yet from which no universal sample-efficient protocol attains a rate above their Rényi coherent information. We then push this characterization to the computationally efficient frontier: the same bound holds for any efficient protocol even when the input state is known, and another universal protocol achieves this rate efficiently under additional polynomial constraints on the marginal ranks. Overall, our results give the Rényi coherent information a novel operational meaning in two computational settings: universal distillation with limited copies and efficient distillation even with knowledge of the input state.
The characterization of entanglement properties in mixed states is important from both a theoretical and a practical point of view. While the estimation of entanglement of bipartite pure states is well established, for mixed states it is a considerably much harder task. The key elements of the mixed-state entanglement theory are given by the exact solutions which sometimes are possible for special states of high symmetry problems. In this paper, we present the exact investigation on the entanglement properties for a five-parameter family of highly symmetric two-qudit mixed states with equal but arbitrary finite local Hilbert space dimension. We achieve this by extensive analysis of various conditions of separability and the entanglement classification with respect to stochastic local operations and classical communication. Furthermore, our results can be used for an arbitrary state by proper application of the proposed twirling operator.