3.11
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.fidelity_separatelyConcaveAll 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 .
Squared algebraic fidelity is concave in either positive-operator argument separately.
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.11
3.11, arXiv:1504.00233v5, PDF p.45. -/
theorem fidelity_separatelyConcave [Nonempty I] (r s t : paperMat I) (hr : r.PosSemidef) (hs : s.PosSemidef) (ht : t.PosSemidef)
(a : ℝ) (ha : a ∈ Set.Icc 0 1) :
a*paperFidelity r t+(1-a)*paperFidelity s t ≤ paperFidelity (paperMix a r s) t ∧
a*paperFidelity t r+(1-a)*paperFidelity t s ≤ paperFidelity t (paperMix a 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 every finite nonempty index type with decidable equality, positive semidefinite complex matrices indexed by , and real , define
where the matrix square roots are obtained by functional calculus using the real square-root function. Then both inequalities
hold. The matrices need not have trace or trace at most , and zero matrices and the endpoints are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.