اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدNecessary Conditions for Extended Noncontextuality in General Sets of Random Variables
113
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We explore the graph approach to contextuality to restate the extended definition of noncontextuality as given by J. Kujala et. al. [Phys. Rev. Lett. 115, 150401 (2015)] using graph-theoretical terms. This extended definition avoids the assumption of the pre-sheaf or non-disturbance condition, which states that if two contexts overlap, then the marginal distribution obtained for the intersection must be the same, a restriction that will never be perfectly satisfied in real experiments. With this we are able to derive necessary conditions for extended noncontextuality for any set of random variables based on the geometrical aspects of the graph approach, which can be tested directly with experimental data in any contextuality experiment and which reduce to traditional necessary conditions for noncontextuality if the non-disturbance condition is satisfied.
قيم البحث
اقرأ أيضاً
We study the norms of the Bloch vectors for arbitrary $n$-partite quantum states. A tight upper bound of the norms is derived for $n$-partite systems with different individual dimensions. These upper bounds are used to deal with the separability prob
lems. Necessary conditions are presented for $mathbf m$-separable states in $n$-partite quantum systems. Based on the upper bounds, classification of multipartite entanglement is illustrated with detailed examples.
In general, for a bipartite quantum system $mathbb{C}^{d}otimesmathbb{C}^{d}$ and an integer $k$ such that $4leq kle d$,there are few necessary and sufficient conditions for local discrimination of sets of $k$ generalized Bell states (GBSs) and it is
difficult to locally distinguish $k$-GBS sets.In this paper, we consider the local discrimination of GBS sets and the purpose is to completely solve the problem of local discrimination of GBS sets in some bipartite quantum systems,specifically, we show some necessary and sufficient conditions for local discrimination of GBS sets by which the local discrimination of GBS sets can be quickly determined.Firstly some sufficient conditions are given, these sufficient conditions are practical and effective.Fan$^{,}$s and Wang et al.$^{,}$s results (Phys Rev Lett 92:177905, 2004: Phys Rev A 99:022307, 2019) can be deduced as special cases of these conditions.Secondly in $mathbb{C}^{4}otimesmathbb{C}^{4}$, a necessary and sufficient condition for local discrimination of GBS sets is provided,all locally indistinguishable 4-GBS sets are found,and then we can quickly determine the local discriminability of an arbitrary GBS set.In $mathbb{C}^{5}otimesmathbb{C}^{5}$, a concise necessary and sufficient condition for one-way local discrimination of GBS sets is obtained,which gives an affirmative answer to the case $d=5$ of the problem proposed by Wang et al. (Phys Rev A 99:022307, 2019).
EPR-steering refers to the ability of one observer to convince a distant observer that they share entanglement by making local measurements. Determining which states allow a demonstration of EPR-steering remains an open problem in general. Here, we o
utline and demonstrate a method of analytically constructing new classes of two-qubit states which are non-steerable by arbitrary projective measurements, from consideration of local operations performed by the steering party on states known to be non-steerable.
Quantum supermaps are a higher-order generalization of quantum maps, taking quantum maps to quantum maps. It is known that any completely positive, trace non-increasing (CPTNI) map can be performed as part of a quantum measurement. By providing an ex
plicit counterexample we show that, instead, not every quantum supermap sending a quantum channel to a CPTNI map can be realized in a measurement on quantum channels. We find that the supermaps that can be implemented in this way are exactly those transforming quantum channels into CPTNI maps even when tensored with the identity supermap. We link this result to the fact that the principle of causality fails in the theory of quantum supermaps.
Within the framework of generalized noncontextuality, we introduce a general technique for systematically deriving noncontextuality inequalities for any experiment involving finitely many preparations and finitely many measurements, each of which has
a finite number of outcomes. Given any fixed sets of operational equivalences among the preparations and among the measurements as input, the algorithm returns a set of noncontextuality inequalities whose satisfaction is necessary and sufficient for a set of operational data to admit of a noncontextual model. Additionally, we show that the space of noncontextual data tables always defines a polytope. Finally, we provide a computationally efficient means for testing whether any set of numerical data admits of a noncontextual model, with respect to any fixed operational equivalences. Together, these techniques provide complete methods for characterizing arbitrary noncontextuality scenarios, both in theory and in practice. Because a quantum prepare-and-measure experiment admits of a noncontextual model if and only if it admits of a positive quasiprobability representation, our techniques also determine the necessary and sufficient conditions for the existence of such a representation.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
