tensor-distance-fidelity: Trace-norm tensor perturbation≤sum of factor perturbations; overlap infidelity of tensor products≤sum of factor overlap infideliti
ProvedQAlgorithms.Papers.Independent.Renew46.P43.tensorPerturbationprove2quantum
Let be normalized states on one finite system and normalized states on another. The norm is the unhalved trace norm and the fidelity is overlap .
This is the source result with its stated operational or information-theoretic domain.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
Formal statement
noncomputable section
namespace QAlgorithms.Papers.Independent.Renew46.P43
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator
open Filter MeasureTheory
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
open QAlgorithms.Papers.Independent.Information100.P06 (Below)
open QAlgorithms.Papers.Independent.Information100.P60 (copies relativeBits)
open QAlgorithms.Papers.Independent.Dependency50.P19 (count both)
open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Unnumbered tensor inequalities, PDF p.8. All four factors are normalized. -/
theorem tensorPerturbation {I J : Type*} [Fintype I] [Fintype J] [DecidableEq I] [DecidableEq J]
(rho1 sigma1 : Matrix I I ℂ) (rho2 sigma2 : Matrix J J ℂ)
(hrho1 : IsDensityMatrix rho1) (hsigma1 : IsDensityMatrix sigma1)
(hrho2 : IsDensityMatrix rho2) (hsigma2 : IsDensityMatrix sigma2) :
traceNorm (Matrix.kronecker rho1 rho2 - Matrix.kronecker sigma1 sigma2) ≤
traceNorm (rho1 - sigma1) + traceNorm (rho2 - sigma2) ∧
1 - effectProb (Matrix.kronecker rho1 rho2) (Matrix.kronecker sigma1 sigma2) ≤
(1 - effectProb rho1 sigma1) + (1 - effectProb rho2 sigma2) := by sorry
end QAlgorithms.Papers.Independent.Renew46.P43
end
Source
Coding Theorems of Quantum Information Theory, arXiv:quant-ph/9907077v1, PDF p. 8, tensor-distance-fidelity
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For any finite types , each equipped with decidable equality, let be complex matrices indexed by , and let be complex matrices indexed by . Assume all four matrices are positive semidefinite and have trace . Writing , where the square root is defined by functional calculus, both inequalities hold:
and
If either indexing type is empty, its trace-one hypotheses cannot be satisfied.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.