Generic state-induced and diamond distance comparison
ProvedQAlgorithms.Papers.Independent.Advance50.P43.stateDiamondComparisonLet be nonzero finite-dimensional registers, , and let be CPTP maps from to . Define . Define the full diamond distance by maximizing the output trace norm over normalized pure inputs on , with an untouched reference . Then
The estimate compares state discrimination without and with an untouched reference. Both distances use the full trace norm, without a factor of one half.
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P43
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator
namespace QAlgorithms.Papers.Independent.Advance50.P43
open QAlgorithms.Papers.Independent.Dependency50.P45
(holevoCapacity resourceCapacity standardEbit)
open QAlgorithms.Papers.Independent.Information100.P32 (evolution)
open QAlgorithms.Papers.Independent.Information100.P69 (replacer diamond)
open QAlgorithms.Papers.Independent.Information100.P67 (mapFirst privateCapacity)
open QAlgorithms.Papers.Independent.Information100.P22 (quantumCapacity)
open QAlgorithms.Papers.Independent.Dependency50.P23 (ordinaryClassicalCapacity)
open QAlgorithms.Papers.Independent.Information100.P34 (choi)
variable {A B C Q : Type}
variable [Fintype A] [Fintype B] [Fintype C] [Fintype Q]
variable [DecidableEq A] [DecidableEq B] [DecidableEq C] [DecidableEq Q]
/-- arXiv:1905.11920v2, PDF p.6, (44), Appendix A p.8: generic channel norm
comparison, with MQ (the input dimension) in both Schmidt count and final factor.
The Appendix's printed MA labels are inconsistent with (44). -/
theorem stateDiamondComparison [Nonempty Q] [Nonempty B]
(Phi Psi : Superop Q B)
(hPhi : IsChannel Phi) (hPsi : IsChannel Psi) :
stateDistance Phi Psi ≤ diamond (Phi - Psi) ∧
diamond (Phi - Psi) ≤ 2 * (Fintype.card Q : ℝ) * stateDistance Phi Psi := by sorry
end QAlgorithms.Papers.Independent.Advance50.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For any finite nonempty types with decidable equality and any two channels from matrices on to matrices on , define
where , and the tensor extension applies the map to each block indexed by the reference copy of . Each channel is assumed to have some finite Kraus representation satisfying . The theorem asserts both
Neither distance contains a factor ; the diamond supremum includes all complex matrices of trace norm at most one, without positivity or Hermiticity restrictions. One-dimensional and are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.