A classical bit can be shared among any finite positive number of parties
ProvedQAlgorithms.Papers.Independent.Intakethird100.P06.classicalBit_unlimitedSharingLet and let be an integer. Give the all-zero string in probability and the all-one string probability , with zero probability elsewhere. Writing this law as , it is nonnegative and normalized, and for every party and bit ,
Thus every party has the prescribed classical bit and all parties agree with certainty, for every finite positive party count. Deterministic bits and are included.
This is the classical comparison with the non-shareability of coherent EPR entanglement. The parameter denotes the probability of zero.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P06
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P06
open scoped BigOperators
open QAlgorithms.Papers.Independent.Dependency50.P33 (NuclearExpansion)
open QAlgorithms.Papers.Independent.Frontier18.P09 (partialTraceRightCoeff)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Section II, arXiv:quant-ph/0307120v1, PDF p.5: every Bernoulli bit
can be shared among every finite positive number of parties. The constructed
law is normalized, has the specified marginal at each party, and gives perfect
agreement. Deterministic p=0 and p=1 are included. -/
theorem classicalBit_unlimitedSharing (p : ℝ) (hp0 : 0 ≤ p) (hp1 : p ≤ 1)
(n : ℕ) (hn : 1 ≤ n) :
(∀ x, 0 ≤ sharedBitLaw n p x) ∧
(∑ x : Fin n → Bool, sharedBitLaw n p x) = 1 ∧
(∀ (i : Fin n) (b : Bool),
(∑ x : Fin n → Bool, if x i = b then sharedBitLaw n p x else 0) =
if b then 1 - p else p) ∧
(∑ x : Fin n → Bool,
if ∀ i j : Fin n, x i = x j then sharedBitLaw n p x else 0) = 1 := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P06
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real with and every natural number , define for Boolean strings of length . Then for every , , and for every coordinate and every Boolean , when is true and equals when is false. Moreover, . The endpoints and and the case are included; is excluded by the hypothesis.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.