OFFSET
0,1
COMMENTS
A referee chooses two random bits and gives one to each of two players who share an entangled quantum state but are not permitted to communicate. The players each choose a bit to send to the referee. If both of the bits from the referee are 1, then the players win if their chosen bits are different; otherwise they win if their chosen bits are the same. The best classical win probability is 3/4, but this can be improved in a quantum setting.
The optimality of this probability follows from Tsirelson's inequality and is implicit in the CHSH paper.
Ratio of leg length to base length in an isosceles triangle with the property that the areas of the two smaller excircles sum up to the area of the third excircle. - Martin Janecke, Aug 05 2012
LINKS
J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt, Proposed Experiment to Test Local Hidden-Variable Theories, Phys. Rev. Lett. 23 (1969), pp. 880-884.
Claude Crépeau, Louis Salvail, Jean-Raymond Simard, and Alain Tapp, Classical and quantum strategies for two-prover bit commitments, Ninth Workshop on Quantum Information Processing (2006).
Erica Klarreich, The Proof in the Quantum Pudding, Quanta Magazine, 21 Aug 2013.
Stephen J. Summers and Reinhard Werner, The vacuum violates Bell's inequalities, Physics Letters A 110:5 (1985), pp. 257-259.
Wikipedia, CHSH inequality
Wikipedia, Quantum pseudo-telepathy
Wikipedia, Tsirelson's bound
FORMULA
Equals cos^2(Pi/8) = (1 + 1/sqrt(2))/2.
Equals (theta_3(0, q^2)/theta_3(0, q))^2 where q = 1/e^Pi. - Michael Somos, Dec 02 2022
EXAMPLE
0.853553390593273762200422181052424519642417968844237...
MATHEMATICA
RealDigits[Cos[Pi/8]^2, 10, 120][[1]] (* Harvey P. Dale, Jan 21 2012 *)
PROG
(PARI) cos(Pi/8)^2 \\ Charles R Greathouse IV, Dec 02 2011
CROSSREFS
KEYWORD
AUTHOR
Charles R Greathouse IV, Dec 02 2011
STATUS
approved