Entanglement-assisted transformation is asymptotically equivalent to multiple-copy transformation

Runyao Duan, Yuan Feng, Mingsheng YingPhysical 2005 · DOI · arXiv

Abstract

In quantum information theory, the manipulation of entangled states is often constrained by the limitations of Local Operations and Classical Communication (LOCC). To overcome these constraints, researchers have proposed two primary extensions: entanglement-assisted local transformation (ELOCC), which utilizes a catalyst state, and multiple-copy transformation (MLOCC), which processes several copies of a state simultaneously. This paper demonstrates that these two methods are asymptotically equivalent. Specifically, we show that ELOCC and MLOCC can simulate each other's ability to implement a transformation from a source state to a target state with the same optimal success probability in the asymptotic limit. This equivalence provides a computationally feasible method for evaluating the optimal conversion probabilities of entanglement-assisted transformations.

Introduction

The standard framework for manipulating quantum entanglement between distant parties, Alice and Bob, is Local Operations and Classical Communication (LOCC). However, LOCC is inherently restrictive; it is not always possible to transform a source state $|\psi_1\rangle$ into a target state $|\psi_2\rangle$ with 100% certainty. To expand the reach of quantum state manipulation, two distinct strategies have emerged:

  1. Entanglement-Assisted LOCC (ELOCC): Alice and Bob "borrow" an auxiliary entangled state, known as a catalyst. They use this catalyst to facilitate the transformation and must return it in its original state, unchanged, at the end of the process.
  2. Multiple-Copy LOCC (MLOCC): Instead of transforming a single pair, Alice and Bob process $m$ copies of $|\psi_1\rangle$ to produce $m$ copies of $|\psi_2\rangle$ simultaneously.

While previous research established that catalysis is at least as powerful as multi-copy transformation in deterministic scenarios, their relationship in the probabilistic regime—where the goal is to maximize the success probability—remained an open question. This research addresses whether these two strategies are fundamentally different or represent two facets of the same underlying physical capability.

Methodology

The study utilizes a rigorous mathematical framework centered on Vidal’s formula. This formula calculates the maximum probability of transforming one bipartite entangled state into another via LOCC based on their Schmidt coefficients, which quantify the entanglement present in the system.

To establish the equivalence between the two methods, the authors provide a two-part proof:

  • Proving $P_E \geq P_M$: The authors demonstrate that any multi-copy transformation can be simulated by a specific catalyst. By employing a clever algebraic identity ($x^m - p^m y^m$), they show that the average success probability of $m$ copies can always be matched by a single-copy transformation assisted by an appropriately constructed catalyst.
  • Proving $P_E \leq P_M$: This proof involves showing that a catalyst can be simulated by a sufficiently large number of copies. A critical component of this argument is the observation that a maximally entangled state cannot act as a catalyst. This constraint allows the authors to bound the power of entanglement catalysis, showing that as the number of copies $m$ approaches infinity, the multi-copy success probability $P_M$ converges to the catalyzed success probability $P_E$.

Key Insights

Asymptotic Equivalence

The central finding is that in the limit of infinite copies or optimal catalysts, ELOCC and MLOCC are identical. This suggests that the physical resources required for catalysis and multi-copy processing are essentially interchangeable in the asymptotic regime.

The "Bad" Catalyst Paradox

A counter-intuitive insight used in the proof is that a maximally entangled state is a useless catalyst. While one might expect more entanglement to always help, the requirement that the catalyst must be returned unchanged means that a maximally entangled state provides no additional "leverage" for the transformation. This fact provides the fundamental bound necessary to equate $P_E$ and $P_M$.

Finite vs. Infinite Regimes

The paper notes that for a finite number of copies, catalysis can sometimes be strictly more powerful than multi-copy transformation. The perfect equivalence only emerges as the system approaches the asymptotic limit.

Computational Feasibility

Historically, calculating the optimal conversion probability for a catalyst ($P_E$) was a daunting task because the search space for potential catalysts is infinite. However, the optimal multi-copy probability ($P_M$) can be calculated in polynomial time for a fixed state dimension. By proving $P_E = P_M$, this paper provides a practical algorithm to evaluate entanglement-assisted transformations.

Results and Conclusion

The research culminates in two primary theorems:

  • Theorem 1: For any two pure bipartite states, the optimal entanglement-assisted conversion probability ($P_E$) is exactly equal to the optimal asymptotic average multi-copy conversion probability ($P_M$).
  • Theorem 2: The authors identify a specific condition ($p < \min\{1, \alpha_n/\beta_n\}$) under which the role of a catalyst can be entirely replaced by a finite number of copies.

Furthermore, the authors demonstrate that the geometric average conversion probability for $m$ copies can be computed in $O(m^{n-1} \log m)$ time. This makes the evaluation of these transformations computationally accessible for small-dimensional systems.

While this work provides a definitive answer for bipartite pure states, the authors acknowledge that extending these findings to multipartite states (involving three or more parties) or mixed states (noisy entanglement) remains a significant challenge for future research. Additionally, understanding the rate of convergence—how quickly $P_M$ approaches $P_E$—will be essential for practical applications in quantum networking.

Summary updated

Abstract

We show that two ways of manipulating quantum entanglement---namely, entanglement-assisted local transformation [D. Jonathan and M. B. Plenio, Phys. Rev. Lett. 83, 3566 (1999)] and multiple-copy transformation [S. Bandyopadhyay, V. Roychowdhury, and U. Sen, Phys. Rev. A 65, 052315 (2002)]---are equivalent in the sense that they can asymptotically simulate each other's ability to implement a desired transformation from a given source state to another given target state with the same optimal success probability. As a consequence, this yields a feasible method to evaluate the optimal conversion probability of an entanglement-assisted transformation.
BibTeX
@inproceedings{duan2005entanglement,
  author = {Runyao Duan and Yuan Feng and Mingsheng Ying},
  title = {{Entanglement-assisted transformation is asymptotically equivalent to multiple-copy transformation}},
  booktitle = {Physical},
  year = {2005},
  doi = {10.1103/physreva.72.024306},
}
Figure