اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدQuantum Bell Inequalities from Macroscopic Locality
144
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We propose a method to generate analytical quantum Bell inequalities based on the principle of Macroscopic Locality. By imposing locality over binary processings of virtual macroscopic intensities, we establish a correspondence between Bell inequalities and quantum Bell inequalities in bipartite scenarios with dichotomic observables. We discuss how to improve the latter approximation and how to extend our ideas to scenarios with more than two outcomes per setting.
قيم البحث
اقرأ أيضاً
Quantum generalizations of Bell inequalities are analytical expressions of correlations observed in the Bell experiment that are used to explain or estimate the set of correlations that quantum theory allows. Unlike standard Bell inequalities, their
quantum analogs are rare in the literature, as no known algorithm can be used to find them systematically. In this work, we present a family of quantum Bell inequalities in scenarios where the number of settings or outcomes can be arbitrarily high. We derive these inequalities from the principle of Information Causality, and thus, we do not assume the formalism of quantum mechanics. Considering the symmetries of the derived inequalities, we show that the latter give the necessary and sufficient condition for the correlations to comply with Macroscopic Locality. As a result, we conclude that the principle of Information Causality is strictly stronger than the principle of Macroscopic Locality in the subspace defined by these symmetries.
Understanding the limits of quantum theory in terms of uncertainty and correlation has always been a topic of foundational interest. Surprisingly this pursuit can also bear interesting applications such as device-independent quantum cryptography and
tomography or self-testing. Building upon a series of recent works on the geometry of quantum correlations, we are interested in the problem of computing quantum Bell inequalities or the boundary between quantum and post-quantum world. Better knowledge of this boundary will lead to more efficient device-independent quantum processing protocols. We show that computing quantum Bell inequalities is an instance of a quantifier elimination problem, and apply these techniques to the bipartite scenario in which each party can have three measurement settings. Due to heavy computational complexity, we are able to obtain the characterization of certain linear relaxation of the quantum set for this scenario. The resulting quantum Bell inequalities are shown to be equivalent to the Tsirelson-Landau-Masanes arcsin inequality, which is the only type of quantum Bell inequality found since 1987.
Bell inequality with self-testing property has played an important role in quantum information field with both fundamental and practical applications. However, it is generally challenging to find Bell inequalities with self-testing property for multi
partite states and actually there are not many known candidates. In this work, we propose a systematical framework to construct Bell inequalities from stabilizers which are maximally violated by general stabilizer states, with two observables for each local party. We show that the constructed Bell inequalities can self-test any stabilizer state which is essentially device-independent, if and only if these stabilizers can uniquely determine the state in a device-dependent manner. This bridges the gap between device-independent and device-dependent verification methods. Our framework can provide plenty of Bell inequalities for self-testing stabilizer states. Among them, we give two families of Bell inequalities with different advantages: (1) a family of Bell inequalities with a constant ratio of quantum and classical bounds using 2N correlations, (2) Single pair inequalities improving on all previous robustness self-testing bounds using N+1 correlations, which are both efficient and suitable for realizations in multipartite systems. Our framework can not only inspire more fruitful multipartite Bell inequalities from conventional verification methods, but also pave the way for their practical applications.
The question of how large Bell inequality violations can be, for quantum distributions, has been the object of much work in the past several years. We say that a Bell inequality is normalized if its absolute value does not exceed 1 for any classical
(i.e. local) distribution. Upper and (almost) tight lower bounds have been given for the quantum violation of these Bell inequalities in terms of number of outputs of the distribution, number of inputs, and the dimension of the shared quantum states. In this work, we revisit normalized Bell inequalities together with another family: inefficiency-resistant Bell inequalities. To be inefficiency-resistant, the Bell value must not exceed 1 for any local distribution, including those that can abort. This makes the Bell inequality resistant to the detection loophole, while a normalized Bell inequality is resistant to general local noise. Both these families of Bell inequalities are closely related to communication complexity lower bounds. We show how to derive large violations from any gap between classical and quantum communication complexity, provided the lower bound on classical communication is proven using these lower bound techniques. This leads to inefficiency-resistant violations that can be exponential in the size of the inputs. Finally, we study resistance to noise and inefficiency for these Bell inequalities.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
