3.16
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.purified_metricAll 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 .
P is a metric on all subnormalized states. If P(ρ,σ)^2+P(σ,τ)^2≤1 then P(ρ,τ)≤P(ρ,σ) sqrt(F_(σ,τ))+P(σ,τ) sqrt(F_(ρ,σ)).
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.16
3.16, arXiv:1504.00233v5, PDF p.48. -/
theorem purified_metric [Nonempty I] :
(∀ r s : paperMat I, paperSubnormalized r → paperSubnormalized s →
0 ≤ purified r s ∧ (purified r s = 0 ↔ r = s) ∧ purified r s = purified s r) ∧
(∀ r s t : paperMat I, paperSubnormalized r → paperSubnormalized s → paperSubnormalized t →
purified r t ≤ purified r s+purified s t) ∧
(∀ r s t : paperMat I, paperSubnormalized r → paperSubnormalized s → paperSubnormalized t →
purified r s^2+purified s t^2 ≤ 1 → purified r t ≤ purified r s*Real.sqrt (paperGeneralizedFidelity s t)+
purified s t*Real.sqrt (paperGeneralizedFidelity 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, define, for matrices indexed by ,
using functional calculus for matrix square roots and the total real square-root function for scalar square roots. For every positive semidefinite pair with real traces at most , , if and only if , and . For every positive semidefinite triple , each with real trace at most ,
For every such triple satisfying , the additional bound
holds. These assertions include zero matrices and trace- matrices.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.