equation-12
ProvedQAlgorithms.Papers.Independent.Extend50.P02.equation12All registers are nonzero finite-dimensional complex Hilbert spaces with fixed computational bases. States are positive semidefinite with trace one, and every resource or target channel is completely positive and trace preserving (CPTP). Write for the unnormalized, input-first Choi operator, so . Every operator inequality is in Loewner order, and all transposes use the fixed product bases.
For channels , let and let be the infimum of squared Uhlmann fidelity over normalized reference-assisted inputs. Thus the two errors are and . For an assistance class , and denote the respective infima over protocols in that class; the protocol is fixed independently of the unknown input. One-way LOCC () means Alice instruments followed by Bob's conditional CPTP maps. LOCR means a probability mixture of product CPTP maps.
Let be a CPTP bipartite channel. Suppose it has a CPTP extension satisfying simultaneous Bob input/output swap covariance and . Then
Equivalently its Choi matrix satisfies with canonical register permutation. Thus two-extendibility already implies Bob-to-Alice non-signaling, without a PPT assumption.
import Definitions.Def_QAlgorithms_Papers_Independent_Extend50_P02
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.decEq Classical.propDecidable
namespace QAlgorithms.Papers.Independent.Extend50.P02
open QAlgorithms.Papers.Independent.Information100.P32 (Op)
open QAlgorithms.Papers.Independent.Information100.P34 (choi fromChoi)
variable {A B C D H J : Type*}
variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype H] [Fintype J]
/-- PDF pp.4–5, (12),(18), Appendix A p.22: every two-extendible channel
is Bob-to-Alice non-signaling. No PPT assumption is needed. -/
theorem equation12 [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D]
(N : Superop (A × B) (C × D)) (hN : IsChannel N)
(hext : HasExtension false false (choi N)) : BobToAliceNS (choi N) := by sorry
end QAlgorithms.Papers.Independent.Extend50.P02
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty types with decidable equality, and let be a channel from matrices on to matrices on , meaning for finitely many with . Define its Choi matrix by
Suppose there exists a matrix on input and output such that , , is unchanged by simultaneously exchanging and , and, for every ,
Then, for every ,
Thus the asserted conclusion is precisely this marginal identity for the Choi matrix; the extension hypothesis imposes the displayed positivity, normalization, symmetry, and marginal conditions.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.