Every classical channel gives a diagonal S point in T
OpenQAlgorithms.Papers.Independent.Intakethird100.P13.diagonalS_inTetrahedronprove2quantum
Let be any nonnegative conditional law on four symbols, with separately for each input . Define by Eq. (38), including its factor and six-delta exponent. For the Bell-correlation tetrahedron ,
This assertion requires neither a resource state nor a damping parameter. It covers all conditional channels, including laws that are not doubly stochastic.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P13
Formal statement
noncomputable section
open scoped BigOperators Matrix ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Intakethird100.P13
attribute [local instance] Classical.propDecidable Classical.decEq
/-- arXiv:1706.05384v2 PDF pp.5,13, Lemma 24: no resource or damping assumption.
Eq.(38)'s normalization, rather than Appendix B's omitted factor, defines S. -/
theorem diagonalS_inTetrahedron (p : Fin 4 → Fin 4 → ℝ) (hp : ClassicalTeleportationLaw p) :
(fun i : Fin 3 => sCoordinate p i i.succ) ∈ pauliTetrahedron := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P13
end
Source
Simulation of non-Pauli Channels, arXiv:1706.05384v2, PDF p. 13, Lemma 24
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real array such that for every and for each , define when and otherwise. Then the vector with coordinates
belongs to the convex hull of , , , and .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.