Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userGeometrical Bell inequalities for arbitrarily many qudits with different outcome strategies
111
0
0.0
(
0
)
Added by
Marcin Wie\\'sniak dr hab.
Publication date
2014
fields
Physics
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Greenberger-Horne-Zeilinger states are intuitively known to be the most non-classical ones. They lead to the most radically nonclassical behavior of three or more entangled quantum subsystems. However, in case of two-dimensional systems, it has been shown that GHZ states lead to more robustness of Bell nonclassicality in case of geometrical inequalities than in case of Mermin inequalities. We investigate various strategies of constructing geometrical Bell inequalities (BIs) for GHZ states for any dimensionality of subsystems.
rate research
Read More
Generalizations of the classic Bell inequality to higher dimensional quantum systems known as qudits are reputed to exhibit a higher degree of robustness to noise, but such claims are based on one particular noise model. We analyze the violation of the Collins-Gisin-Linden-Massar-Popescu inequality subject to more realistic noise sources and their scaling with dimension. This analysis is inspired by potential Bell inequality experiments with superconducting resonator-based qudits. We find that the robustness of the inequality to noise generally decreases with increasing qudit dimension.
Quantum sorter has gained a lot of attention during the last years due to its wide application in quantum information processing and quantum technologies. A challenging task is the construction of a quantum sorter, which collect many high-dimensional quantum systems, which are simultaneously incident on different input ports of the device. In this paper we give the definition of the general quantum sorter of multi-level quantum systems. We prove the impossibility of the construction of the perfect quantum sorter, which works for many particles incident on any input port, while keeping their states unmodified. Further we propose an approximate multi-particle multi-input-port quantum sorter, which performs the selection of the particles in a certain output port according to the properties of the initial states, but changing the final states. This method is useful for those situations which require high speed of quantum state sorting. Thus, the information contained in the initial states of the particles is revealed by the click statistics of the detectors situated in each output port.
Finding all Bell inequalities for a given number of parties, measurement settings, and measurement outcomes is in general a computationally hard task. We show that all Bell inequalities which are symmetric under the exchange of parties can be found by examining a symmetrized polytope which is simpler than the full Bell polytope. As an illustration of our method, we generate 238885 new Bell inequalities and 1085 new Svetlichny inequalities. We find, in particular, facet inequalities for Bell experiments involving two parties and two measurement settings that are not of the Collins-Gisin-Linden-Massar-Popescu type.
We introduce two types of statistical quasi-separation between local observables to construct two-party Bell-type inequalities for an arbitrary dimensional systems and arbitrary number of measurement settings per site. Note that, the main difference between statistical quasi-separations and the usual statistical separations is that the former are not symmetric under exchange of the two local observables, whereas latter preserve the symmetry. We show that a variety of Bell inequalities can be derived by sequentially applying triangle inequalities which statistical quasi-separations satisfy. A sufficient condition is presented to show quantum violations of the Bell-type inequalities with infinitesimal values of critical visibility $v_c$.
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 mechanical (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.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
