اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدError-Tolerating Bell Inequalities via Graph States
332
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We investigate the Bell inequalities derived from the graph states with violations detectable even with the presence of noises, which generalizes the idea of error-correcting Bell inequalities [Phys. Rev. Lett. 101, 080501 (2008)]. Firstly we construct a family of valid Bell inequalities tolerating arbitrary $t$-qubit errors involving $3(t+1)$ qubits, e.g., 6 qubits suffice to tolerate single qubit errors. Secondly we construct also a single-error-tolerating Bell inequality with a violation that increases exponentially with the number of qubits. Exhaustive computer search for optimal error-tolerating Bell inequalities based on graph states on no more than 10 qubits shows that our constructions are optimal for single- and double-error tolerance.
قيم البحث
اقرأ أيضاً
Bell inequalities constitute a key tool in quantum information theory: they not only allow one to reveal nonlocality in composite quantum systems, but, more importantly, they can be used to certify relevant properties thereof. We provide a very simpl
e and intuitive construction of Bell inequalities that are maximally violated by the multiqubit graph states and can be used for their robust self-testing. The main advantage of our inequalities over previous constructions for these states lies in the fact that the number of correlations they contain scales only linearly with the number of observers, which presents a significant reduction of the experimental effort needed to violate them. We also discuss possible generalizations of our approach by showing that it is applicable to entangled states whose stabilizers are not simply tensor products of Pauli matrices.
We introduce a set of Bell inequalities for a three-qubit system. Each inequality within this set is violated by all generalized GHZ states. More entangled a generalized GHZ state is, more will be the violation. This establishes a relation between no
nlocality and entanglement for this class of states. Certain inequalities within this set are violated by pure biseparable states. We also provide numerical evidence that at least one of these Bell inequalities is violated by a pure genuinely entangled state. These Bell inequalities can distinguish between separable, biseparable and genuinely entangled pure three-qubit states. We also generalize this set to n-qubit systems and may be suitable to characterize the entanglement of n-qubit pure states.
Non-trivial facet inequalities play important role in detecting and quantifying the nonolocality of a state -- specially a pure state. Such inequalities are expected to be tight. Number of such inequalities depends on the Bell test scenario. With the
increase in the number of parties, dimensionality of the Hilbert space, or/and the number of measurements, there are more nontrivial facet inequalities. By considering a specific measurement scenario, we find that for any multipartite qubit state, local polytope can have only one nontrivial facet. Therefore there exist a possibility that only one Bell inequality, and its permutations, would be able to detect the nonlocality of a pure state. The scenario involves two dichotomic measurement settings for two parties and one dichotomic measurement by other parties. This measurement scenario for a multipartite state may be considered as minimal scenario involving multipartite correlations that can detect nonlocality. We present detailed results for three-qubit states.
Bell inequalities are important tools in contrasting classical and quantum behaviors. To date, most Bell inequalities are linear combinations of statistical correlations between remote parties. Nevertheless, finding the classical and quantum mechanic
al (Tsirelson) bounds for a given Bell inequality in a general scenario is a difficult task which rarely leads to closed-form solutions. Here we introduce a new class of Bell inequalities based on products of correlators that alleviate these issues. Each such Bell inequality is associated with a unique coordination game. In the simplest case, Alice and Bob, each having two random variables, attempt to maximize the area of a rectangle and the rectangles area is represented by a certain parameter. This parameter, which is a function of the correlations between their random variables, is shown to be a Bell parameter, i.e. the achievable bound using only classical correlations is strictly smaller than the achievable bound using non-local quantum correlations We continue by generalizing to the case in which Alice and Bob, each having now n random variables, wish to maximize a certain volume in n-dimensional space. We term this parameter a multiplicative Bell parameter and prove its Tsirelson bound. Finally, we investigate the case of local hidden variables and show that for any deterministic strategy of one of the players the Bell parameter is a harmonic function whose maximum approaches the Tsirelson bound as the number of measurement devices increases. Some theoretical and experimental implications of these results are discussed.
We introduce Bell inequalities based on covariance, one of the most common measures of correlation. Explicit examples are discussed, and violations in quantum theory are demonstrated. A crucial feature of these covariance Bell inequalities is their n
onlinearity; this has nontrivial consequences for the derivation of their local bound, which is not reached by deterministic local correlations. For our simplest inequality, we derive analytically tight bounds for both local and quantum correlations. An interesting application of covariance Bell inequalities is that they can act as shared randomness witnesses: specifically, the value of the Bell expression gives device-independent lower bounds on both the dimension and the entropy of the shared random variable in a local model.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
