One-Shot Non-Catalytic Distributed Purity Distillation

• URL: http://arxiv.org/abs/2403.16466v1
• Date: Mon, 25 Mar 2024 06:48:50 GMT
• Title: One-Shot Non-Catalytic Distributed Purity Distillation
• Authors: Sayantan Chakraborty, Rahul Jain, Pranab Sen,
• Abstract summary: 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.
• Score: 7.1221402714048505
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Pure states are an important resource in many quantum information processing protocols. However, even making a fixed pure state, say $|0\rangle$, in the laboratory requires a considerable amount of effort. Often one ends up with a mixed state $\rho$ 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\rangle^{A'} |0\rangle^{B'}$ from a known pure state $\rho^{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.

Related papers

• Pseudorandom density matrices [0.8204952610951527]
  Pseudorandom states (PRSs) are state ensembles that cannot be distinguished from Haar random states by any efficient quantum algorithm. We introduce PRDMs, ensembles of $n$-qubit states that are computationally indistinguishable from the generalized Hilbert-Schmidt ensemble. PRDMs with $m=omega(log n)$ are robust to unital noise channels and a recently introduced $mathsfPostBQP$ attack. We also introduce memoryless PRSs, a noise-robust notion of PRS which are indistinguishable to Haar random states for efficient
  arXiv  Detail & Related papers  (2024-07-16T11:14:58Z)
• 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)
• Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit Feedback and Unknown Transition [71.33787410075577]
  We study reinforcement learning with linear function approximation, unknown transition, and adversarial losses. We propose a new algorithm that attains an $widetildeO(dsqrtHS3K + sqrtHSAK)$ regret with high probability.
  arXiv  Detail & Related papers  (2024-03-07T15:03:50Z)
• An optimal tradeoff between entanglement and copy complexity for state tomography [24.737530909081915]
  We study tomography in the natural setting where one can make measurements of $t$ copies at a time. This is the first smooth entanglement-copy protocol known for any quantum learning task. A key insight is to use SchurilonWeyl sampling not to estimate the spectrum of $rho$, but to estimate the deviation of $rho$ from the maximally mixed state.
  arXiv  Detail & Related papers  (2024-02-26T07:18:57Z)
• Subsystem Trace-Distances of Two Random States [0.0]
  We study two-state discrimination in chaotic quantum systems. We analytically calculate the corresponding crossover for finite numbers $N$ of qubits. We test our predictions against exact diagonalization of models for many-body chaos.
  arXiv  Detail & Related papers  (2022-10-06T21:16:10Z)
• Multi-Party Quantum Purity Distillation with Bounded Classical Communication [8.594140167290098]
  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$.
  arXiv  Detail & Related papers  (2022-03-10T18:04:33Z)
• A Law of Robustness beyond Isoperimetry [84.33752026418045]
  We prove a Lipschitzness lower bound $Omega(sqrtn/p)$ of robustness of interpolating neural network parameters on arbitrary distributions. We then show the potential benefit of overparametrization for smooth data when $n=mathrmpoly(d)$. We disprove the potential existence of an $O(1)$-Lipschitz robust interpolating function when $n=exp(omega(d))$.
  arXiv  Detail & Related papers  (2022-02-23T16:10:23Z)
• 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)
• Optimal policy evaluation using kernel-based temporal difference methods [78.83926562536791]
  We use kernel Hilbert spaces for estimating the value function of an infinite-horizon discounted Markov reward process. We derive a non-asymptotic upper bound on the error with explicit dependence on the eigenvalues of the associated kernel operator. We prove minimax lower bounds over sub-classes of MRPs.
  arXiv  Detail & Related papers  (2021-09-24T14:48:20Z)
• Learning Halfspaces with Tsybakov Noise [50.659479930171585]
  We study the learnability of halfspaces in the presence of Tsybakov noise. We give an algorithm that achieves misclassification error $epsilon$ with respect to the true halfspace.
  arXiv  Detail & Related papers  (2020-06-11T14:25:02Z)
• Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction [63.41789556777387]
  Asynchronous Q-learning aims to learn the optimal action-value function (or Q-function) of a Markov decision process (MDP) We show that the number of samples needed to yield an entrywise $varepsilon$-accurate estimate of the Q-function is at most on the order of $frac1mu_min (1-gamma)5varepsilon2+ fract_mixmu_min (1-gamma)$ up to some logarithmic factor.
  arXiv  Detail & Related papers  (2020-06-04T17:51:00Z)
• Simple scheme for extracting work with a single bath [0.0]
  The protocol is based on a recent work definition involving only a single bath. We quantify both the extracted work and the ideal efficiency of the process also giving maximum bounds for them. Our proposal makes use of simple operations not needing fine control.
  arXiv  Detail & Related papers  (2018-06-29T12:44:38Z)

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.