Lemma 7 — monogamy in : over any set of neighbours of
ProvedQMCTriFree.Circuit.lemma_7lasserremonogamyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-max-cut
Let be feasible for and let be its edge values. For every vertex and every set of neighbours of ,
The relaxation "knows about" monogamy of entanglement: the edges of a star cannot all be close to the singlet. This bound, through Corollary 8, controls how much the rotations of neighbouring edges cost.
Formalization Note Only the -part is stated (the -part concerns the EPR Hamiltonian). Neighbours of are vertices with ; no other property of is assumed.
Preamble
import Mathlib import Definitions.Def_QMCTriFree_Circuit_Lasserre set_option autoImplicit false open QMCProduct.HalfApprox Matrix MeasureTheory ProbabilityTheory
Formal statement
namespace QMCTriFree.Circuit
/-- King, arXiv:2209.02589v3, p. 7, Lemma 7 (the `x` part): for every feasible `M` of
`Lasserre_2(H)`, every vertex `i` and every set `S` of neighbours of `i`, `∑_{j∈S} x_ij ≤ 1`. -/
theorem lemma_7 {n : ℕ} (w : Fin n → Fin n → ℝ) (M : Matrix (P2 n) (P2 n) ℝ)
(hM : IsFeasible M) (i : Fin n) (S : Finset (Fin n)) (hS : S ⊆ nbrs w i) :
∑ j ∈ S, xval M i j ≤ 1 := by sorry
end QMCTriFree.Circuit
Source
King, An Improved Approximation Algorithm for Quantum Max-Cut on Triangle-Free Graphs, arXiv:2209.02589v3, p. 7, Lemma 7
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.