Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 56 tok/s
Gemini 2.5 Pro 39 tok/s Pro
GPT-5 Medium 15 tok/s Pro
GPT-5 High 16 tok/s Pro
GPT-4o 99 tok/s Pro
Kimi K2 155 tok/s Pro
GPT OSS 120B 476 tok/s Pro
Claude Sonnet 4 38 tok/s Pro
2000 character limit reached

Multi-Party Quantum Purity Distillation with Bounded Classical Communication (2203.05511v1)

Published 10 Mar 2022 in quant-ph, cs.IT, and math.IT

Abstract: We consider the task of distilling local purity from a noisy quantum state $\rho{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 $\rho{ABC}$. The three parties have access to their respective subsystems of $\rho{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 $\rho{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.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.