No Arabic abstract
In this work we show that bipartite quantum states with local Hilbert space dimension n can violate a Bell inequality by a factor of order $sqrt{n}$ (up to a logarithmic factor) when observables with n possible outcomes are used. A central tool in the analysis is a close relation between this problem and operator space theory and, in particular, the very recent noncommutative $L_p$ embedding theory. As a consequence of this result, we obtain better Hilbert space dimension witnesses and quantum violations of Bell inequalities with better resistance to noise.
In this letter we show that the field of Operator Space Theory provides a general and powerful mathematical framework for arbitrary Bell inequalities, in particular regarding the scaling of their violation within quantum mechanics. We illustrate the power of this connection by showing that bipartite quantum states with local Hilbert space dimension n can violate a Bell inequality by a factor of order $frac{sqrt{n}}{log^2n}$ when observables with n possible outcomes are used. Applications to resistance to noise, Hilbert space dimension estimates and communication complexity are given.
In this paper we introduce a simple and natural bipartite Bell scenario, by considering the correlations between two parties defined by general measurements in one party and dichotomic ones in the other. We show that unbounded Bell violations can be obtained in this context. Since such violations cannot occur when both parties use dichotomic measurements, our setting can be considered as the simplest one where this phenomenon can be observed. Our example is essentially optimal in terms of the outputs and the Hilbert space dimension.
For any finite number of parts, measurements and outcomes in a Bell scenario we estimate the probability of random $N$-qu$d$it pure states to substantially violate any Bell inequality with uniformly bounded coefficients. We prove that under some conditions on the local dimension the probability to find any significant amount of violation goes to zero exponentially fast as the number of parts goes to infinity. In addition, we also prove that if the number of parts is at least 3, this probability also goes to zero as the the local Hilbert space dimension goes to infinity.
Quantum entanglement plays a vital role in many quantum information and communication tasks. Entangled states of higher dimensional systems are of great interest due to the extended possibilities they provide. For example, they allow the realisation of new types of quantum information schemes that can offer higher information-density coding and greater resilience to errors than can be achieved with entangled two-dimensional systems. Closing the detection loophole in Bell test experiments is also more experimentally feasible when higher dimensional entangled systems are used. We have measured previously untested correlations between two photons to experimentally demonstrate high-dimensional entangled states. We obtain violations of Bell-type inequalities generalised to d-dimensional systems with up to d = 12. Furthermore, the violations are strong enough to indicate genuine 11-dimensional entanglement. Our experiments use photons entangled in orbital angular momentum (OAM), generated through spontaneous parametric down-conversion (SPDC), and manipulated using computer controlled holograms.
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.