اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدNew concise upper bounds on quantum violation of general multipartite Bell inequalities
174
0
0.0
(
0
)
تأليف
Elena R. Loubenets
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Last years, bounds on the maximal quantum violation of general Bell inequalities were intensively discussed in the literature via different mathematical tools. In the present paper, we analyze quantum violation of general Bell inequalities via the LqHV (local quasi hidden variable) modelling framework, correctly reproducing the probabilistic description of every quantum correlation scenario. The LqHV mathematical framework allows us to derive for all d and N a new upper bound (2d-1)^{N-1} on the maximal violation by an N-qudit state of all general Bell inequalities, also, new upper bounds on the maximal violation by an N-qudit state of general Bell inequalities for S settings per site. These new upper bounds essentially improve all the known precise upper bounds on quantum violation of general multipartite Bell inequalities. For some S, d and N, the new upper bounds are attainable.
قيم البحث
اقرأ أيضاً
In recent papers, the theory of representations of finite groups has been proposed to analyzing the violation of Bell inequalities. In this paper, we apply this method to more complicated cases. For two partite system, Alice and Bob each make one of
$d$ possible measurements, each measurement has $n$ outcomes. The Bell inequalities based on the choice of two orbits are derived. The classical bound is only dependent on the number of measurements $d$, but the quantum bound is dependent both on $n$ and $d$. Even so, when $d$ is large enough, the quantum bound is only dependent on $d$. The subset of probabilities for four parties based on the choice of six orbits under group action is derived and its violation is described. Restricting the six orbits to three parties by forgetting the last party, and guaranteeing the classical bound invariant, the Bell inequality based on the choice of four orbits is derived. Moreover, all the corresponding nonlocal games are analyzed.
For the optimal success probability under minimum-error discrimination between $rgeq2$ arbitrary quantum states prepared with any a priori probabilities, we find new general analytical lower and upper bounds and specify the relations between these ne
w general bounds and the general bounds known in the literature. We also present the example where the new general analytical bounds, lower and upper, on the optimal success probability are tighter than most of the general analytical bounds known in the literature. The new upper bound on the optimal success probability explicitly generalizes to $r>2$ the form of the Helstrom bound. For $r=2$, each of our new bounds, lower and upper, reduces to the Helstrom bound.
We report on the experimental violation of multipartite Bell inequalities by entangled states of trapped ions. First we consider resource states for measurement-based quantum computation of between 3 and 7 ions and show that all strongly violate a Be
ll-type inequality for graph states, where the criterion for violation is a sufficiently high fidelity. Second we analyze GHZ states of up to 14 ions generated in a previous experiment using stronger Mermin-Klyshko inequalities, and show that in this case the violation of local realism increases exponentially with system size. These experiments represent a violation of multipartite Bell-type inequalities of deterministically prepared entangled states. In addition, the detection loophole is closed.
Secure quantum conferencing refers to a protocol where a number of trusted users generate exactly the same secret key to confidentially broadcast private messages. By a modification of the techniques first introduced in [Pirandola, arXiv:1601.00966],
we derive a single-letter upper bound for the maximal rates of secure conferencing in a quantum network with arbitrary topology, where the users are allowed to perform the most powerful local operations assisted by two-way classical communications, and the quantum systems are routed according to the most efficient multipath flooding strategies. More precisely, our analysis allows us to bound the ultimate rates that are achievable by single-message multiple-multicast protocols, where N senders distribute N independent secret keys, and each key is to be shared with an ensemble of M receivers.
A method for construction of the multipartite Clauser-Horne-Shimony-Holt (CHSH) type Bell inequalities, for the case of local binary observables, is presented. The standard CHSH-type Bell inequalities can be obtained as special cases. A unified frame
work to establish all kinds of CHSH-type Bell inequalities by increasing step by step the number of observers is given. As an application, compact Bell inequalities, for eight observers, involving just four correlation functions are proposed. They require much less experimental effort than standard methods and thus is experimentally friendly in multi-photon experiments.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
