Exact entanglement cost of quantum states and channels under PPT-preserving operations

Xin Wang, Mark M. WildearXiv 2018 · arXiv

Introduction

In the field of quantum information theory, entanglement is treated as a fundamental physical resource, essential for tasks ranging from quantum teleportation to secure communication. A central challenge in this domain is determining the entanglement cost: the precise amount of entanglement, measured in "ebits," required to simulate a specific quantum state or the action of a quantum channel. Historically, calculating this cost has been notoriously difficult due to the "regularization" problem, where standard measures require taking limits over an infinite number of channel uses, rendering them practically uncomputable for general cases.

This research provides a definitive solution to this long-standing problem by focusing on a specific class of operations: those that preserve the Positive Partial Transpose (PPT). By utilizing PPT-preserving operations, the authors derive a "single-letter" formula for entanglement cost that is both exact and efficiently computable.

The Challenge of Channel Simulation

Simulating a quantum channel involves reproducing its input-output behavior using entanglement and a set of "free" operations. Two primary models for this simulation exist:

  1. Parallel Simulation: Where $n$ copies of a channel are simulated simultaneously.
  2. Sequential Simulation: Where channels are simulated one after another, potentially allowing for adaptive strategies and feedback between uses.

Prior to this work, it was unclear whether sequential simulation offered a resource advantage over parallel simulation, or if a simple, non-regularized formula could describe the cost for either model. The complexity of general operations, such as Local Operations and Classical Communication (LOCC), often makes these questions mathematically intractable.

Methodology: The PPT Framework and $\kappa$-Entanglement

The authors overcome these hurdles by restricting the allowed operations to PPT-preserving operations. While PPT operations are more general than LOCC, they are defined by linear constraints, making them significantly more amenable to mathematical analysis and optimization.

The core of their approach involves several technical innovations:

  • Extension of $\kappa$-entanglement ($E_\kappa$): Originally a measure for quantum states, the authors extend $E_\kappa$ to quantum channels, providing a robust metric for channel entanglement.
  • Amortization Collapse: The authors prove a property known as "amortization collapse." They demonstrate that the entanglement of a channel does not "gain" value when used as part of a larger, multi-step protocol. This property is the critical "secret sauce" that allows for a single-letter formula, meaning the cost of $n$ uses is exactly $n$ times the cost of a single use.
  • Semidefinite Programming (SDP): The authors show that $E_\kappa$ can be formulated as an SDP. This ensures that for any finite-dimensional quantum channel, the exact entanglement cost can be calculated efficiently using standard computational tools.

Key Insights and Results

The research yields several transformative results for the study of quantum resources:

1. The Single-Letter Formula

The paper proves that the exact entanglement cost under PPT operations ($E_{PPT}$) is identically equal to the $\kappa$-entanglement of the channel: $$E_{PPT}(\mathcal{N}) = E_\kappa(\mathcal{N})$$ This result simplifies the calculation of entanglement cost from an infinite-limit problem to a single, computable optimization.

2. Equivalence of Simulation Models

A major theoretical contribution is the proof that parallel and sequential simulation models require the exact same amount of entanglement. Despite the intuitive flexibility of sequential strategies, they do not reduce the entanglement cost when the goal is exact simulation under PPT operations.

3. Application to Fundamental Channels

The authors applied their formula to several benchmark quantum channel models, including:

  • Erasure and Depolarizing Channels: Standard models for loss and noise.
  • Amplitude Damping Channels: Modeling energy loss, such as photon absorption.
  • Quantum Gaussian Channels: For continuous-variable systems like fiber optics, the authors showed their formula matches the Holevo-Werner quantity. This provides a concrete operational meaning to a previously abstract mathematical bound.

Limitations and Future Directions

While this work provides a definitive answer for PPT-preserving operations, it also highlights areas for future inquiry. PPT operations are a "relaxation" of the more physically restrictive LOCC operations. Determining the exact cost under LOCC remains a significantly more difficult, open problem. Additionally, this research focuses on exact (zero-error) simulation. The relationship between this exact cost and the asymptotic cost (where error vanishes as the number of uses approaches infinity) continues to be a fertile ground for research. Finally, for certain "quantum-limited" Gaussian channels like pure loss, the authors have established lower bounds and conjectures that await final proof of the upper bound in future studies.

Summary updated

Abstract

This paper establishes single-letter formulas for the exact entanglement cost of simulating quantum channels under free quantum operations that completely preserve positivity of the partial transpose (PPT). First, we introduce the $\kappa$-entanglement measure for point-to-point quantum channels, based on the idea of the $\kappa$-entanglement of bipartite states, and we establish several fundamental properties for it, including amortization collapse, monotonicity under PPT superchannels, additivity, normalization, faithfulness, and non-convexity. Second, we introduce and solve the exact entanglement cost for simulating quantum channels in both the parallel and sequential settings, along with the assistance of free PPT-preserving operations. In particular, we establish that the entanglement cost in both cases is given by the same single-letter formula, the $\kappa$-entanglement measure of a quantum channel. We further show that this cost is equal to the largest $\kappa$-entanglement that can be shared or generated by the sender and receiver of the channel. This formula is calculable by a semidefinite program, thus allowing for an efficiently computable solution for general quantum channels. Noting that the sequential regime is more powerful than the parallel regime, another notable implication of our result is that both regimes have the same power for exact quantum channel simulation, when PPT superchannels are free. For several basic Gaussian quantum channels, we show that the exact entanglement cost is given by the Holevo--Werner formula [Holevo and Werner, Phys. Rev. A 63, 032312 (2001)], giving an operational meaning of the Holevo-Werner quantity for these channels.
BibTeX
@misc{wang2018exact,
  author = {Xin Wang and Mark M. Wilde},
  title = {{Exact entanglement cost of quantum states and channels under PPT-preserving operations}},
  year = {2018},
  eprint = {1809.09592},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/1809.09592},
}
Figure