اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOne-shot entanglement distillation beyond local operations and classical communication
169
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study the task of entanglement distillation in the one-shot setting under different classes of quantum operations which extend the set of local operations and classical communication (LOCC). Establishing a general formalism which allows for a straightforward comparison of their exact achievable performance, we relate the fidelity of distillation under these classes of operations with a family of entanglement monotones and the rates of distillation with a class of smoothed entropic quantities based on the hypothesis testing relative entropy. We then characterise exactly the one-shot distillable entanglement of several classes of quantum states and reveal many simplifications in their manipulation. We show in particular that the $varepsilon$-error one-shot distillable entanglement of any pure state is the same under all sets of operations ranging from one-way LOCC to separability-preserving operations or operations preserving the set of states with positive partial transpose, and can be computed exactly as a quadratically constrained linear program. We establish similar operational equivalences in the distillation of isotropic and maximally correlated states, reducing the computation of the relevant quantities to linear or semidefinite programs. We also show that all considered sets of operations achieve the same performance in environment-assisted entanglement distillation from any state.
قيم البحث
اقرأ أيضاً
Local pure states are an important resource for quantum computing. The problem of distilling local pure states from mixed ones can be cast in an information theoretic paradigm. The bipartite version of this problem where local purity must be distille
d from an arbitrary quantum state shared between two parties, Alice and Bob, is closely related to the problem of separating quantum and classical correlations in the state and in particular, to a measure of classical correlations called the one-way distillable common randomness. In Phys. Rev. A 71, 062303 (2005), the optimal rate of local purity distillation is derived when many copies of a bipartite quantum state are shared between Alice and Bob, and the parties are allowed unlimited use of a unidirectional dephasing channel. In the present paper, we extend this result to the setting in which the use of the channel is bounded. We demonstrate that in the case of a classical-quantum system, the expression for the local purity distilled is efficiently computable and provide examples with their tradeoff curves.
It is known that the number of different classical messages which can be communicated with a single use of a classical channel with zero probability of decoding error can sometimes be increased by using entanglement shared between sender and receiver
. It has been an open question to determine whether entanglement can ever increase the zero-error communication rates achievable in the limit of many channel uses. In this paper we show, by explicit examples, that entanglement can indeed increase asymptotic zero-error capacity, even to the extent that it is equal to the normal capacity of the channel. Interestingly, our examples are based on the exceptional simple root systems E7 and E8.
In a recent paper [Phys. Rev. A 76, 032304(2007)], Li et al. proposed the definition of the residual entanglement for n qubits by means of the Stochastic local operations and classical communication. Here we argue that their definition is not suitable for the case of odd-n qubits.
Bipartite operations underpin both classical communication and entanglement generation. Using a superposition of classical messages, we show that the capacity of a two-qubit operation for error-free entanglement-assisted bidirectional classical commu
nication can not exceed twice the entanglement capability. In addition we show that any bipartite two-qubit operation can increase the communication that may be performed using an ensemble by twice the entanglement capability.
We give a conceptually simple necessary condition such that a separable quantum operation can be implemented by local operations on subsystems and classical communication between parties (LOCC), a condition which follows from a novel approach to unde
rstanding LOCC. This necessary condition holds for any number of parties and any finite number of rounds of communication and as such, also provides a completely general sufficient condition that a given separable operation cannot be exactly implemented by LOCC. Furthermore, it demonstrates an extremely strong difference between separable operations and LOCC, in that there exist examples of the former for which the condition is extensively violated. More precisely, the violation by separable operations of our necessary condition for LOCC grows without limit as the number of parties increases.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
