# Large Violation of Bell Inequalities with Low Entanglement

@article{Junge2011LargeVO,
title={Large Violation of Bell Inequalities with Low Entanglement},
author={Marius Junge and Carlos Palazuelos},
journal={Communications in Mathematical Physics},
year={2011},
volume={306},
pages={695-746}
}
• Published 18 July 2010
• Mathematics
• Communications in Mathematical Physics
In this paper we obtain violations of general bipartite Bell inequalities of order $${\frac{\sqrt{n}}{\log n}}$$ with n inputs, n outputs and n-dimensional Hilbert spaces. Moreover, we construct explicitly, up to a random choice of signs, all the elements involved in such violations: the coefficients of the Bell inequalities, POVMs measurements and quantum states. Analyzing this construction we find that, even though entanglement is necessary to obtain violation of Bell inequalities, the…
Tightness of correlation inequalities with no quantum violation
• Mathematics
• 2017
We study the faces of the set of quantum correlations, i.e., the Bell and noncontextuality inequalities without any quantum violation. First, we investigate the question of whether every proper
Family of Bell inequalities violated by higher-dimensional bound entangled states
• Mathematics
• 2017
We construct ($d\times d$)-dimensional bound entangled states, which violate, for any $d>2$, a bipartite Bell inequality introduced in this paper. We conjecture that the proposed class of Bell
Evaluating the Maximal Violation of the Original Bell Inequality by Two-Qudit States Exhibiting Perfect Correlations/Anticorrelations
• Physics
Entropy
• 2018
It is proved that, for all states from this class, the maximal violation of the original Bell inequality is upper bounded by 32 and specify the two-qubit states where this quantum upper bound is attained.
Optimization of Bell inequalities with invariant Tsirelson bound
• Mathematics
• 2014
We consider a subclass of bipartite CHSH-type Bell inequalities. We investigate operations which leave their Tsirelson bound invariant, but change their classical bound. The optimal observables are
Near-Optimal and Explicit Bell Inequality Violations
• Computer Science
Theory Comput.
• 2012
Two new two-player games with Bell inequality violations that are stronger, fully explicit, and arguably simpler than earlier work are given.
Robust Bell Inequalities from Communication Complexity
• Economics
TQC
• 2016
This work revisits normalized Bell inequalities together with another family: inefficiency-resistant Bell inequalities, and shows how to derive large violations from any gap between classical and quantum communication complexity, provided the lower bound on classical communication is proven using lower bound techniques.
Near-Optimal and Explicit Bell Inequality Violations
• Physics
2011 IEEE 26th Annual Conference on Computational Complexity
• 2011
Two new two-player games with Bell inequality violations that are stronger, fully explicit, and arguably simpler than earlier work are given.
Unbounded Bell violations for quantum genuine multipartite non-locality
• Physics
Journal of Physics A: Mathematical and Theoretical
• 2020
The violations of Bell inequalities by measurements on quantum states give rise to the phenomenon of quantum non-locality and express the advantage of using quantum resources over classical ones for
The Essence of More Nonlocality with Less Entanglement in Bell Tests
• Physics
• 2014
In this paper, we will explore the essence of the phenomenon that state with less entanglement may generate greater Bell violation in the two-qubit Bell tests with CH-type inequalities, i.e., more

## References

SHOWING 1-10 OF 89 REFERENCES
Unbounded Violations of Bipartite Bell Inequalities via Operator Space Theory
• Mathematics
• 2010
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 $${{\rm \Omega} \left(\frac{\sqrt{n}}{\log^2n} \right)}$$
Unbounded Violation of Tripartite Bell Inequalities
• Mathematics
• 2007
We prove that there are tripartite quantum states (constructed from random unitaries) that can lead to arbitrarily large violations of Bell inequalities for dichotomic observables. As a consequence
Bounds on quantum correlations in Bell-inequality experiments
• Physics
• 2007
Bell-inequality violation is one of the most widely known manifestations of entanglement in quantum mechanics; indicating that experiments on physically separated quantum mechanical systems cannot be
A generalized Grothendieck inequality and entanglement in XOR games
• Mathematics
• 2009
Suppose Alice and Bob make local two-outcome measurements on a shared entangled state. For any d, we show that there are correlations that can only be reproduced if the local dimension is at least d.
Quantum nonlocality in two three-level systems
• Physics
• 2002
Recently a new Bell inequality has been introduced (CGLMP,KKCZO) that is strongly resistant to noise for maximally entangled states of two d-dimensional quantum systems. We prove that a larger
An anomaly of non-locality
• Physics
Quantum Inf. Comput.
• 2007
This work reviews the present knowledge on this anomaly, points out that Hardy's theorem has the same feature, and discusses the perspectives opened by these discoveries.
Bell inequalities and entanglement
• Physics
Quantum Inf. Comput.
• 2001
The relation between Bell inequality violations and entanglement properties currently discussed in quantum information theory is discussed and maximal violations of Bell inequalities as well as states not violating (certain) Bell inequalities are investigated.
Lower bound on the dimension of a quantum system given measured data
• Computer Science
• 2008
A simple lower bound for the dimension of the Hilbert space is proved for the construction of quantum random access codes, for which interesting bounds on the Hilbertspace dimension already exist.
The Quantum Moment Problem and Bounds on Entangled Multi-prover Games
• Mathematics
2008 23rd Annual IEEE Conference on Computational Complexity
• 2008
It is proved that a hierarchy of semidefinite programs similar to the one given by Navascues, Pironioand Acin converges to the entangled value of the game and it would follow that the languages recognized by a multi-prover interactive proof system where the provers share entanglement are recursive.