Exact GHZ strengths and optimal sampling laws
OpenQAlgorithms.Papers.Independent.Intakethird100.P80.ghz_strengthUse the fixed GHZ experiment of Appendix III-F. On settings , four allowed parity outcomes have probability each: the number of outcomes is odd at and even at the other three settings. At all other settings every outcome has probability . Let sample all eight settings uniformly and let assign probability to each of the four parity settings.
The uniform law is optimal among product setting laws, while is optimal among all setting laws, and
A single local law realizes Table XXIX at every setting: its probabilities at a parity setting are on allowed outcomes and on the others, and are at other settings. This law is optimal for both displayed setting laws.
The four settings and the masses follow Table XXVIII and equation (35); the p.24 prose mistakenly prints and an even number of setting-1 measurements. This statement corrects those two typos and makes no factor-4.5 comparison.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P80
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P80
open scoped BigOperators ENNReal Topology Classical
open MeasureTheory Filter
/-- PDF pp.8,17,21,24: exact GHZ optima, optimal setting laws and a common realizing
local law for Table XXIX. The p.24 prose typos are corrected as documented above.
No equality or literal lower bound with the factor 4.5 is claimed. -/
theorem ghz_strength :
ghzCorrelatedSettings ∈ stdSimplex ℝ (Settings GHZScenario) ∧
Uncorrelated (uniformSettings GHZScenario) ∧
uniformStrength ghzTable = uncorrelatedStrength ghzTable ∧
uncorrelatedStrength ghzTable = ENNReal.ofReal (Real.logb 2 (4 / 3) / 2) ∧
lowerValue ghzTable ghzCorrelatedSettings = correlatedStrength ghzTable ∧
correlatedStrength ghzTable = ENNReal.ofReal (Real.logb 2 (4 / 3)) ∧
∃ p : PiLocal GHZScenario, localTable p.1 = ghzLocalTable ∧
statisticalPayoff ghzTable (uniformSettings GHZScenario) p.1 = uniformStrength ghzTable ∧
statisticalPayoff ghzTable ghzCorrelatedSettings p.1 = correlatedStrength ghzTable := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P80
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Consider three parties, each with settings and outcomes in . Let be the setting space, and let consist of assignments for every party and setting . Denote the probability simplices on these spaces by , and let consist of distributions factoring into three single-party setting distributions. A setting is constrained when is or ; an outcome is allowed when is if and is otherwise. Define to be for allowed outcomes at constrained settings, for other outcomes at constrained settings, and at unconstrained settings. Define to be for allowed outcomes at constrained settings, for other outcomes at constrained settings, and at unconstrained settings. Put and let at constrained settings and otherwise. For , set . Define using the joint functions and : it is if some has , and otherwise it is the nonnegative part of , with every summand having replaced by . All these values lie in . Set , , and . The declaration asserts that , that factors as for some probability vectors on , and that
It also asserts the existence of such that , , and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.