Bell inequalities: what do we know about them and why should cryptographers care?

Authors:
Ronald de Wolf
Affiliations:
CWI and University of Amsterdam, The Netherlands
Venue:
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Year:
2011

Citing 3
Cited 0

Consequences and Limits of Nonlocal Strategies

CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
A quantum bit commitment scheme provably unbreakable by both parties

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Near-Optimal and Explicit Bell Inequality Violations

CCC '11 Proceedings of the 2011 IEEE 26th Annual Conference on Computational Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bell inequalities are linear constraints on the set of output-probabilities of multi-player protocols that are satisfied by all classical (i.e., local realist) protocols, but that can be violated by quantum protocols using entanglement. This talk will survey the history and present state of knowledge regarding such inequalities, with a view to their application in (quantum) cryptography.