اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn the structure of LOCC: finite vs. infinite rounds
98
0
0.0
(
0
)
تأليف
Scott M. Cohen
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Every measurement that can be implemented by local quantum operations and classical communication (LOCC) using an infinite number of rounds is the limit of a sequence of measurements each of which requires only a finite number of rounds. This rather obvious and well-known fact is nonetheless of interest as it shows that these infinite-round measurements can be approximated arbitrarily closely simply by using more and more rounds of communication. Here we demonstrate the perhaps less obvious result that (at least) for bipartite systems, the reverse relationship also holds. Specifically, we show that every finite-round bipartite LOCC measurement is the limit of a continuous sequence of LOCC measurements, where each measurement in that sequence can be implemented by LOCC, but only with the use of an infinite number of rounds. Thus, the set of LOCC measurements that require an infinite number of rounds is dense in the entirety of LOCC, as is the set of finite-round LOCC measurements. This means there exist measurements that can only be implemented by LOCC by using an infinite number of rounds, but can nonetheless be approximated closely by using one round of communication, and actually in some cases, no communication is needed at all. These results follow from a new necessary condition for finite-round LOCC, which is extremely simple to check, is very easy to prove, and which can be violated by utilizing an infinite number of rounds.
قيم البحث
اقرأ أيضاً
We consider bipartite LOCC, the class of operations implementable by local quantum operations and classical communication between two parties. Surprisingly, there are operations that cannot be implemented with finitely many messages but can be approx
imated to arbitrary precision with more and more messages. This significantly complicates the analysis of what can or cannot be approximated with LOCC. Towards alleviating this problem, we exhibit two scenarios in which allowing vanishing error does not help. The first scenario involves implementation of measurements with projective product measurement operators. The second scenario is the discrimination of unextendible product bases on two 3-dimensional systems.
We point out a necessary condition that a quantum measurement can be implemented by the class of protocols known as Local Operations and Classical Communication, or LOCC, including in the limit of an infinite number of rounds. A generalization of thi
s condition is then proven to hold for any measurement that is in the closure of that set, ${bar{textrm{LOCC}}}$. This generalization unifies, extends, and provides a geometric justification for previously known results on ${bar{text{LOCC}}}$, reproducing their consequences with regard to practical applications. We have also used our condition to answer a variety of long-standing, unsolved problems, including for distinguishability of certain sets of states by LOCC. These include various classes of unextendible product bases, for which we prove they cannot be distinguished by LOCC even when infinite resources are available and vanishing error is allowed.
In this paper, we mainly consider the local indistinguishability of the set of mutually orthogonal bipartite generalized Bell states (GBSs). We construct small sets of GBSs with cardinality smaller than $d$ which are not distinguished by one-way loca
l operations and classical communication (1-LOCC) in $dotimes d$. The constructions, based on linear system and Vandermonde matrix, is simple and effective. The results give a unified upper bound for the minimum cardinality of 1-LOCC indistinguishable set of GBSs, and greatly improve previous results in [Zhang emph{et al.}, Phys. Rev. A 91, 012329 (2015); Wang emph{et al.}, Quantum Inf. Process. 15, 1661 (2016)]. The case that $d$ is odd of the results also shows that the set of 4 GBSs in $5otimes 5$ in [Fan, Phys. Rev. A 75, 014305 (2007)] is indeed a 1-LOCC indistinguishable set which can not be distinguished by Fans method.
We introduce an approach to compute reduced density matrices for local quantum unitary circuits of finite depth and infinite width. Suppose the time-evolved state under the circuit is a matrix-product state with bond dimension $D$; then the reduced d
ensity matrix of a half-infinite system has the same spectrum as an appropriate $Dtimes D$ matrix acting on an ancilla space. We show that reduced density matrices at different spatial cuts are related by quantum channels acting on the ancilla space. This quantum channel approach allows for efficient numerical evaluation of the entanglement spectrum and Renyi entropies and their spatial fluctuations at finite times in an infinite system. We benchmark our numerical method on random unitary circuits, where many analytic results are available, and also show how our approach analytically recovers the behaviour of the kicked Ising model at the self-dual point. We study various properties of the spectra of the reduced density matrices and their spatial fluctuations in both the random and translation-invariant cases.
Local operations with classical communication (LOCC) and separable operations are two classes of quantum operations that play key roles in the study of quantum entanglement. Separable operations are strictly more powerful than LOCC, but no simple exp
lanation of this phenomenon is known. We show that, in the case of von Neumann measurements, the ability to interpolate measurements is an operational principle that sets apart LOCC and separable operations.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
