Theorem 2: summed branch contractivity
OpenQAlgorithms.Papers.Independent.Intakenext100.P42.branch_contractivityAll registers are finite and nonempty; all input density matrices are positive semidefinite with trace one.
Under F2, F3, F5a, and unit-vector F5b on the coherent positive subnormalized domain, let be a finite Kraus family with . For density matrices , set and . Then
The family need not be local; the inequality retains branch information.
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 2, PDF p.10: summed subnormalized branch contractivity.
Both states use forward conjugation; completeness is inherited from the setup. -/
theorem branch_contractivity (D : DistanceFamily) (h2 : UnitaryInvariantDistance D) (h3 : F3 D true)
(h5a : F5a D) (h5b : F5b D)
{I J K : Type} [Fintype I] [Fintype J] [Fintype K]
[DecidableEq I] [DecidableEq J] [Nonempty I] [Nonempty J]
(V : K → Matrix J I ℂ) (hV : IsKrausFamily V)
(sigma rho : Matrix I I ℂ) (hsigma : IsDensityMatrix sigma) (hrho : IsDensityMatrix rho) :
(∑ k, D (rectangularKrausBranch V sigma k) (rectangularKrausBranch V rho k)) ≤ 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 be an extended real valued family on pairs of complex square matrices on finite types with decidable equality. Assume simultaneous unitary conjugation leaves unchanged on density matrices; tensoring both arguments with for any unit vector on a nonempty finite ancillary type with decidable equality leaves unchanged on density matrices; and, for every complete finite family of mutually orthogonal Hermitian idempotents ,
for all density pairs . These assumptions range over all nonempty finite underlying types with decidable equality. Additionally assume partial trace over any nonempty finite factor does not increase for any pair of positive semidefinite matrices whose real traces are at most , including zero matrices; explicitly, . A density matrix means a positive semidefinite matrix with complex trace , and . Then, for every pair of nonempty finite types with decidable equality, every finite type , every family of complex matrices satisfying , and every density pair on ,
The branch matrices in this sum are not normalized. No decidable equality or nonemptiness assumption is imposed on ; an empty cannot satisfy the completeness equation because is nonempty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.