The five-party XOR purification is monogamous for all disjoint subsystems
ProvedQAlgorithms.Papers.Independent.Support50.P46.five_party_xor_monogamyLet A,A′,B,B′,C be five qubit factors in this order, and define
The vector has norm one, its rank-one density matrix is normalized, and its ABC marginal is the equal diagonal mixture of 000,011,101,110. Let U,V,W be any three pairwise disjoint subsets of the five factors; a subset denotes their tensor product and may be empty. Using von Neumann entropy in bits and I₃(U:V:W)=S(U)+S(V)+S(W)−S(UV)−S(UW)−S(VW)+S(UVW), one has
This shows that a pure state may be monogamous on every such triple while possessing the displayed classical ABC marginal.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P46
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P46
open scoped BigOperators ComplexConjugate
open QAlgorithms.Papers.Independent.Gap48.P20 (subsystemEntropy)
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
/-- PDF p.18, (5.14): the displayed normalized five-party pure state has the
classical XOR ABC marginal and obeys monogamy for every triple of disjoint
unions of its five fixed factors, including empty unions. -/
theorem five_party_xor_monogamy :
IsState copiedFiveVector ∧ IsDensityMatrix copiedFiveDensity ∧
threeMarginal copiedFiveDensity ![0, 2, 4] = xorClassical ∧
∀ a b c : Finset (Fin 5),
Disjoint a b → Disjoint a c → Disjoint b c →
tripartiteInformation copiedFiveDensity a b c ≤ 0 := by sorry
end QAlgorithms.Papers.Independent.Support50.P46
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Define a complex vector indexed by five-bit strings by when , , and , and by otherwise; here denotes exclusive-or. Let . The declaration asserts that , that is positive semidefinite with trace , and that its reduced matrix on coordinates has entries when its row and column three-bit strings are equal and their third bit is the exclusive-or of their first two bits, and otherwise; explicitly, this reduced matrix sums over with the prescribed bits on and with on the remaining coordinates. For any coordinate set , define and , using spectral functional calculus with and . For every three pairwise disjoint subsets , the declaration further asserts
The quantified subsets may be empty and need not cover all five coordinates.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.