Three-copy formula for the state-dependent second moment
OpenQAlgorithms.Papers.Independent.Intakethird100.P71.shadowSecondMoment_threeCopiesConsider the fixed projective experiment on qudits, , with locally conjugation-invariant prior and invertible channel . Let be a density matrix and a traceless Hermitian observable. Put , , and . For , let permute the three copies independently at each site and . Then
The Weingarten coefficient is the product of the local three-copy coefficients. At the usual spectral extension omits the three-row partition instead of inverting a singular Gram matrix. The equality is expressed over to retain the individual permutation traces. This is a state-dependent second moment, not a worst-state supremum.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P71
noncomputable section
open MeasureTheory
open scoped Matrix ComplexConjugate ENNReal Matrix.Norms.Elementwise
namespace QAlgorithms.Papers.Independent.Intakethird100.P71
attribute [local instance] Classical.propDecidable
local notation "Config" n:max d:max =>
QAlgorithms.Papers.Independent.Information100.P21.Config (P := Fin n) (fun _ => d)
local notation "Op" n:max d:max =>
QAlgorithms.Papers.Independent.Information100.P21.Op (Config n d)
attribute [local instance] QAlgorithms.Papers.Independent.Intakethird100.P71.matrixContinuousENorm
local notation "Unitary" n:max d:max => Matrix.unitaryGroup (Config n d) ℂ
local notation "Local" n:max d:max => Fin n → Matrix.unitaryGroup (Fin d) ℂ
open QAlgorithms.Papers.Independent.Information100.P63 (tensorPower)
/-- PDF pp.4–5 Eqs.(14)–(17): the state-dependent second moment in (S_3)^N.
For qubits wgThree uses its spectral extension at the singular Gram matrix. -/
theorem shadowSecondMoment_threeCopies {n d : ℕ} (hd : 2 ≤ d) (E : ProjectiveEnsemble n d)
(hls : LocallyScrambled (prior E)) (hc : Complete (prior E))
(rho O : Op n d) (hrho : IsDensityMatrix rho) (hO : O.IsHermitian) (ht : O.trace = 0) :
shotVariance (prior E) hc rho O ≤ secondMoment (prior E) hc rho O ∧
(secondMoment (prior E) hc rho O : ℂ) =
∑ g : Permutations n 3, ∑ h : Permutations n 3,
observableThree (prior E) hc rho O g * (productWgThree d g h : ℂ) *
featureThree (prior E) h := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P71
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let and , put and , and let supply a probability law on global unitary matrices. Define . Assume that is invariant under for every with all unitary. Define , assume is injective, and write . Let be positive semidefinite with trace , and let be Hermitian with trace exactly . Define , ,
For with permutations of , let be the matrix indexed by triples of configurations whose -entry is precisely when for every , and is otherwise. For a permutation of three elements, put and
Define , , and , where tensor coordinates list the three copies first. The theorem states
with the second equality interpreted in by embedding the real number . The case is included, with empty products equal to .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.