§VI (53)–(56): teleportation-covariance sufficient for exact Choi simulation
ProvedQAlgorithms.Papers.Independent.Support50.P11.covariant_choi_simulationLet be finite CPTP. Let be a positive finite classical outcome register, a CPTP classical-output measurement map, and unitary corrections on . Suppose that with corrections teleports every input operator exactly using one normalized Bell state and that, for every and operator ,
Let be the computed normalized Choi state of . Applying to the input and Alice's share of , sending forward, and applying on Bob's share gives
In particular an exact single-copy Choi simulation exists. The given protocol and corrections are fixed before the input; no simulation identity is assumed for .
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
section Statements
variable {I O : Type} [Fintype I] [Nonempty I] [Fintype O] [Nonempty O]
/-- PDF p.10, (53)--(56): the given teleportation measurement and covariant output
corrections construct the simulation on all operators, with one computed Choi state. -/
theorem covariant_choi_simulation
(N : Superop I O) (hN : IsChannel N) {C : Type*} [Fintype C] [Nonempty C]
(M : Superop (I × I) C) (hM : IsChannel M) (hclassical : ∀ X, dephasing (M X) = M X)
(U : C → Matrix.unitaryGroup I ℂ) (V : C → Matrix.unitaryGroup O ℂ)
(hteleport : ∀ X, resourceSim (choiState (fun Y : Matrix I I ℂ => Y)) M
(classicalControlledUnitary (fun c => (U c : Matrix I I ℂ))) X = X)
(hcov : ∀ c X, N (conjSuperop (U c : Matrix I I ℂ) X) =
conjSuperop (V c : Matrix O O ℂ) (N X)) :
(∀ X, resourceSim (choiState N) M (classicalControlledUnitary (fun c => (V c : Matrix O O ℂ))) X = N X) ∧
HasChoiSimulation N := by sorry
end Statements
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 input and output index types, let be a channel, and let be a finite nonempty type. Let be a channel whose output is diagonal for every input, and let be unitary matrices on , respectively, for every . Channels here have finite Kraus representations with . Define , where , and, for a matrix on , a map , and , define by
Assume that for every matrix on , where , and assume for every . Then for every , where . Furthermore, there exist a positive integer , a channel with diagonal output on every input, and a channel such that for every . No group law or averaging identity for the families is assumed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.