Large violation of Bell inequalities with low entanglement
From MaRDI portal
Publication:717112
DOI10.1007/s00220-011-1296-8zbMath1230.81011arXiv1007.3043WikidataQ29010984 ScholiaQ29010984MaRDI QIDQ717112
Marius Junge, Carlos Palazuelos
Publication date: 27 September 2011
Published in: Communications in Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.3043
46C05: Hilbert and pre-Hilbert spaces: geometry and topology (including spaces with semidefinite inner product)
28B05: Vector-valued set functions, measures and integrals
46G10: Vector-valued measures and integration
94A17: Measures of information, entropy
81P40: Quantum coherence, entanglement, quantum correlations
Related Items
Heralded channel Holevo superadditivity bounds from entanglement monogamy, More nonlocality with less entanglement in a tripartite atom‐optomechanical system, Connes' embedding problem and Tsirelson's problem, Grothendieck’s Theorem, past and present, New concise upper bounds on quantum violation of general multipartite Bell inequalities, Explicit lower and upper bounds on the entangled value of multiplayer XOR games, On the largest Bell violation attainable by a quantum state, Three-particle Bell-like inequalities under Lorentz transformations, Classical versus quantum communication in XOR games, Bell's nonlocality in a general nonsignaling case: Quantitatively and conceptually, Analysing nonlocality robustness in multiqubit systems under noisy conditions and weak measurements, Entanglement in non-local games and the hyperlinear profile of groups, Rank-one quantum games, Survey on nonlocal games and operator space theory, Quantum XOR Games, Reducing the number of questions in nonlocal games, Lower bounds on the entanglement needed to play XOR non-local games, Local quasi hidden variable modelling and violations of Bell-type inequalities by a multipartite quantum state, Maximally Entangled State in Pseudo-Telepathy Games, Quantum communication complexity advantage implies violation of a Bell inequality, Quantum Bilinear Optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unbounded violations of bipartite Bell inequalities via operator space theory
- A generalized Grothendieck inequality and nonlocal correlations that require high entanglement
- Perfect parallel repetition theorem for quantum XOR proof systems
- Complexity measures of sign matrices
- Double stochastic integrals, random quadratic forms and random series in Orlicz spaces
- Tensor products of operator spaces
- Bilinear forms on exact operator spaces and \(B(H) \otimes B(H)\)
- Hidden quantum nonlocality revealed by local filters.
- Quantum pseudo-telepathy
- Unbounded violation of tripartite Bell inequalities
- A uniqueness theorem for entanglement measures
- Bell Inequalities for Arbitrarily High-Dimensional Systems
- Near-optimal algorithms for unique games
- Full Security of Quantum Key Distribution From No-Signaling Constraints
- Entangled Games Are Hard to Approximate
- Testing the Dimension of Hilbert Spaces
- From Bell’s Theorem to Secure Quantum Key Distribution
- The Communication Complexity of Non-signaling Distributions
- Quantum Multiprover Interactive Proofs with Communicating Provers
- Mixed-norm inequalities and operator space 𝐿_{𝑝} embedding theory
- On the power of unique 2-prover 1-round games
- Banach spaces with a unique unconditional basis, up to permutation
- Random Fourier Series with Applications to Harmonic Analysis. (AM-101)
- A Parallel Repetition Theorem
- Bell's Inequalities and Density Matrices: Revealing “Hidden” Nonlocality
- The operator Hilbert space 𝑂𝐻, complex interpolation and tensor norms
- Connes' embedding problem and Tsirelson's problem
- Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model
- Unique Games with Entangled Provers Are Easy
- Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
- Lower bounds in communication complexity based on factorization norms
