We investigate the problem of producing local pure states by performing local noisy operations assisted by one-way classical communication on a given bipartite mixed state in the one-shot setting. We consider the following two scenarios:1)Scenario I: A party, say Alice, is provided with a single copy of some quantum state ρAon system A. The task for Alice is to extract pure qubit states using only noisy operations on A. We call this task purity concentration.2)Scenario II: Two parties, Alice and Bob possess the A and B sub-systems, respectively, of a given bipartite quantum state ρAB. They are allowed to perform any local noisy operations and communicate via a one-way dephasing (i.e., classical) channel. The task for them is to design a protocol using these resources such that together they can extract pure local qubit states from the shared state ρAB. We call this task local purity distillation.
We investigate the problem of producing local pure states by performing local noisy operations assisted by one-way classical communication on a given bipartite mixed state in the one-shot setting. We consider the following two scenarios:1)Scenario I: A party, say Alice, is provided with a single copy of some quantum state ρAon system A. The task for Alice is to extract pure qubit states using only noisy operations on A. We call this task purity concentration.2)Scenario II: Two parties, Alice and Bob possess the A and B sub-systems, respectively, of a given bipartite quantum state ρAB. They are allowed to perform any local noisy operations and communicate via a one-way dephasing (i.e., classical) channel. The task for them is to design a protocol using these resources such that together they can extract pure local qubit states from the shared state ρAB. We call this task local purity distillation.
Local pure states are an important resource for quantum computing. The problem of distilling local pure states from mixed ones can be cast in an information theoretic paradigm. The bipartite version of this problem where local purity must be distilled from an arbitrary quantum state shared between two parties, Alice and Bob, is closely related to the problem of separating quantum and classical correlations in the state and in particular, to a measure of classical correlations called the one-way distillable common randomness. In Phys. Rev. A 71, 062303 (2005), the optimal rate of local purity distillation is derived when many copies of a bipartite quantum state are shared between Alice and Bob, and the parties are allowed unlimited use of a unidirectional dephasing channel. In the present paper, we extend this result to the setting in which the use of the channel is bounded. We demonstrate that in the case of a classical-quantum system, the expression for the local purity distilled is efficiently computable and provide examples with their tradeoff curves.
In this paper we revisit the problem of distributed purity distillation in the one-shot setting. The problem considers a bipartite quantum state ρABshared between two parties Alice and Bob, who are allowed local unitary operations and one-way classical communication. The goal is to extract pure qubit states using these given resources, in their respective laboratories. A caveat of this problem is that all known protocols which recover the optimal number of pure qubit states require some pure qubits at the beginning at the protocol, to be used as ancilla. In this paper, we present a one-shot purity distillation protocol which requires a supply of ancilla qubits at 0 rate in the asymptotic iid setting, and little to no ancilla in the one-shot setting. We show that our protocol outperforms the best known purity distillation algorithms in terms of requirement of additional ancilla, while maintaining the same rate of pure states distilled.
We consider the task of distilling local purity from a noisy quantum state ρABC, wherein we provide a protocol for three parties, Alice, Bob and Charlie, to distill local purity (at a rate P) from many independent copies of a given quantum state ρABC. The three parties have access to their respective subsystems of ρABC, and are only allowed to use local unitary operations. In addition, Alice and Bob can communicate with Charlie using a one-way multiple-access dephasing channel of link rates R1and R2, respectively. The objective of the protocol is to minimize the usage of the dephasing channel (in terms of rates R1and R2) while maximizing the asymptotic purity that can be jointly distilled from ρABC. To achieve this, we employ ideas from distributed measurement compression protocols, and in turn, characterize a set of sufficient conditions on (P, R1,R2) in terms of quantum information theoretic quantities such that P amount of purity can be distilled using rates R1and R2.
Local pure states represent a fundamental resource in quantum information theory. In this work we obtain one-shot achievable bounds on the rates for local purity distillation, in the single-party and in the two-party cases. In both situations, local noisy operations are freely available, while in the two-party case also one-way classical communication can be used. In addition, in both situations local pure ancillas can be borrowed, as long as they are discounted from the final net rate of distillation. The one-shot rates that we obtain, written in terms of mutual information-like quantities, are shown to recover in the limit the asymptotic i.i.d. rates of Devetak [PRA, 2005], up to first order analysis.
Pure states are an important resource in many quantum information processing protocols. However, even making a fixed pure state, say ∣0⟩, in the laboratory requires a considerable amount of effort. Often one ends up with a mixed state ρ whose classical description is nevertheless known. Hence it is important to develop protocols that extract a fixed pure state from a known mixed state. In this work, we study the problem of extracting a fixed pure state ∣0⟩A′∣0⟩B′ from a known pure state ρAB distributed between two parties A and B. Here, A′, B′ are subspaces of A, B and the total amount of purity extracted is log∣A′∣+log∣B′∣. The parties can borrow local pure ancilla, apply local unitary operations and send a message from A to B through a dephasing channel. If local pure ancilla is borrowed, it must be subtracted in order to properly account for the purity extracted. We obtain the most efficient achievable bounds on one shot distributed purity extraction, in terms of the rate of local ancilla borrowed by the protocol, while distilling pure qubits at the best known rate. Our protocols borrow little to no local pure ancilla. Our bounds improve upon the existing bounds for this problem in both one shot as well as asymptotic iid settings. In particular they subsume all the asymptotic iid results of Devetak and Krovi-Devetak. In addition, we derive upper bounds for the rate of distillation in the one shot setting, which nearly match our achievable bounds.
Recently Horodecki et al. [Phys. Rev. Lett. 90, 100402 (2003)] introduced an important quantum information processing paradigm, in which two parties sharing many copies of the same bipartite quantum state distill local pure states by means of local unitary operations assisted by a one-way (two-way) completely dephasing channel. Local pure states are a valuable resource from a thermodynamical point of view, since they allow thermal energy to be converted into work by local quantum heat engines. We give a simple information-theoretical characterization of the one-way distillable local purity, which turns out to be closely related to a previously known operational measure of classical correlations, the one-way distillable common randomness.