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:2609.23441

Entanglement Cost of Optimal Distributed Quantum State Purification

Jiayi Zhao, Chengkai Zhu, Xin Wang, Ge Bai

quant-phSubmitted Sep 20, 2026• Announced Sep 22, 2026• 0 citations
arXivHTMLPDF

Abstract

We determine the preshared entanglement required for spatially separated parties, restricted to local operations and classical communication, to attain globally optimal probabilistic two-copy purification of arbitrary bipartite pure states under depolarizing noise. In every local dimension $d\ge 2$, one shared maximally entangled qubit pair suffices: local controlled-SWAP operations exactly reproduce the globally optimal successful transformation. Conversely, any finite-dimensional preshared resource state that attains the same benchmark, even under a positive-partial-transpose relaxation, must have entanglement of formation at least one ebit. For pure resources with one ebit, or for two-qubit resources including mixed states, attaining the benchmark is possible only for states with exactly two nonzero Schmidt weights, both equal to $1/2$, namely those locally unitarily equivalent to a maximally entangled qubit pair. These findings provide a benchmark for evaluating the entanglement demands of noise management in quantum networks and modular quantum computers.

AI Summary

The paper asks how much preshared entanglement spatially separated parties need to reproduce globally optimal blind $2\to1$ purification of arbitrary pure states on $\mathbb C^d\otimes\mathbb C^d$. Each copy independently undergoes global depolarizing noise of strength $0<\gamma<1$. Performance is the Haar-averaged, success-probability-weighted fidelity gain over one noisy copy. For every $d\ge2$, one shared EPR pair suffices. Local controlled-SWAP gates, followed by measurements and classical comparison, implement projection onto the two-copy symmetric subspace; one copy is then discarded. With $D=d^2$, the optimal gain is $G_\star=\tfrac12(1-\gamma+\gamma/D)\gamma(1-\gamma)(1-1/D)$. Conversely, every finite-dimensional resource attaining this benchmark has entanglement of formation at least one ebit, even when finite-round LOCC is relaxed to PPT success/failure instruments. Among pure resources with exactly one ebit, only Schmidt spectrum $(1/2,1/2,0,\ldots)$ permits attainment. A two-qubit resource, including mixed states, permits attainment if and only if it is a pure maximally entangled state. The proof evaluates a global Choi-operator SDP, establishes uniqueness of its optimizer, and uses local mixed-Schur decompositions and PPT constraints to bound resource Schmidt weights. A convex-roof argument extends the lower bound to mixed resources; a Lean verification is reported for the pure-resource bound. The result concerns exact attainment for two copies under global depolarizing noise. The sub-threshold entanglement–gain tradeoff, optimal entanglement requirements for more copies, and corresponding thresholds for other noise models remain open.

Little sign of AI-generated textStrong assumptions

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
43 pages, 2 figures

Related papers

Power and Limitations of Distributed Quantum State Purification

Benchi Zhao, Yu-Ao Chen, Xuanqiang Zhao +3 more

Quantum state purification protocols, which mitigate noise by converting multiple copies of noisy quantum states into fewer copies with a lower noise level, have applications in quantum communication and computation with imperfect devices. Here, we systematically study the task of state purification in distributed quantum systems, demanding that purification be achieved by local operations and classical communication (LOCC). We prove that, in the presence of depolarizing noise, no LOCC purification protocol starting from two copies can work blindly for all the states in three important sets: the set of all pure two-qubit states, the set of all two-qubit maximally entangled states, and the Bell basis. In stark contrast, we show that a targeted, single-state purification is always achievable in the presence of depolarizing noise, and we provide an explicit analytical LOCC protocol for every given two-qubit state. For arbitrary finite sets of pure states and arbitrary noise profiles, we develop an optimization-based algorithm that systematically designs LOCC purification protocols, and we demonstrate it through concrete examples. Overall, our results identify both fundamental limitations and practical noise-reduction strategies for distributed quantum information processing.

arXiv:2509.08691•Physical Review Letters•Feb 2, 2026•3 citations

Optimal Interpolation of Entanglement Purification Protocols

Matthew Barber, Stefano Pirandola

