Difference between revisions of "XORClassicalValue"

Latest revision as of 19:01, 26 June 2015

Redirect to:

XORGameValue

@@ Line 1: / Line 1: @@
-{{Function
+#REDIRECT [[XORGameValue]]
-|name=XORClassicalValue
-|desc=Computes the classical value of a nonlocal binary XOR game
-|rel=[[XORQuantumValue]]
-|cat=[[List of functions#Nonlocality_and_Bell_inequalities|Nonlocality and Bell inequalities]]
-|upd=November 19, 2014
-|v=0.60}}
-<tt>'''XORClassicalValue'''</tt> is a [[List of functions|function]] that computes the classical value of a nonlocal binary XOR game. That is, it computes the optimal probability of two parties (Alice and Bob) winning such a game if they are not allowed to communicate during the game (or do anything "quantum", like share entanglement).
-==Syntax==
-* <tt>WC = XORClassicalValue(P,F)</tt>
-==Argument descriptions==
-* <tt>P</tt>: A matrix whose (s,t)-entry gives the probability that the referee will give Alice the value s and Bob the value t. The sum of all entries of this matrix must be 1.
-* <tt>F</tt>: A binary matrix (of the same size as <tt>P</tt>) whose (s,t)-entry indicates the winning choice (either 0 or 1) when Alice and Bob receive values s and t from the referee.
-==Examples==
-See the [[XORQuantumValue]] function's documentation page for several examples of how to use this function (these two functions are used in the exact same way, and several examples for both functions are provided on that page).
-==Notes==
-Finding the classical value of an XOR game is hard, so this function is only practical when the size of <tt>P</tt> and <tt>F</tt> is about $10 \times 10$ or less (i.e., when the referee of the game gives Alice and Bob one of ten possible questions each).
-{{SourceCode|name=XORClassicalValue}}

Difference between revisions of "XORClassicalValue"

Latest revision as of 19:01, 26 June 2015

Navigation menu

Search