Local hidden variable values without optimization procedures
arXiv:2004.00695 · doi:10.22331/q-2023-02-02-911
Abstract
The problem of computing the local hidden variable (LHV) value of a Bell inequality plays a central role in the study of quantum nonlocality. In particular, this problem is the first step towards characterizing the LHV polytope of a given scenario. In this work, we establish a relation between the LHV value of bipartite Bell inequalities and the mathematical notion of excess of a matrix. Inspired by the well developed theory of excess, we derive several results that directly impact the field of quantum nonlocality. We show infinite families of bipartite Bell inequalities for which the LHV value can be computed exactly, without needing to solve any optimization problem, for any number of measurement settings. We also find tight Bell inequalities for a large number of measurement settings.
arXiv comment14 pages. Comments are very welcome! Accepted in Quantum (January 9, 2023)
References in corpus (32)
- Quantum Cryptography
- Bell nonlocality
- Device-independent security of quantum cryptography against collective attacks
- Random Numbers Certified by Bell's Theorem
- No Signalling and Quantum Key Distribution
- Quantum Random Number Generators
- From Bell's Theorem to Secure Quantum Key Distribution
- Fully device independent quantum key distribution
- Experimental measurement-device-independent quantum key distribution
- Substituting Quantum Entanglement for Communication
- Secure device-independent quantum key distribution with causally independent measurement devices
- Free randomness can be amplified
- Private Randomness Expansion With Untrusted Devices
- Simulating quantum many-body dynamics on a current digital quantum computer
- Proof-of-principle demonstration of measurement-device-independent quantum key distribution using polarization qubits
- Guess your neighbour's input: a multipartite non-local game with no quantum advantage
- No quantum advantage for nonlocal computation
- Improving zero-error classical communication with entanglement
- Experimental test of Mermin inequalities on a 5-qubit quantum computer
- Multiparty Quantum Communication Complexity
- Bell inequalities tailored to maximally entangled states
- Classifying 50 years of Bell inequalities
- Device-independent quantum key distribution secure against adversaries with no long-term quantum memory
- Device-independent two-party cryptography secure against sequential attacks
- Five Experimental Tests on the 5-Qubit IBM Quantum Computer
- Qutrit witness from the Grothendieck constant of order four
- Bell nonlocality with a single shot
- Designing Bell inequalities from a Tsirelson bound
- Simple conditions constraining the set of quantum correlations
- Characterising the Performance of XOR Games and the Shannon Capacity of Graphs
- Equiangular tight frames and unistochastic matrices
- All tight correlation Bell inequalities have quantum violations