Jordan decomposition of the difference of two density matrices
ProvedQAlgorithms.Papers.Independent.Support50.P17.exists_jordan_decompositionprove2quantum
Let be density matrices (positive semidefinite, trace one) on a finite-dimensional complex Hilbert space and let be their trace distance. Then there are positive semidefinite operators such that
- ;
- ;
- .
Here are the positive and negative parts of the Hermitian operator ; the last item holds because and have orthogonal supports and each has operator norm at most its trace . This decomposition is the standard first step in continuity estimates phrased via trace distance.
Formalization Note is the frozen traceDistance ; traces are complex numbers and is cast to .
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P17 noncomputable section open MeasureTheory open scoped Matrix ComplexOrder Matrix.Norms.L2Operator open QAlgorithms.Papers.Independent.Dependency50.P21 (IsSupported relativeEntropy)
Formal statement
namespace QAlgorithms.Papers.Independent.Support50.P17
attribute [local instance] Classical.propDecidable Classical.decEq
theorem exists_jordan_decomposition {I : Type*} [Fintype I] [DecidableEq I]
(rho sigma : Matrix I I ℂ) (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma) :
∃ Xp Xm : Matrix I I ℂ, Xp.PosSemidef ∧ Xm.PosSemidef ∧ rho - sigma = Xp - Xm ∧
Xp.trace = ((traceDistance rho sigma : ℝ) : ℂ) ∧
Xm.trace = ((traceDistance rho sigma : ℝ) : ℂ) ∧
(((traceDistance rho sigma : ℝ) : ℂ) • (1 : Matrix I I ℂ) - (Xp + Xm)).PosSemidef := by sorry
end QAlgorithms.Papers.Independent.Support50.P17
end
Source
Nielsen--Chuang, Quantum Computation and Quantum Information, Section 9.2.1, proof of Eq. (9.22); used in Audenaert--Eisert, Continuity bounds on the quantum relative entropy - II, arXiv:1105.2656v3, proof of Corollary 1 (PDF p. 9), Delta = T(P - Q)