Pure-state fidelity bound with the support-qualified equality case
OpenQAlgorithms.Papers.Independent.Intakethird100.P21.fidelity_maximizationLet , let sum to one, and let be local unitaries. Put , , and . The squared overlap satisfies
Equality holds exactly when there exists a common complex phase , , such that for every with . With full Schmidt support this is equivalent to .
This supplies the fidelity maximization used in the scalar reduction. The product order and support qualifier correct the printed prose; the inequality retains zero Schmidt probabilities.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P21
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P21
open scoped Matrix ComplexConjugate
open Filter
open QAlgorithms
open QAlgorithms.Papers.Independent.Information100.P03
(PureEnsemble convexRoof pureConcurrence concurrence SchmidtData schmidtVector)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF p.6, (3.6)--(3.7), corrected: V=UA-transpose times UB.
Printed unrestricted equality iff V is scalar fails for zero Schmidt probabilities;
the common phase is required exactly on their positive support. -/
theorem fidelity_maximization (d : ℕ) (hd : 2 ≤ d) (mu : SchmidtProbabilities d)
(UA UB : Matrix.unitaryGroup (Fin d) ℂ) :
let V := (UA : Matrix (Fin d) (Fin d) ℂ)ᵀ * (UB : Matrix (Fin d) (Fin d) ℂ)
maximallyEntangledOverlap (pureDensity (act (Matrix.kronecker (UA : Matrix (Fin d) (Fin d) ℂ)
(UB : Matrix (Fin d) (Fin d) ℂ)) (canonicalVector mu))) = fidelityProfile mu V ∧
fidelityProfile mu V ≤ fidelityProfile mu 1 ∧
(fidelityProfile mu V = fidelityProfile mu 1 ↔
∃ z : ℂ, ‖z‖ = 1 ∧ ∀ k, 0 < mu.probability k → V k k = z) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P21
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , every collection summing to , and every pair of unitary complex matrices , let
Then, with ,
Equality in the displayed inequality holds if and only if there exists a complex number with such that for every with . Zero probabilities are allowed, and the equality condition imposes no diagonal-entry requirement at those indices.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.