We address the problem of distributed multi-party purity distillation (PD) involving three parties in the one-shot regime. By obtaining a one-shot inner bound for the distributed instrument simulation problem that naturally generalizes to the best known asymptotic inner bound, and combining it with a recent one-shot single-party local purity concentration protocol [1], we design a one-shot multi-party PD protocol, analyze its performance and derive a new inner bound. The derived inner bound naturally generalizes to the best known asymptotic inner bound [2].
We address the problem of distributed multi-party purity distillation (PD) involving three parties in the one-shot regime. By obtaining a one-shot inner bound for the distributed instrument simulation problem that naturally generalizes to the best known asymptotic inner bound, and combining it with a recent one-shot single-party local purity concentration protocol [1], we design a one-shot multi-party PD protocol, analyze its performance and derive a new inner bound. The derived inner bound naturally generalizes to the best known asymptotic inner bound [2].
We undertake an information theoretic study of instrument compression problems (ICPs) in {multiple network} configurations, wherein the goal is to design and analyze protocols that simulate specific quantum classical (QC) correlation amidst distributed parties - some holding components of the quantum state and the rest holding classical registers - with minimum communication. We present a \textit{unified framework} of protocols based on likelihood instruments whose analysis yields new inner bounds in the one-shot and asymptotic regimes for the different network configurations we study. Our framework comprises of a common template for designing the instrument simulation protocol and analyzing its information theoretic performance. We also address a related problem of multi-party purity distillation wherein three distributed parties have to distil pure states efficiently via local operations and minimal communication. In regards to the tools, in addition to one-shot purity concentration protocol of \cite{202203arXiv_ChaPadSen} and one-shot quantum simultaneous decoder of Sen \cite{202102SAD_Sen}, we leverage Sen's fully smooth multi-partite covering \cite{202504arXiv_Sen} for all of our covering bounds.
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.
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.
Three distributed parties, two transmitters (Txs) and a receiver (Rx), hold one component each of a tripartite quantum state ρA1A2C. The goal is to simulate the action of a separable instrument acting on the A1 and A2 components, with the Rx recovering the classical outcome. To enable this, each Tx k can transfer bits on a noiseless bit pipe and share randomness at rates Rk and Ck, respectively, with the Rx. Undertaking a Shannon-theoretic study, we characterize two new sets of inner bounds. The first set, derived for the one-shot regime, is based on instrument simulation protocols built using unstructured IID codes, while the second set, derived for the asymptotic regime, relies on coset codes and new decoding POVMs. The first set of bounds recovers current known inner bounds for instrument and measurement simulation in all previously studied scenarios. Our protocols are based on likelihood POVMs, and our analysis leverages Sen's smooth multiparty covering and simultaneous decoding, while handling the distributed-component scenario via a compatible operator sliding trick.
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.