§§3.3–3.3.1: root-fidelity curvature and extension
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.root_fidelity_propertiesAll quantum systems below are finite-dimensional complex Hilbert spaces of positive dimension, and logarithms are binary. A normalized state is positive semidefinite with trace one; a subnormalized state has trace at most one. Marginals are partial traces. Here is squared algebraic fidelity, is squared generalized fidelity, is purified distance, and .
Root algebraic fidelity is jointly concave on positive operators. Squared algebraic fidelity is nondecreasing under CPTP maps and obeys the displayed congruence identity. For subnormalized states, adjoining a vacuum flag of mass 1-Tr rho defines the normalized hat state; generalized fidelity has the displayed hat identity. Its square root is jointly concave, and generalized fidelity is separately concave in each argument.
This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
noncomputable section
open Filter
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P07
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I J A B C D X Y Z : Type*}
variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]
variable [Fintype Z] [DecidableEq Z]
/-- NODE paper:1504.00233#3.fidelityproperties
§§3.3–3.3.1: root-fidelity curvature and extension, arXiv:1504.00233v5, PDF p.44,45,46. -/
theorem root_fidelity_properties [Nonempty I] [Nonempty J] :
(∀ r s t u : paperMat I, r.PosSemidef → s.PosSemidef → t.PosSemidef → u.PosSemidef →
∀ l : ℝ, l ∈ Set.Icc 0 1 → l*rootFidelity r s+(1-l)*rootFidelity t u ≤ rootFidelity (paperMix l r t) (paperMix l s u)) ∧
(∀ E : paperMat I →ₗ[ℂ] paperMat J, paperCPTP E → ∀ r s : paperMat I, r.PosSemidef → s.PosSemidef → paperFidelity r s ≤ paperFidelity (E r) (E s)) ∧
(∀ r s L : paperMat I, r.PosSemidef → s.PosSemidef → paperFidelity (L*r*Lᴴ) s = paperFidelity r (Lᴴ*s*L)) ∧
(∀ r s : paperMat I, paperSubnormalized r → paperSubnormalized s →
paperGeneralizedFidelity r s = paperGeneralizedFidelity (hatState r) (hatState s) ∧ paperGeneralizedFidelity r s = paperFidelity (hatState r) (hatState s)) ∧
(∀ r s t u : paperMat I, paperSubnormalized r → paperSubnormalized s → paperSubnormalized t → paperSubnormalized u →
∀ l : ℝ, l ∈ Set.Icc 0 1 →
l*Real.sqrt (paperGeneralizedFidelity r s)+(1-l)*Real.sqrt (paperGeneralizedFidelity t u) ≤ Real.sqrt (paperGeneralizedFidelity (paperMix l r t) (paperMix l s u))) ∧
(∀ r s t : paperMat I, paperSubnormalized r → paperSubnormalized s → paperSubnormalized t → ∀ l : ℝ, l ∈ Set.Icc 0 1 →
l*paperGeneralizedFidelity r t+(1-l)*paperGeneralizedFidelity s t ≤ paperGeneralizedFidelity (paperMix l r s) t ∧
l*paperGeneralizedFidelity t r+(1-l)*paperGeneralizedFidelity t s ≤ paperGeneralizedFidelity t (paperMix l r s)) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For finite nonempty index types , with decidable equality, define
using spectral functional calculus for matrix square roots. Call subnormalized when it is positive semidefinite and , and write , with zero off-diagonal blocks and one additional coordinate. Then all of the following hold: for every positive semidefinite on and every , ; for every complex-linear map from matrices on to matrices on that is completely positive and satisfies for every matrix , and every positive semidefinite , ; for every positive semidefinite and arbitrary matrix on , ; for every subnormalized , both and ; for every subnormalized and every ,
and for every subnormalized and every , both
Complete positivity here means that applying to each block of any positive semidefinite matrix with any natural number of block indices, including zero, preserves positive semidefiniteness. Zero matrices are allowed among the positive semidefinite and subnormalized inputs, and every interval condition includes and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.