Computable lower bounds on the entanglement cost of quantum channels
arXiv:2201.09257 · doi:10.1088/1751-8121/aca731
Abstract
A class of lower bounds for the entanglement cost of any quantum state was recently introduced in [arXiv:2111.02438] in the form of entanglement monotones known as the tempered robustness and tempered negativity. Here we extend their definitions to point-to-point quantum channels, establishing a lower bound for the asymptotic entanglement cost of any channel, whether finite or infinite dimensional. This leads, in particular, to a bound that is computable as a semidefinite program and that can outperform previously known lower bounds, including ones based on quantum relative entropy. In the course of our proof we establish a useful link between the robustness of entanglement of quantum states and quantum channels, which requires several technical developments such as showing the lower semicontinuity of the robustness of entanglement of a channel in the weak*-operator topology on bounded linear maps between spaces of trace class operators.
24 pages. Technical companion paper to [arXiv:2111.02438], now published as [Nat. Phys. 19, 184-189 (2023)]. In v2, which is close to the published version, we improved the presentation and corrected a few typos
References in corpus (8)
- Transforming quantum operations: quantum supermaps
- Entanglement Theory and the Second Law of Thermodynamics
- Cost of quantum entanglement simplified
- No second law of entanglement manipulation after all
- Energy-constrained diamond norm with applications to the uniform continuity of continuous variable channel capacities
- Resource theories of quantum channels and the universal role of resource erasure
- Amortized entanglement of a quantum channel and approximately teleportation-simulable channels
- Functional analytic insights into irreversibility of quantum resources