Appendix B (B5)–(B8): exact fidelity-preserving teleportation and dense coding
OpenQAlgorithms.Papers.Independent.Support50.P11.teleportation_dense_coding_conversionsLet . Use the explicitly defined Weyl Bell measurement, one shared normalized Bell state and controlled Weyl corrections to define the EA teleportation and dense-coding codes. Let be input/output dephasing followed by permutation averaging, and the Haar twirl with inverse output conjugation. Define and by the actual CPTP constructions. Let be the -ary symmetric classical channel and the isotropic -dimensional channel parameterized by entanglement fidelity. For , with when ,
For every CPTP on dimensions and on dimensions, the converted maps are CPTP and admit actual EA-code realizations, and
This retains the exact endpoint fidelities and explicitly repairs the printed twirls.
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 pp.14--15, (B5)--(B8): actual Bell-protocol CPTP conversions, exact
optimalCodeFidelity preservation, and realization in EA. Corrected B1 includes dephasing;
corrected B2 uses inverse output conjugation via accepted haarTwirl. -/
theorem teleportation_dense_coding_conversions
(d : ℕ) (hd : 0 < d) :
IsForwardCode d .EA (teleportCode d hd) ∧ IsForwardCode (d * d) .EA (denseCode d hd) ∧
(∀ lambda : ℝ, 0 ≤ lambda → lambda ≤ 1 → (d = 1 → lambda = 1) →
teleportConversion d hd (symmetricClassical (d * d) lambda) = fidelityDepolarizing d lambda ∧
denseConversion d hd (fidelityDepolarizing d lambda) = symmetricClassical (d * d) lambda) ∧
(∀ M : Superop (Fin (d * d)) (Fin (d * d)), IsChannel M →
IsChannel (teleportConversion d hd M) ∧
teleportConversion d hd M = fidelityDepolarizing d (uniformClassicalSuccess M) ∧
channelFidelity d (teleportConversion d hd M) = uniformClassicalSuccess M ∧
∃ Z : Superop (Fin d × Fin (d * d)) (Fin (d * d) × Fin d),
IsForwardCode d .EA Z ∧ link d M Z = teleportConversion d hd M) ∧
(∀ N : Superop (Fin d) (Fin d), IsChannel N →
IsChannel (denseConversion d hd N) ∧
denseConversion d hd N = symmetricClassical (d * d) (channelFidelity d N) ∧
uniformClassicalSuccess (denseConversion d hd N) = channelFidelity d N ∧
∃ Z : Superop (Fin (d * d) × Fin d) (Fin d × Fin (d * d)),
IsForwardCode (d * d) .EA Z ∧ link (d * d) N Z = denseConversion d hd N) := by sorry
end QAlgorithms.Papers.Independent.Support50.P11
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every positive natural number , use indices , let erase all off-diagonal matrix entries, and put , where . Label matrices by pairs , and define
Define the maps
where is the block indexed by the label . Let be the map that adjoins the shared state , applies to the first input and the first share, and applies to the second input and the second share; let be defined with on the first side and on the second. Thus maps matrices on to matrices on , and maps matrices on to matrices on . More generally, adjoining a state and applying local maps means applying to the matrix with entries , grouped as . Call a map from to an allowed code if it is a channel, there is a channel satisfying for all , and has this shared-state local form for some positive finite share dimensions, a positive semidefinite trace-one shared state, and local channels. Channels mean finite Kraus maps with . For a map , define its link with by
Define
and the two averages
where is Haar measure normalized to total mass , the sum ranges over all permutations, and . Put
For , let have zero off-diagonal output entries and diagonal entries
set . For , set
and set to the identity map. Then and are allowed codes with message dimensions and , respectively. For every , additionally requiring when ,
For every channel on -dimensional matrices, is a channel,
and there exists an allowed code with . For every channel on -dimensional matrices, is a channel,
and there exists an allowed code with ; each existential code may depend on the channel being converted.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.