Theorem 1: CPTP contractivity
OpenQAlgorithms.Papers.Independent.Intakenext100.P42.cptp_contractivityAll registers are finite and nonempty; all input density matrices are positive semidefinite with trace one.
Let be one coherent extended-real distance family on all finite register dimensions and on positive subnormalized blocks, including zero. Assume unitary invariance on normalized states (F2), partial-trace contractivity on normalized states (F3), and invariance under adjoining a rank-one projector onto a unit vector (proof-used F5b). For any CPTP map and density matrices ,
No locality is required. This is deterministic contractivity under the three stated conditions.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P42
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder ENNReal Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P42
open QAlgorithms QAlgorithms.Entanglement
open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy)
open QAlgorithms.Papers.Independent.Information100.P56 (entropy)
open QAlgorithms.Papers.Independent.Information100.P04 (copies)
open QAlgorithms.Papers.Independent.Bridge50.P49 (groupedProduct)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Theorem 1, PDF p.9 (introduced p.8): CPTP contractivity under F2,F3,F5b only. -/
theorem cptp_contractivity (D : DistanceFamily) (h2 : UnitaryInvariantDistance D) (h3 : F3 D) (h5 : F5b D)
{I J : Type} [Fintype I] [Fintype J] [DecidableEq I] [DecidableEq J]
[Nonempty I] [Nonempty J] (Phi : Superop I J) (hPhi : IsChannel Phi)
(sigma rho : Matrix I I ℂ) (hsigma : IsDensityMatrix sigma) (hrho : IsDensityMatrix rho) :
D (Phi sigma) (Phi rho) ≤ D sigma rho := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P42
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let assign an extended real value to every ordered pair of complex square matrices on every finite index type equipped with decidable equality. Assume that is invariant under simultaneous unitary conjugation of density matrices on every nonempty such type; that for all nonempty finite types with decidable equality and all density matrices on ,
and that for every pair of density matrices on a nonempty finite type and every unit vector on any nonempty finite ancillary type with decidable equality,
where . Then, for any nonempty finite types with decidable equality, any map from complex matrices on to those on admitting a finite representation
and any density matrices on , one has . Throughout, a density matrix means a positive semidefinite matrix whose complex trace is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.