Rank-one domination and inverse pairing
OpenQAlgorithms.Papers.Independent.Intakenext100.P98.rankOne_domination_iff_inversePairingprove2quantum
Let , , , and let be any vector. For every positive definite operator ,
No normalization of is required, and positive definiteness ensures the inverse is the ordinary inverse. This equivalence converts a rank-one operator constraint into a scalar constraint for the fidelity dual program.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P98
Formal statement
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Intakenext100.P98
/-- PDF p.14, Proposition 8: positive definiteness guards the inverse. At v=0
both conditions hold. The proposition needs no correction to its statement. -/
theorem rankOne_domination_iff_inversePairing {m r : ℕ} (hm : 0 < m) (hr : 0 < r)
(v : EuclideanSpace ℂ (Fin m × Fin r)) (Z : (Matrix (Fin r) (Fin r) ℂ)) (hZ : Z.PosDef) :
(unitTensor m Z - pureDensity v).PosSemidef ↔
realTracePairing (traceLeft (pureDensity v)) Z⁻¹ ≤ 1 := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P98
end
Source
Semidefinite programs for completely bounded norms, arXiv:0901.4709v2, PDF p. 14, Proposition 8 (rank-one domination and inverse pairing)
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For positive natural numbers , any vector , and any positive definite matrix , let and define by . Then
where denotes conjugate transpose, means positive semidefinite, and is the matrix inverse. The vector is unrestricted and may be zero or unnormalized.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.