One-Shot Static Entanglement Cost of Bipartite Quantum Channels

Abstract

We first investigate the one-shot static entanglement cost to simulate a bipartite quantum channel under the set of non-entangling channels. The lower bound on the static entanglement cost is given by the generalized robustness of the target channel as well as the robust-generating power of the channel, which implies that the cost necessary to generate a bipartite quantum channel might not be retrievable in general. Next, we conceive a set of quantum channels that extends the set of non-entangling channels. We find out that the one-shot static entanglement cost under the extended set of channels is given by the channel's standard log-robustness. This gives the one-shot dynamic entanglement cost under a set of free superchannels that do not generate dynamic entanglement resource; the extended set is shown to be equivalent to the set of free superchannels.

8 pages, 3 figures; a refined version with additional references

References in corpus (9)

• Application of a resource theory for magic states to fault-tolerant quantum computing
• Quantum Circuits Architecture
• Transforming quantum operations: quantum supermaps
• All entangled states are useful for channel discrimination
• Cost of quantum entanglement simplified
• Dynamical Entanglement
• Nonlocal Entanglement Transformations Achievable by Separable Operations
• One-Shot Manipulation of Dynamical Quantum Resources
• One-shot manipulation of entanglement for quantum channels

Cited by in corpus (2)

• Path Percolation in Quantum Communication Networks
• Single-shot entanglement manipulation of states and channels revisited