§3.4 (3.48)–(3.49): purification interpretation and contraction
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.purification_distance_and_contractionAll 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 .
For normalized states P(ρ,τ) is the minimum trace distance between their purifications on a sufficiently large common auxiliary system; for subnormalized inputs P contracts under CPTNI maps.
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.purificationmetric
§3.4 (3.48)–(3.49): purification interpretation and contraction, arXiv:1504.00233v5, PDF p.47. -/
theorem purification_distance_and_contraction [Nonempty I] [Nonempty J] :
(∀ r s : paperMat I, IsDensityMatrix r → IsDensityMatrix s → Fintype.card I ≤ Fintype.card J →
(∃ R S : paperMat (I × J), IsDensityMatrix R ∧ IsDensityMatrix S ∧ paperPure R ∧ paperPure S ∧
traceRight R = r ∧ traceRight S = s ∧ paperDelta R S = purified r s) ∧
(∀ R S : paperMat (I × J), IsDensityMatrix R → IsDensityMatrix S → paperPure R → paperPure S →
traceRight R = r → traceRight S = s → purified r s ≤ paperDelta R S)) ∧
(∀ E : paperMat I →ₗ[ℂ] paperMat J, CPTNI E → ∀ r s : paperMat I, paperSubnormalized r → paperSubnormalized s →
purified (E r) (E s) ≤ purified 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 any nonempty finite types , equipped with decidable equality, write for positive semidefiniteness; a density matrix is a positive semidefinite matrix with complex trace , and a subnormalized matrix is a positive semidefinite matrix whose real trace is at most . Define
where matrix square roots use functional calculus and real square roots are the total real square-root function. Also define
For every pair of density matrices on , if , there exist density matrices on , each of rank exactly , such that , , and ; moreover, every pair of rank-one density matrices with these partial traces satisfies . Here , and both purification assertions are under the dimension hypothesis. In addition, every complex-linear map from matrices on to matrices on that is completely positive and satisfies for every obeys
for all subnormalized , including zero matrices. Complete positivity here means that for every natural number , including , applying to each block of a positive semidefinite matrix on produces a positive semidefinite matrix.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.