We characterize the operational task of environment-assisted distillation of quantum coherence under different sets of free operations when only a finite supply of copies of a given state is available. We first evaluate the one-shot assisted distillable coherence exactly, and introduce a semidefinite programming bound on it in terms of a smooth entropic quantity. We prove the bound to be tight for all systems in dimensions 2 and 3, which allows us to obtain computable expressions for the one-shot rate of distillation, establish an analytical expression for the best achievable fidelity of assisted distillation for any finite number of copies, and fully solve the problem of asymptotic zero-error assisted distillation for qubit and qutrit systems. Our characterization shows that all relevant sets of free operations in the resource theory of coherence have exactly the same power in the task of one-shot assisted coherence distillation, and furthermore resolves a conjecture regarding the additivity of coherence of assistance in dimension 3.
We characterize the operational task of environment-assisted distillation of quantum coherence under different sets of free operations when only a finite supply of copies of a given state is available. We first evaluate the one-shot assisted distillable coherence exactly, and introduce a semidefinite programming bound on it in terms of a smooth entropic quantity. We prove the bound to be tight for all systems in dimensions 2 and 3, which allows us to obtain computable expressions for the one-shot rate of distillation, establish an analytical expression for the best achievable fidelity of assisted distillation for any finite number of copies, and fully solve the problem of asymptotic zero-error assisted distillation for qubit and qutrit systems. Our characterization shows that all relevant sets of free operations in the resource theory of coherence have exactly the same power in the task of one-shot assisted coherence distillation, and furthermore resolves a conjecture regarding the additivity of coherence of assistance in dimension 3.
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 ability to distill quantum coherence is pivotal for optimizing the performance of quantum technologies; however, such a task cannot always be accomplished with certainty. Here we develop a general framework of probabilistic distillation of quantum coherence in a one-shot setting, establishing fundamental limitations for different classes of free operations. We first provide a geometric interpretation for the maximal success probability, showing that under maximally incoherent operations (MIO) and dephasing-covariant incoherent operations (DIO) the problem can be simplified into efficiently computable semidefinite programs. Exploiting these results, we find that DIO and its subset of strictly incoherent operations have equal power in the probabilistic distillation of coherence from pure input states, while MIO are strictly stronger. We then prove a fundamental no-go result: Distilling coherence from any full-rank state is impossible even probabilistically. We further find that in some conditions the maximal success probability can vanish suddenly beyond a certain threshold in the distillation fidelity. Finally, we consider probabilistic coherence distillation assisted by a catalyst and demonstrate, with specific examples, its superiority to the unassisted and deterministic cases.
We give the first systematic study on the second order asymptotics of the operational task of coherence distillation with and without assistance. In the unassisted setting, we introduce a variant of randomness extraction framework where free incoherent operations are allowed before the incoherent measurement and the randomness extractors. We then show that the maximum number of random bits extractable from a given quantum state is precisely equal to the maximum number of coherent bits distillable from the same state. This relation enables us to derive tight second order expansions of both tasks in the independent and identically distributed setting. Remarkably, the incoherent operation classes that can empower coherence distillation for generic states all admit the same second order expansions, indicating their operational equivalence for coherence distillation in both asymptotic and large block length regimes. We then generalize the above line of research to the assisted setting, arising naturally in bipartite quantum systems where Bob distills coherence from the state at hand, aided by the benevolent Alice possessing the other system. More precisely, we introduce a new assisted incoherent randomness extraction task and establish an exact relation between this task and the assisted coherence distillation. It strengthens the one-shot relation in the unassisted setting and confirms that this cryptographic framework offers a new perspective to the study of quantum coherence distillation. Likewise, this relation yields second order characterizations to the assisted tasks. As by-products, we show the strong converse property of the tasks above from their second order expansions.
The resource theory of quantum coherence is an important topic in quantum information science. Standard coherence distillation and dilution problems have been thoroughly studied. In this paper, we introduce and study the problem of one-shot coherence distillation with catalysts. In order to distill more coherence from a state of interest, a catalytic system can be involved and a jointly free operation is applied to both systems. The joint output state should be a maximally coherent state in tensor product with the unchanged catalysts, with some allowable fidelity error. We consider several different definitions of this problem. First, with a small fidelity error in both systems, we show that, even via the smallest free operation class (physically implementable incoherent operations), the distillable coherence of any state with no restriction on the catalysts is infinite, which is a ``coherence embezzling phenomenon.'' We then define and calculate a lower bound for the distillable coherence when the dimension of catalysts is restricted. Finally, in consideration of physical relevance, we define the ``perfect catalysts'' scenario where the catalysts are required to be pure and precisely unchanged. Interestingly, we show that in this setting catalysts basically provide no advantages in pure state distillation via incoherent operations and strictly incoherent operations under certain smoothing restriction. Our work enhances the understanding of catalytic effect in quantum resource theory.
We use the techniques of convex optimization, especially semidefinite programming, to study two kinds of fundamental tasks, i.e., distillation and simulation in quantum information theory. We investigate these tasks in a unified framework of resource theory and focus on their computation and characterization with finite resources. Particularly we study the tradeoff among relevant parameters such as the number of resource copies, resource transformation rate, error tolerance and success probability.
In the first part, we study the task of distillation for two different resources, maximally entangled state and maximally coherent state, representing nonlocal and local “quantumness” respectively. For entanglement distillation, we derive an efficiently computable second-order estimation of the distillation rate for general quantum states, which are tight for quantum states of practical interest. Our study overcomes the limitation of conventional research either focusing on the asymptotic rate or ignoring the computability. For the coherence distillation, we perform finite analysis for both deterministic and probabilistic scenarios. Our results unveil several new features of coherence from a resource theoretic viewpoint and contribute to an increased understanding of the fundamental properties of different sets of free operations.
In the second part, we investigate the resource cost of simulating a quantum channel via quantum coherence or another quantum channel. We introduce the channel’s analogs of max-relative entropy, logarithmic robustness and max-information of quantum states, providing their operational interpretation with the channel simulation cost via different resources. Particularly, we establish the asymptotic equipartition property of the channel’s max-information, that is, it converges to the quantum mutual information of the channel in the independent and identically distributed asymptotic limit. As applications, this asymptotic equipartition property implies the quantum reverse Shannon theorem in the presence of non-signalling correlations.
From the perspective of resource theory, the worth of a resource can usually be characterized by the minimum distance to a set of useless resources under a proper distance measure. We give such characterization for all the tasks studied in this thesis, and find that the distance measure for the distillation and simulation process naturally corresponds to the quantum hypothesis testing relative entropy and the max-relative entropy, respectively.
We characterize the distillation of quantum coherence in the one-shot setting, that is, the conversion of general quantum states into maximally coherent states under different classes of quantum operations. We show that the maximally incoherent operations (MIO) and the dephasing-covariant incoherent operations (DIO) have the same power in the task of one-shot coherence distillation. We establish that the one-shot distillable coherence under MIO and DIO is efficiently computable with a semidefinite program, which we show to correspond to a quantum hypothesis testing problem. Further, we introduce a family of coherence monotones generalizing the robustness of coherence as well as the modified trace distance of coherence, and show that they admit an operational interpretation in characterizing the fidelity of distillation under different classes of operations. By providing an explicit formula for these quantities for pure states, we show that the one-shot distillable coherence under MIO, DIO, strictly incoherent operations, and incoherent operations is equal for all pure states.