Bipartite entanglement purification is the conversion of copies of weakly entangled pairs shared between two separated parties into a smaller number of strongly entangled shared pairs using only local operations and classical communication. Choosing between different entanglement purification protocols generally involves weighing up a trade-off between the ratio of strongly entangled pairs produced to weakly entangled pairs consumed, which we call the rate of the protocol, and the degree of the entanglement of the strongly entangled pairs, typically measured by the fidelity of those pairs to maximally entangled states. By randomly choosing a protocol according to a probability distribution over a list of protocols for each pair we want to produce, we can achieve rates and fidelities not achieved by any of the original protocols. Here, we show how to choose this distribution to maximize the rate at which we produce qubit pairs with a given fidelity to a Bell state or, equivalently, to maximize the fidelity to a Bell state of the qubit pairs produced at a given rate. We investigate both the asymptotic case, where the number of initial pairs goes to infinity, and the finite-size regime, where protocols are restricted to a finite number of weakly entangled pairs.

quant-pharXiv:2511.09657•Physical Review A•Nov 14, 2025•3 citations

Purification of two-qubit mixed states

E. Jané

We find the necessary and sufficient condition under which two two-qubit mixed states can be purified into a pure maximally entangled state by local operations and classical communication. The optimal protocol for such transformation is obtained. This result leads to a necessary and sufficient condition for the exact purification of $n$ copies of a two-qubit state.

arXiv:quant-ph/0205107•Quantum Information and Computation•Aug 1, 2002•12 citations

The Minimal Dimension of Entangled-Noise Advantage

Xiao-Ke Wang, Zi-Yuan Liu, Ming-Yang Li +2 more

Can entangled noise erase entanglement more efficiently than separable noise? Standard robustness restricts the added noise to separable states; generalized robustness allows any state. We prove that the two costs coincide for every two-qubit state and give an explicit full-rank qubit--qutrit state with a strict gap. Positivity under partial transpose (PPT) characterizes separability in both dimensions, so the boundary is not caused by a failure of the PPT criterion. Instead, product-vector geometry permits a rank-one bridge between the two-qubit dual optimizations and supplies a two-dimensional completely entangled subspace for the qubit--qutrit separation. Local isometric embeddings complete the finite-dimensional bipartite classification, also for any fixed multipartite cut. Combined with known three-qubit separation, the result classifies universal equality relative to full separability in all finite multipartite systems.

quant-pharXiv:2609.28367•Sep 24, 2026•0 citations

Entanglement Cost in Practical Scenarios

Francesco Buscemi, Nilanjana Datta

We quantify the one-shot entanglement cost of an arbitrary bipartite state, that is, the minimum number of singlets needed by two distant parties to create a single copy of the state up to a finite accuracy, by using local operations and classical communication only. This analysis, in contrast to the traditional one, pertains to scenarios of practical relevance, in which resources are finite and transformations can be achieved only approximately. Moreover, it unveils a fundamental relation between two well-known entanglement measures, namely, the Schmidt number and the entanglement of formation. Using this relation, we are able to recover the usual expression of the entanglement cost as a special case.

arXiv:0906.3698•Physical Review Letters•Mar 30, 2011•57 citations

Local cloning of entangled states

Vlad Gheorghiu, Li Zhi Yu, Scott M. Cohen

We investigate the conditions under which a set $\mathcal{S}$ of pure bipartite quantum states on a $D\ifmmode\times\else\texttimes\fi{}D$ system can be locally cloned deterministically by separable operations, when at least one of the states is full Schmidt rank. We allow for the possibility of cloning using a resource state that is less than maximally entangled. Our results include that: (i) all states in $\mathcal{S}$ must be full Schmidt rank and equally entangled under the $G$-concurrence measure, and (ii) the set $\mathcal{S}$ can be extended to a larger clonable set generated by a finite group $G$ of order $|G|=N$, the number of states in the larger set. It is then shown that any local cloning apparatus is capable of cloning a number of states that divides $D$ exactly. We provide a complete solution for two central problems in local cloning, giving necessary and sufficient conditions for (i) when a set of maximally entangled states can be locally cloned, valid for all $D$; and (ii) local cloning of entangled qubit states with nonvanishing entanglement. In both of these cases, we show that a maximally entangled resource is necessary and sufficient, and the states must be related to each other by local unitary ``shift'' operations. These shifts are determined by the group structure, so need not be simple cyclic permutations. Assuming this shifted form and partially entangled states, then in $D=3$ we show that a maximally entangled resource is again necessary and sufficient, while for higher-dimensional systems, we find that the resource state must be strictly more entangled than the states in $\mathcal{S}$. All of our necessary conditions for separable operations are also necessary conditions for local operations and classical communication (LOCC), since the latter is a proper subset of the former. In fact, all our results hold for LOCC, as our sufficient conditions are demonstrated for LOCC, directly.

