Abstract A class of lower bounds for the entanglement cost of any quantum state was recently introduced in Lami and Regula (2023 Nature Physics ) 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.
Abstract A class of lower bounds for the entanglement cost of any quantum state was recently introduced in Lami and Regula (2023 Nature Physics ) 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.
The manipulation of quantum entanglement is fundamentally irreversible: some mixed entangled states require pure entanglement for their preparation, although no pure entanglement can be recovered from them by local operations and classical communication. This irreversibility is known to persist even under the maximal class of operations that do not generate entanglement, revealing a fundamental distinction between entanglement theory and thermodynamics. We construct cases for which any attempt to restore reversibility necessarily incurs an error that increases exponentially with the number of copies. Technically, we demonstrate a strict separation between the exponential strong-converse distillable entanglement and the exponential strong-converse entanglement cost. Our result resolves a conjecture posed by Lami and Regula (Nat. Phys. 19, 184-189 (2023)) and strengthens it by showing that the irreversibility of entanglement persists even at the level of polynomially (in the number of copies) growing error. We further derive a semidefinite-programming lower bound on the exponential strong-converse cost under non-entangling operations. Finally, for the class of completely PPT-preserving operations, we construct analytically solvable families of antisymmetric states exhibiting the exponential strong-converse irreversibility. Remarkably, to our knowledge, no analogous separation between exponential strong converse cost and the analogous distillable entanglement is currently known even under the more restrictive class of LOCC operations.
Quantifying the minimum entanglement needed to prepare quantum states and implement quantum processes is a key challenge in quantum information theory. In this Letter, we develop computable and faithful lower bounds on the entanglement cost under quantum operations that completely preserve the positivity of partial transpose (PPT operations), by introducing the generalized divergence of k-negativity, a generalization of logarithmic negativity. Our bounds are efficiently computable via semidefinite programming and provide nontrivial values for all states that are non-PPT (NPT), establishing their faithfulness for the resource theory of NPT entanglement. Notably, we find and affirm the irreversibility of asymptotic entanglement manipulation under PPT operations for full-rank entangled states. Furthermore, we extend our methodology to derive lower bounds on the entanglement cost of both point-to-point and bipartite quantum channels. Our bound demonstrates improvements over previously known computable bounds for a wide range of quantum states and channels. These findings push the boundaries of understanding the structure of entanglement and the fundamental limits of entanglement manipulation.
Entanglement cost is the asymptotic rate of Bell pairs required to prepare a quantum state. Its regularized definition has made exact evaluation difficult, even for isotropic states (i.e., depolarized maximally entangled states). In this work, we determine the entanglement cost of every qubit isotropic state and, more generally, every two-qubit Bell-diagonal state. Our proof uses a family of suitably tuned qubit semigroups to transform a general log-Sobolev entropy bound into supporting lines of Wootters' function. A recent exact tensorization theorem of Dong et al. [arXiv:2606.17729] extends these bounds to arbitrarily many copies, yielding a general lower bound on entanglement cost. Matching this bound with the entanglement of formation also determines the exact cost for a broader class of two-qubit states. For qudit isotropic states, we derive another general lower bound from the full depolarizing 2→3 norm. This bound substantially improves on the PPT-relative entropy of entanglement and nearly matches the entanglement of formation, leaving a gap of at most 2% of logd that vanishes as d grows. Finally, the exact qubit results and qudit bounds extend to the entanglement cost of preparing quantum depolarizing channels under both parallel and sequential strategies.
This thesis aims to improve our understanding of the structure of quantum entanglement and the limits of information processing with quantum systems. It presents new results relevant to three threads of quantum information: the theory of quantum entanglement, the communication capabilities of quantum channels, and the quantum zero-error information theory. \nIn the first part, we investigate the fundamental features of quantum entanglement and develop quantitative approaches to better exploit the power of entanglement. First, we introduce a computable and additive entanglement measure to quantify the amount of entanglement, which also plays an important role as the improved semidefinite programming (SDP) upper bound of distillable entanglement. Second, we show that the Rains bound is neither additive nor equal to the asymptotic relative entropy of entanglement. Third, we establish SDP lower bounds for the entanglement cost and demonstrate the irreversibility of asymptotic entanglement manipulation under positive-partial-transpose-preserving quantum operations, resolving a major open problem in quantum information theory. \nIn the second part, we develop a framework of semidefinite programs to evaluate the classical and quantum communication capabilities of quantum channels in both the non-asymptotic and asymptotic regimes. In particular, we establish the first general SDP strong converse bound on the classical capacity of an arbitrary quantum channel and give in particular the best known upper bound on the classical capacity of the amplitude damping channel. We further establish a finite resource analysis of classical communication over quantum erasure channels, including the first second-order expansion of classical capacity beyond entanglement-breaking channels. For quantum communication, we establish the best SDP-computable strong converse bound and refine it as the so-called max-Rains information. \nIn the third part, we investigate the quantum zero-error information theory. In contrast to the conventional Shannon theory, there is a very different-looking information theory when errors are required to be precisely zero, where the communication problem reduces to the analysis of the so-called confusability graph (noncommutative graph) of a classical channel (quantum channel). We develop an activated communication model and explore its novel properties. Notably, we separate the quantum Lovász number and the entanglement-assisted zero-error capacity, resolving an intriguing open problem in the area of zero-error information.
Sending quantum information reliably over long distances is a central challenge in quantum technology in general, and in quantum optics in particular, since most quantum communication relies on optical fibres or free-space links. Here, we address this problem by shifting the focus from the quantity of information sent to the quality of the transmission, i.e. the rate of decay of the transmission error with respect to the number of channel uses. For the general class of teleportation-simulable channels, which includes all channels arising in quantum optical communication, we prove that the single-letter reverse relative entropy of entanglement of the Choi state upper bounds the error exponent of two-way assisted quantum communication - paralleling the celebrated capacity bound of [Pirandola et al., Nat. Comm. (2017)] in terms of the regularised relative entropy of entanglement. Remarkably, for Gaussian channels our bound can be computed efficiently through a convex program with simple constraints involving only finite-dimensional covariance matrices. As a prototypical application, we derive closed-form analytical expressions of our upper bound as well as random-coding-based lower bounds for several one-mode Gaussian channels. Extending recent work [Lami et al., arXiv:2408.07067 (2024)] to infinite-dimensional systems, we further endow the reverse relative entropy of entanglement with an exact operational interpretation in entanglement testing, and show that it characterises the rate of entanglement distillation under non-entangling operations. These findings offer a new perspective on entanglement as a resource and sharpen the theoretical benchmarks for future quantum optical networks.
Abstract We prove that the entanglement cost equals the regularized entanglement of formation for any infinite-dimensional quantum state ρAB ρ AB with finite quantum entropy on at least one of the subsystems A or B . This generalizes a foundational result in quantum information theory that was previously formulated only for operations and states on finite-dimensional systems. The extension to infinite-dimensional systems is nontrivial because the conventional tools for establishing both the direct and converse bounds, i.e., strong typicality, monotonicity, and asymptotic continuity, are no longer directly applicable. To address this problem, we construct a new entanglement dilution protocol for infinite-dimensional states implementable by local operations and a finite amount of one-way classical communication (one-way LOCC), using weak and strong typicality multiple times. We also prove the optimality of this protocol among all protocols, even under infinite-dimensional separable operations, by developing an argument based on alternative forms of monotonicity and asymptotic continuity of the entanglement of formation for infinite-dimensional states. Along the way, we derive a new integral representation for the quantum entropy of infinite-dimensional states, which we believe to be of independent interest. Our results allow us to fully characterize an important operational entanglement measure—the entanglement cost—for all infinite-dimensional physical systems.