Appendix B: non-signalling supermaps preserve replacement channels
ProvedQAlgorithms.Papers.Independent.Support50.P11.nonSignalling_preserves_replacementLet be positive finite systems, a density matrix on , and the replacement channel . Let and let be any actual forward-assisted code of size non-signalling also from Alice to Bob. Then there exists a density matrix on the receiver's -dimensional output such that
Thus the deterministic supermap represented by any such bipartite code preserves replacement channels. Both replacement states are normalized; single-input replacement terminology is distinguished from bipartite non-signalling.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P11
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder ENNReal
namespace QAlgorithms.Papers.Independent.Support50.P11
open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing permutationMatrix)
open QAlgorithms.Papers.Independent.Information100.P21 (pt)
open QAlgorithms.Papers.Independent.Dependency50.P09 (tensorAction)
open QAlgorithms.Papers.Independent.Information100.P76 (swapMatrix)
open QAlgorithms.Papers.Independent.Information100.P69 (replacer)
open QAlgorithms.Papers.Independent.Gap20.P19 (wernerIsometry)
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
/-- PDF p.14, Appendix B: a non-signalling deterministic supermap sends any
normalized replacer channel to another normalized replacer channel. -/
theorem nonSignalling_preserves_replacement
{I O : Type} [Fintype I] [Nonempty I] [Fintype O] [Nonempty O]
(K : ℕ) (hK : 0 < K) (sigma : Matrix O O ℂ) (hsigma : IsDensityMatrix sigma)
(Z : Superop (Fin K × O) (I × Fin K)) (hZ : IsForwardCode K .NS Z) :
∃ tau : Matrix (Fin K) (Fin K) ℂ, IsDensityMatrix tau ∧
∀ X, link K (replacer (A := I) sigma) Z X = X.trace • tau := by sorry
end QAlgorithms.Papers.Independent.Support50.P11
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty types, let be a positive natural number, let be a complex matrix on that is positive semidefinite with trace , and let map matrices on to matrices on . Suppose is a channel and that there are channels and satisfying, for every matrix ,
A channel here is a map with a finite Kraus representation and . There exists a positive semidefinite matrix on , with trace , such that for every complex matrix ,
The left side is the linked map obtained from and the replacement map . The assertion covers all matrices , without a positivity or normalization requirement, and includes and singleton choices of or .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.