arXiv:1004.5126•Physical Review A•Aug 11, 2010•12 citations
We determine the preshared entanglement required for spatially separated parties, restricted to local operations and classical communication, to attain globally optimal probabilistic two-copy purification of arbitrary bipartite pure states under depolarizing noise. In every local dimension d≥2d\ge 2d≥2, one shared maximally entangled qubit pair suffices: local controlled-SWAP operations exactly reproduce the globally optimal successful transformation. Conversely, any finite-dimensional preshared resource state that attains the same benchmark, even under a positive-partial-transpose relaxation, must have entanglement of formation at least one ebit. For pure resources with one ebit, or for two-qubit resources including mixed states, attaining the benchmark is possible only for states with exactly two nonzero Schmidt weights, both equal to 1/21/21/2, namely those locally unitarily equivalent to a maximally entangled qubit pair. These findings provide a benchmark for evaluating the entanglement demands of noise management in quantum networks and modular quantum computers.
The paper asks how much preshared entanglement spatially separated parties need to reproduce globally optimal blind 2→12\to12→1 purification of arbitrary pure states on Cd⊗Cd\mathbb C^d\otimes\mathbb C^dCd⊗Cd. Each copy independently undergoes global depolarizing noise of strength 0<γ<10<\gamma<10<γ<1. Performance is the Haar-averaged, success-probability-weighted fidelity gain over one noisy copy.
For every d≥2d\ge2d≥2, one shared EPR pair suffices. Local controlled-SWAP gates, followed by measurements and classical comparison, implement projection onto the two-copy symmetric subspace; one copy is then discarded. With D=d2D=d^2D=d2, the optimal gain is G⋆=12(1−γ+γ/D)γ(1−γ)(1−1/D)G_\star=\tfrac12(1-\gamma+\gamma/D)\gamma(1-\gamma)(1-1/D)G⋆​=21​(1−γ+γ/D)γ(1−γ)(1−1/D). Conversely, every finite-dimensional resource attaining this benchmark has entanglement of formation at least one ebit, even when finite-round LOCC is relaxed to PPT success/failure instruments. Among pure resources with exactly one ebit, only Schmidt spectrum (1/2,1/2,0,…)(1/2,1/2,0,\ldots)(1/2,1/2,0,…) permits attainment. A two-qubit resource, including mixed states, permits attainment if and only if it is a pure maximally entangled state.
The proof evaluates a global Choi-operator SDP, establishes uniqueness of its optimizer, and uses local mixed-Schur decompositions and PPT constraints to bound resource Schmidt weights. A convex-roof argument extends the lower bound to mixed resources; a Lean verification is reported for the pure-resource bound.
The result concerns exact attainment for two copies under global depolarizing noise. The sub-threshold entanglement–gain tradeoff, optimal entanglement requirements for more copies, and corresponding thresholds for other noise models remain open.
Quantum state purification protocols, which mitigate noise by converting multiple copies of noisy quantum states into fewer copies with a lower noise level, have applications in quantum communication and computation with imperfect devices. Here, we systematically study the task of state purification in distributed quantum systems, demanding that purification be achieved by local operations and classical communication (LOCC). We prove that, in the presence of depolarizing noise, no LOCC purification protocol starting from two copies can work blindly for all the states in three important sets: the set of all pure two-qubit states, the set of all two-qubit maximally entangled states, and the Bell basis. In stark contrast, we show that a targeted, single-state purification is always achievable in the presence of depolarizing noise, and we provide an explicit analytical LOCC protocol for every given two-qubit state. For arbitrary finite sets of pure states and arbitrary noise profiles, we develop an optimization-based algorithm that systematically designs LOCC purification protocols, and we demonstrate it through concrete examples. Overall, our results identify both fundamental limitations and practical noise-reduction strategies for distributed quantum information processing.
Bipartite entanglement purification is the conversion of copies of weakly entangled pairs shared between two separated parties into a smaller number of strongly entangled shared pairs using only local operations and classical communication. Choosing between different entanglement purification protocols generally involves weighing up a trade-off between the ratio of strongly entangled pairs produced to weakly entangled pairs consumed, which we call the rate of the protocol, and the degree of the entanglement of the strongly entangled pairs, typically measured by the fidelity of those pairs to maximally entangled states. By randomly choosing a protocol according to a probability distribution over a list of protocols for each pair we want to produce, we can achieve rates and fidelities not achieved by any of the original protocols. Here, we show how to choose this distribution to maximize the rate at which we produce qubit pairs with a given fidelity to a Bell state or, equivalently, to maximize the fidelity to a Bell state of the qubit pairs produced at a given rate. We investigate both the asymptotic case, where the number of initial pairs goes to infinity, and the finite-size regime, where protocols are restricted to a finite number of weakly entangled pairs.
We find the necessary and sufficient condition under which two two-qubit mixed states can be purified into a pure maximally entangled state by local operations and classical communication. The optimal protocol for such transformation is obtained. This result leads to a necessary and sufficient condition for the exact purification of nnn copies of a two-qubit state.
Can entangled noise erase entanglement more efficiently than separable noise? Standard robustness restricts the added noise to separable states; generalized robustness allows any state. We prove that the two costs coincide for every two-qubit state and give an explicit full-rank qubit--qutrit state with a strict gap. Positivity under partial transpose (PPT) characterizes separability in both dimensions, so the boundary is not caused by a failure of the PPT criterion. Instead, product-vector geometry permits a rank-one bridge between the two-qubit dual optimizations and supplies a two-dimensional completely entangled subspace for the qubit--qutrit separation. Local isometric embeddings complete the finite-dimensional bipartite classification, also for any fixed multipartite cut. Combined with known three-qubit separation, the result classifies universal equality relative to full separability in all finite multipartite systems.
We quantify the one-shot entanglement cost of an arbitrary bipartite state, that is, the minimum number of singlets needed by two distant parties to create a single copy of the state up to a finite accuracy, by using local operations and classical communication only. This analysis, in contrast to the traditional one, pertains to scenarios of practical relevance, in which resources are finite and transformations can be achieved only approximately. Moreover, it unveils a fundamental relation between two well-known entanglement measures, namely, the Schmidt number and the entanglement of formation. Using this relation, we are able to recover the usual expression of the entanglement cost as a special case.
We investigate the conditions under which a set S\mathcal{S}S of pure bipartite quantum states on a $D\ifmmode\times\else\texttimes\fi{}D$ system can be locally cloned deterministically by separable operations, when at least one of the states is full Schmidt rank. We allow for the possibility of cloning using a resource state that is less than maximally entangled. Our results include that: (i) all states in S\mathcal{S}S must be full Schmidt rank and equally entangled under the GGG-concurrence measure, and (ii) the set S\mathcal{S}S can be extended to a larger clonable set generated by a finite group GGG of order ∣G∣=N|G|=N∣G∣=N, the number of states in the larger set. It is then shown that any local cloning apparatus is capable of cloning a number of states that divides DDD exactly. We provide a complete solution for two central problems in local cloning, giving necessary and sufficient conditions for (i) when a set of maximally entangled states can be locally cloned, valid for all DDD; and (ii) local cloning of entangled qubit states with nonvanishing entanglement. In both of these cases, we show that a maximally entangled resource is necessary and sufficient, and the states must be related to each other by local unitary ``shift'' operations. These shifts are determined by the group structure, so need not be simple cyclic permutations. Assuming this shifted form and partially entangled states, then in D=3D=3D=3 we show that a maximally entangled resource is again necessary and sufficient, while for higher-dimensional systems, we find that the resource state must be strictly more entangled than the states in S\mathcal{S}S. All of our necessary conditions for separable operations are also necessary conditions for local operations and classical communication (LOCC), since the latter is a proper subset of the former. In fact, all our results hold for LOCC, as our sufficient conditions are demonstrated for LOCC, directly.