Multi-Party Quantum Purity Distillation with Bounded Classical Communication

by   Touheed Anwar Atif, et al.

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 provided with pure ancilla catalytically, i.e., with the promise of returning them unaltered after the end of the protocol. In addition, Alice and Bob can communicate with Charlie using a one-way multiple-access dephasing channel of link rates R_1 and R_2, respectively. The objective of the protocol is to minimize the usage of the dephasing channel (in terms of rates R_1 and R_2) 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,R_1,R_2) in terms of quantum information theoretic quantities such that P amount of purity can be distilled using rates R_1 and R_2. Finally, we also incorporate the technique of asymptotic algebraic structured coding, and provide a unified approach of characterizing the performance limits.



page 1

page 2

page 3

page 4


Unified approach for computing sum of sources over CQ-MAC

We consider the task of communicating a generic bivariate function of tw...

Distributed Quantum Faithful Simulation and Function Computation Using Algebraic Structured Measurements

In this work, we consider the task of faithfully simulating a distribute...

Faithful Simulation of Distributed Quantum Measurements with Applications in Distributed Rate-Distortion Theory

We investigate faithful simulation of distributed quantum measurements a...

Quantum versus Randomized Communication Complexity, with Efficient Players

We study a new type of separation between quantum and classical communic...

Source Coding for Synthesizing Correlated Randomness

We consider a scenario wherein two parties Alice and Bob are provided X_...

Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels

We revisit the problem of low-memory robust simulation of interactive pr...

Computation-aided classical-quantum multiple access to boost network communication speeds

A multiple access channel (MAC) consists of multiple senders simultaneou...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.