We study entanglement distillation and dilution of states and channels in the single-shot regime. With the help of a recently introduced conversion distance, we provide compact closed-form expressions for the dilution and distillation of pure states and show how this can be used to efficiently calculate these quantities on multiple copies of pure states. These closed-form expressions also allow us to obtain second-order asymptotics. We then prove that the ε-single-shot entanglement cost of mixed states is given exactly in terms of an expression containing a suitably smoothed version of the conditional max-entropy. For pure states, this expression reduces to the smoothed max-entropy of the reduced state, for which we provide a closed-form expression. Analogously, we provide a closed-form expression for the smoothed min-entropy and connect it to the ε-single-shot distillable entanglement. Based on these results, we bound the single-shot entanglement cost of channels. We then turn to the one-way entanglement distillation of states and channels and provide bounds in terms of a quantity we denote coherent information of entanglement.
We study entanglement distillation and dilution of states and channels in the single-shot regime. With the help of a recently introduced conversion distance, we provide compact closed-form expressions for the dilution and distillation of pure states and show how this can be used to efficiently calculate these quantities on multiple copies of pure states. These closed-form expressions also allow us to obtain second-order asymptotics. We then prove that the ε-single-shot entanglement cost of mixed states is given exactly in terms of an expression containing a suitably smoothed version of the conditional max-entropy. For pure states, this expression reduces to the smoothed max-entropy of the reduced state, for which we provide a closed-form expression. Analogously, we provide a closed-form expression for the smoothed min-entropy and connect it to the ε-single-shot distillable entanglement. Based on these results, we bound the single-shot entanglement cost of channels. We then turn to the one-way entanglement distillation of states and channels and provide bounds in terms of a quantity we denote coherent information of entanglement.
We obtain expressions for the optimal rates of one-shot entanglement manipulation under operations which generate a negligible amount of entanglement. As the optimal rates for entanglement distillation and dilution in this paradigm, we obtain the max- and min-relative entropies of entanglement, the two logarithmic robustnesses of entanglement, and smoothed versions thereof. This gives a new operational meaning to these entanglement measures. Moreover, by considering the limit of many identical copies of the shared entangled state, we partially recover the recently found reversibility of entanglement manipulation under the class of operations which asymptotically do not generate entanglement.
Quantum information decoupling is a fundamental primitive in quantum information theory, underlying various applications in quantum physics. We prove a novel one-shot decoupling theorem formulated in terms of quantum relative entropy distance, with the decoupling error bounded by two sandwiched Rényi conditional entropies. In the asymptotic i.i.d. setting of standard information decoupling via partial trace, we show that this bound is ensemble-tight in quantum relative entropy distance and thereby yields a characterization of the associated decoupling error exponent in the low-cost-rate regime.
Leveraging this framework, we derive several operational applications formulated in terms of purified distance: (i) single-letter expressions for the exact error exponents of quantum state merging in the low-entanglement-cost and high-entanglement-distillation-rate regimes, in terms of Petz-Rényi conditional entropies, and (ii) regularized expressions for achievable error exponents of entanglement distillation and quantum channel coding in terms of Petz-Rényi coherent informations. We further prove that these achievable bounds are tight for maximally correlated states and generalized dephasing channels, respectively, for the high distillation-rate/coding-rate regimes.
Abstract We study the task of entanglement distillation in the one-shot setting under different classes of quantum operations which extend the set of local operations and classical communication (LOCC). Establishing a general formalism which allows for a straightforward comparison of their exact achievable performance, we relate the fidelity of distillation under these classes of operations with a family of entanglement monotones and the rates of distillation with a class of smoothed entropic quantities based on the hypothesis testing relative entropy. We then characterise exactly the one-shot distillable entanglement of several classes of quantum states and reveal many simplifications in their manipulation. We show in particular that the ε-error one-shot distillable entanglement of any pure state is the same under all sets of operations ranging from one-way LOCC to separability-preserving operations or operations preserving the set of states with positive partial transpose, and can be computed exactly as a quadratically constrained linear program. We establish similar operational equivalences in the distillation of isotropic and maximally correlated states, reducing the computation of the relevant quantities to linear or semidefinite programs. We also show that all considered sets of operations achieve the same performance in environment-assisted entanglement distillation from any state.
The information-theoretic approach to entanglement typically relies on arbitrarily many input copies and unboundedly complex operations; however, the available resources are constrained in reality. This motivates the study of entanglement theory with limited resources. One of its central questions is which quantities characterize entanglement manipulations, and so far, only the idealized case of pure states has been well explored. In this work, we address entanglement distillation from mixed states and identify the Rényi coherent information as the quantity determining the optimal rate in the worst case under two distinct resource constraints. We first characterize the sample-efficient regime, in which unbounded computational power is allowed. Our universal protocol achieves this rate without knowledge of the input state under certain polynomial rank constraints. This rate is optimal among universal protocols: we construct states whose distillable entanglement is nearly extensive, yet from which no universal sample-efficient protocol attains a rate above their Rényi coherent information. We then push this characterization to the computationally efficient frontier: the same bound holds for any efficient protocol even when the input state is known, and another universal protocol achieves this rate efficiently under additional polynomial constraints on the marginal ranks. Overall, our results give the Rényi coherent information a novel operational meaning in two computational settings: universal distillation with limited copies and efficient distillation even with knowledge of the input state.
Entanglement distillation, an essential quantum information processing task, refers to the conversion from multiple copies of noisy entangled states to a smaller number of highly entangled states. In this paper, we study the non-asymptotic fundamental limits for entanglement distillation. We investigate the optimal tradeoff between the distillation rate, the number of prepared states, and the error tolerance. First, we derive the one-shot distillable entanglement under completely positive partial transpose preserving operations as a semidefinite program and demonstrate an exact characterization via the quantum hypothesis testing relative entropy. Second, we establish efficiently computable second-order estimations of the distillation rate for general quantum states. In particular, we provide explicit as well as approximate evaluations for various quantum states of practical interest, including pure states, mixture of Bell states, maximally correlated states, and isotropic states.
Although it is well known that the amount of resources that can be asymptotically distilled from a quantum state or channel does not exceed the resource cost needed to produce it, the corresponding relation in the nonasymptotic regime hitherto has not been well understood.Here, we establish a quantitative relation between the one-shot distillable resource yield and dilution cost in terms of transformation errors involved in these processes.Notably, our bound is applicable to quantum state and channel manipulation with respect to any type of quantum resource and any class of free transformations thereof, encompassing broad types of settings, including entanglement, quantum thermodynamics, and quantum communication.We also show that our techniques provide strong converse bounds relating the distillable resource and the resource dilution cost in the asymptotic regime.Moreover, we introduce a class of channels that generalize the twirling maps encountered in many resource theories, and by directly connecting it with resource quantification, we compute analytically several smoothed resource measures and improve our one-shot yield-cost bound in relevant theories.We use these operational insights to exactly evaluate important measures for various resource states in the resource theory of magic states.