اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدUpper bounds for relative entropy of entanglement based on active learning
110
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Quantifying entanglement for multipartite quantum state is a crucial task in many aspects of quantum information theory. Among all the entanglement measures, relative entropy of entanglement $E_{R}$ is an outstanding quantity due to its clear geometric meaning, easy compatibility with different system sizes, and various applications in many other related quantity calculations. Lower bounds of $E_R$ were previously found based on distance to the set of positive partial transpose states. We propose a method to calculate upper bounds of $E_R$ based on active learning, a subfield in machine learning, to generate an approximation of the set of separable states. We apply our method to calculate $E_R$ for composite systems of various sizes, and compare with the previous known lower bounds, obtaining promising results. Our method adds a reliable tool for entanglement measure calculation and deepens our understanding for the structure of separable states.
قيم البحث
اقرأ أيضاً
We provide a versatile upper bound on the number of maximally entangled qubits, or private bits, shared by two parties via a generic adaptive communication protocol over a quantum network when the use of classical communication is not restricted. Alt
hough our result follows the idea of Azuma et al. [Nat. Comm. 7, 13523 (2016)] of splitting the network into two parts, our approach relaxes their strong restriction, consisting of the use of a single entanglement measure in the quantification of the maximum amount of entanglement generated by the channels. In particular, in our bound the measure can be chosen on a channel-by-channel basis, in order to make it as tight as possible. This enables us to apply the relative entropy of entanglement, which often gives a state-of-the-art upper bound, on every Choi-simulable channel in the network, even when the other channels do not satisfy this property. We also develop tools to compute, or bound, the max-relative entropy of entanglement for channels that are invariant under phase rotations. In particular, we present an analytical formula for the max-relative entropy of entanglement of the qubit amplitude damping channel.
We extend Vedral and Plenios theorem (theorem 3 in Phys. Rev. A 57, 1619) to a more general case, and obtain the relative entropy of entanglement for a class of mixed states, this result can also follow from Rains theorem 9 in Phys. Rev. A 60, 179.
We calculate the relative entropy of entanglement for rotationally invariant states of spin-1/2 and arbitrary spin-$j$ particles or of spin-1 particle and spin-$j$ particle with integer $j$. A lower bound of relative entropy of entanglement and an up
per bound of distillable entanglement are presented for rotationally invariant states of spin-1 particle and spin-$j$ particle with half-integer $j$.
As two of the most important entanglement measures--the entanglement of formation and the entanglement of distillation--have so far been limited to bipartite settings, the study of other entanglement measures for multipartite systems appears necessar
y. Here, connections between two other entanglement measures--the relative entropy of entanglement and the geometric measure of entanglement--are investigated. It is found that for arbitrary pure states the latter gives rise to a lower bound on the former. For certain pure states, some bipartite and some multipartite, this lower bound is saturated, and thus their relative entropy of entanglement can be found analytically in terms of their known geometric measure of entanglement. For certain mixed states, upper bounds on the relative entropy of entanglement are also established. Numerical evidence strongly suggests that these upper bounds are tight, i.e., they are actually the relative entropy of entanglement.
Given a finite dimensional pure state transformation restricted by entanglement assisted local operations and classical communication (ELOCC), we derive minimum and maximum bounds on the entanglement of an ancillary catalyst that allows that transfor
mation. These bounds are non-trivial even when the Schmidt number of both the original and ancillary states becomes large. We identify a lower bound for the dimension of a catalyst allowing a particular ELOCC transformation. Along with these bounds, we present further constraints on ELOCC transformations by identifying restrictions on the Schmidt coefficients of the target state. In addition, an example showing the existence of qubit ELOCC transformations with multiple ranges of potential ancillary states is provided. This example reveals some additional difficulty in finding strict bounds on ELOCC transformations, even in the qubit case. Finally, a comparison of the bounds in this paper with previously discovered bounds is presented.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
