Multi-Party Quantum Purity Distillation with Bounded Classical Communication

• URL: http://arxiv.org/abs/2203.05511v1
• Date: Thu, 10 Mar 2022 18:04:33 GMT
• Title: Multi-Party Quantum Purity Distillation with Bounded Classical Communication
• Authors: Touheed Anwar Atif, S. Sandeep Pradhan
• Abstract summary: We consider the task of distilling local purity from a noisy quantum state $rhoABC$. We provide a protocol for three parties, Alice, Bob and Charlie, to distill local purity from many independent copies of a given quantum state $rhoABC$.
• Score: 8.594140167290098
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• On the sample complexity of purity and inner product estimation [8.94496959777308]
  We study the sample complexity of the tasks quantum purity estimation and quantum inner product estimation. In purity estimation, we are to estimate $tr(rho2)$ of an unknown quantum state $rho$ to additive error $epsilon$. For quantum inner product estimation, Alice and Bob are to estimate $tr(rhosigma)$ to additive error $epsilon$ given copies of unknown quantum state $rho$ and $sigma$.
  arXiv  Detail & Related papers  (2024-10-16T16:17:21Z)
• Control of the von Neumann Entropy for an Open Two-Qubit System Using Coherent and Incoherent Drives [50.24983453990065]
  This article is devoted to developing an approach for manipulating the von Neumann entropy $S(rho(t))$ of an open two-qubit system with coherent control and incoherent control inducing time-dependent decoherence rates. The following goals are considered: (a) minimizing or maximizing the final entropy $S(rho(T))$; (b) steering $S(rho(T))$ to a given target value; (c) steering $S(rho(T))$ to a target value and satisfying the pointwise state constraint $S(
  arXiv  Detail & Related papers  (2024-05-10T10:01:10Z)
• Quantum Error Suppression with Subgroup Stabilisation [3.4719087457636792]
  Quantum state purification is the functionality that, given multiple copies of an unknown state, outputs a state with increased purity. We propose an effective state purification gadget with a moderate quantum overhead by projecting $M$ noisy quantum inputs to their subspace. Our method, applied in every short evolution over $M$ redundant copies of noisy states, can suppress both coherent and errors by a factor of $1/M$, respectively.
  arXiv  Detail & Related papers  (2024-04-15T17:51:47Z)
• One-Shot Non-Catalytic Distributed Purity Distillation [7.1221402714048505]
  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 $|0rangleA' |0rangleB'$ from a known pure state. In addition, we derive upper bounds for the rate of distillation in the one shot setting, which nearly match our achievable bounds.
  arXiv  Detail & Related papers  (2024-03-25T06:48:50Z)
• Tokenization and the Noiseless Channel [71.25796813073399]
  Good tokenizers lead to emphefficient channel usage, where the channel is the means by which some input is conveyed to the model. In machine translation, we find that across multiple tokenizers, the R'enyi entropy with $alpha = 2.5$ has a very strong correlation with textscBleu: $0.78$ in comparison to just $-0.32$ for compressed length.
  arXiv  Detail & Related papers  (2023-06-29T10:32:09Z)
• Tools for the analysis of quantum protocols requiring state generation within a time window [1.9021200954913475]
  Quantum protocols commonly require a certain number of quantum resource states to be available simultaneously. Here, we consider a setting in which a process generates a quantum resource state with some probability $p$ in each time step. To maintain sufficient quality for an application, each resource state is discarded from the memory after $w$ time steps.
  arXiv  Detail & Related papers  (2023-04-25T09:22:16Z)
• Near-term $n$ to $k$ distillation protocols using graph codes [0.0]
  Noisy hardware forms one of the main hurdles to the realization of a near-term quantum internet. We consider here an experimentally relevant class of distillation protocols, which distill $n$ to $k$ end-to-end entangled pairs. We leverage this correspondence to find provably optimal distillation protocols in this class for several tasks important for the quantum internet.
  arXiv  Detail & Related papers  (2023-03-20T21:46:17Z)
• Quantum Resources Required to Block-Encode a Matrix of Classical Data [56.508135743727934]
  We provide circuit-level implementations and resource estimates for several methods of block-encoding a dense $Ntimes N$ matrix of classical data to precision $epsilon$. We examine resource tradeoffs between the different approaches and explore implementations of two separate models of quantum random access memory (QRAM) Our results go beyond simple query complexity and provide a clear picture into the resource costs when large amounts of classical data are assumed to be accessible to quantum algorithms.
  arXiv  Detail & Related papers  (2022-06-07T18:00:01Z)
• Random quantum circuits transform local noise into global white noise [118.18170052022323]
  We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially. If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
  arXiv  Detail & Related papers  (2021-11-29T19:26:28Z)
• Annihilating Entanglement Between Cones [77.34726150561087]
  We show that Lorentz cones are the only cones with a symmetric base for which a certain stronger version of the resilience property is satisfied. Our proof exploits the symmetries of the Lorentz cones and applies two constructions resembling protocols for entanglement distillation.
  arXiv  Detail & Related papers  (2021-10-22T15:02:39Z)
• Quantum Communication Complexity of Distribution Testing [114.31181206328276]
  Two players each receive $t$ samples from one distribution over $[n]$. The goal is to decide whether their two distributions are equal, or are $epsilon$-far apart. We show that the quantum communication complexity of this problem is $tildeO$(tepsilon2))$ qubits when distributions have low $l$-norm.
  arXiv  Detail & Related papers  (2020-06-26T09:05:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.