اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMinimum quantum resources for strong non-locality
69
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We analyse the minimum quantum resources needed to realise strong non-locality, as exemplified e.g. by the classical GHZ construction. It was already known that no two-qubit system, with any finite number of local measurements, can realise strong non-locality. For three-qubit systems, we show that strong non-locality can only be realised in the GHZ SLOCC class, and with equatorial measurements. However, we show that in this class there is an infinite family of states which are pairwise non-LU-equivalent that realise strong non-locality with finitely many measurements. These states have decreasing entanglement between one qubit and the other two, necessitating an increasing number of local measurements on the latter.
قيم البحث
اقرأ أيضاً
Non-contextuality (NC) and Bell inequalities can be expressed as bounds $Omega$ for positive linear combinations $S$ of probabilities of events, $S leq Omega$. Exclusive events in $S$ can be represented as adjacent vertices of a graph called the excl
usivity graph of $S$. In the case that events correspond to the outcomes of quantum projective measurements, quantum probabilities are intimately related to the Grotschel-Lovasz-Schrijver theta body of the exclusivity graph. Then, one can easily compute an upper bound to the maximum quantum violation of any NC or Bell inequality by optimizing $S$ over the theta body and calculating the Lovasz number of the corresponding exclusivity graph. In some cases, this upper bound is tight and gives the exact maximum quantum violation. However, in general, this is not the case. The reason is that the exclusivity graph does not distinguish among the different ways exclusivity can occur in Bell-inequality (and similar) scenarios. An interesting question is whether there is a graph-theoretical concept which accounts for this problem. Here we show that, for any given $N$-partite Bell inequality, an edge-coloured multigraph composed of $N$ single-colour graphs can be used to encode the relationships of exclusivity between each partys parts of the events. Then, the maximum quantum violation of the Bell inequality is exactly given by a refinement of the Lovasz number that applies to these edge-coloured multigraphs. We show how to calculate upper bounds for this number using a hierarchy of semi-definite programs and calculate upper bounds for $I_3$, $I_{3322}$ and the three bipartite Bell inequalities whose exclusivity graph is a pentagon. The multigraph-theoretical approach introduced here may remove some obstacles in the program of explaining quantum correlations from first principles.
It is shown that the possibility of using Maxwell demon to cheating in quantum non-locality tests is prohibited by the Landauers erasure principle.
Oblivious transfer, a central functionality in modern cryptography, allows a party to send two one-bit messages to another who can choose one of them to read, remaining ignorant about the other, whereas the sender does not learn the receivers choice.
Oblivious transfer the security of which is information-theoretic for both parties is known impossible to achieve from scratch. - The joint behavior of certain bi-partite quantum states is non-local, i.e., cannot be explained by shared classical information. In order to better understand such behavior, which is classically explainable only by communication, but does not allow for it, Popescu and Rohrlich have described a non-locality machine: Two parties both input a bit, and both get a random output bit the XOR of which is the AND of the input bits. - We show a close connection, in a cryptographic sense, between OT and the PR primitive. More specifically, unconditional OT can be achieved from a single realization of PR, and vice versa. Our reductions, which are single-copy, information-theoretic, and perfect, also lead to a simple and optimal protocol allowing for inverting the direction of OT.
We introduce and discuss a set of tunable two-mode states of continuous-variable systems, as well as an efficient scheme for their experimental generation. This novel class of tunable entangled resources is defined by a general ansatz depending on tw
o experimentally adjustable parameters. It is very ample and flexible as it encompasses Gaussian as well as non-Gaussian states. The latter include, among others, known states such as squeezed number states and de-Gaussified photon-added and photon-subtracted squeezed states, the latter being the most efficient non-Gaussian resources currently available in the laboratory. Moreover, it contains the classes of squeezed Bell states and even more general non-Gaussian resources that can be optimized according to the specific quantum technological task that needs to be realized. The proposed experimental scheme exploits linear optical operations and photon detections performed on a pair of uncorrelated two--mode Gaussian squeezed states. The desired non-Gaussian state is then realized via ancillary squeezing and conditioning. Two independent, freely tunable experimental parameters can be exploited to generate different states and to optimize the performance in implementing a given quantum protocol. As a concrete instance, we analyze in detail the performance of different states considered as resources for the realization of quantum teleportation in realistic conditions. For the fidelity of teleportation of an unknown coherent state, we show that the resources associated to the optimized parameters outperform, in a significant range of experimental values, both Gaussian twin beams and photon-subtracted squeezed states.
Quantum pseudo-telepathy is an intriguing phenomenon which results from the application of quantum information theory to communication complexity. To demonstrate this phenomenon researchers in the field of quantum communication complexity devised a n
umber of quantum non-locality games. The setting of these games is as follows: the players are separated so that no communication between them is possible and are given a certain computational task. When the players have access to a quantum resource called entanglement, they can accomplish the task: something that is impossible in a classical setting. To an observer who is unfamiliar with the laws of quantum mechanics it seems that the players employ some sort of telepathy; that is, they somehow exchange information without sharing a communication channel. This paper provides a formal framework for specifying, implementing, and analysing quantum non-locality games.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
