Multi-User Distillation of Common Randomness and Entanglement from Quantum States

08/11/2020
by   Farzin Salek, et al.
0

We construct new protocols for the tasks of converting noisy multipartite quantum correlations into noiseless classical and quantum ones using local operations and classical communications (LOCC). For the former, known as common randomness (CR) distillation, two new lower bounds on the "distillable common randomness", an operational measure of the total genuine (classical) correlations in a quantum state, are obtained. Our proof relies on a generalization of communication for omniscience (CO) [Csiszar and Narayan, IEEE Trans. Inf. Theory 50:3047-3061, 2004]. Our contribution here is a novel simultaneous decoder for the compression of correlated classical sources by random binning with quantum side information at the decoder. For the latter, we derive two new lower bounds on the rate at which Greenberger-Horne-Zeilinger (GHZ) states can be asymptotically distilled from any given pure state under LOCC. Our approach consists in "making coherent" the proposed CR distillation protocols and recycling of resources [Devetak et al. IEEE Trans. Inf. Theory 54(10):4587-4618, 2008]. The first lower bound is identical to a recent result by Vrana and Christandl [IEEE Trans. Inf. Theory 65(9):5945-5958, 2019], which is based on a combinatorial method to achieve the same rate. Our second lower bound generalises and improves upon this result, and unifies a number of other known lower bounds on GHZ distillation.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

05/31/2018

New lower bounds to the output entropy of multi-mode quantum Gaussian channels

We prove that quantum thermal Gaussian input states minimize the output ...
02/27/2020

Finite Block Length Analysis on Quantum Coherence Distillation and Incoherent Randomness Extraction

We introduce a variant of randomness extraction framework in the context...
12/01/2020

Time-Space Lower Bounds for Simulating Proof Systems with Quantum and Randomized Verifiers

A line of work initiated by Fortnow in 1997 has proven model-independent...
11/20/2019

Incompressibility of classical distributions

In blind compression of quantum states, a sender Alice is given a specim...
03/18/2021

Lower bound the T-count via unitary stabilizer nullity

We introduce magic measures for multi-qubit quantum gates and establish ...
07/21/2020

Quantum and Classical Hybrid Generations for Classical Correlations

We consider two-stage hybrid protocols that combine quantum resource and...
09/13/2021

Distilling GHZ States using Stabilizer Codes

Entanglement distillation is a well-studied problem in quantum informati...
This week in AI

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