Proposition 8: operational PPT distillation and channel codes
OpenQAlgorithms.Papers.Independent.Support50.P11.ppt_distillation_and_channel_codesFor a finite CPTP channel , let be its normalized Choi state, reordered as reference–output. Write for the supremum of Bell overlaps obtainable by PPT-preserving CPTP distillation maps, and for the corresponding memoryless vanishing-error rate. Every such map producing Bell overlap at size yields an actual forward-assisted PPTp code with exactly channel fidelity . Thus
If has an exact single-copy simulation from by local operations and forward classical communication, every PPTp code conversely yields a PPT-preserving distillation map with exactly the same fidelity, and
The transformations use a single channel or a parallel block, retaining the operational meaning of both optima.
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 pp.9--10, Proposition 8: fixed-fidelity transformations in both directions
when exact single-copy Choi simulation is available, and both one-shot/quantumCodeCapacity comparisons.
The channel label in printed part (ii) is corrected to the same N as part (i). -/
theorem ppt_distillation_and_channel_codes
(N : Superop I O) (hN : IsChannel N) :
(∀ K : ℕ, ∀ hK : 0 < K,
letI : Nonempty (Fin K) := ⟨⟨0,hK⟩⟩
(∀ Y : Superop (I × O) (Fin K × Fin K), PPTMap Y →
∃ Z : Superop (Fin K × O) (I × Fin K), IsForwardCode K .PPTp Z ∧
channelFidelity K (link K N Z) =
effectProb (pureDensity (finiteMaxEntangled (Fin K))) (Y (choiState N))) ∧
distillFidelity (choiState N) K ≤ optimalCodeFidelity .PPTp N K) ∧
distillCapacity (choiState N) ≤ quantumCodeCapacity .PPTp N ∧
(HasChoiSimulation N →
(∀ K : ℕ, ∀ hK : 0 < K,
letI : Nonempty (Fin K) := ⟨⟨0,hK⟩⟩
(∀ Z : Superop (Fin K × O) (I × Fin K), IsForwardCode K .PPTp Z →
∃ Y : Superop (I × O) (Fin K × Fin K), PPTMap Y ∧
effectProb (pureDensity (finiteMaxEntangled (Fin K))) (Y (choiState N)) =
channelFidelity K (link K N Z)) ∧
optimalCodeFidelity .PPTp N K = distillFidelity (choiState N) K) ∧
quantumCodeCapacity .PPTp N = distillCapacity (choiState 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 index types and a channel, where channels have finite Kraus representations with . Put , where . Partial transposition is ; a map between bipartite matrix spaces is called PPT here when both and are channels. For every positive integer and every such PPT map , there exists a channel that is PPT and satisfies for all , for some channel , such that
Here projects onto , and
Consequently , where is the real supremum of over PPT , and is the real supremum of the linked fidelities over the stated . Also,
with suprema in ; the tensor products use products of matrix entries, and the limits are as natural . Finally, suppose there exist a positive integer , channels and , with every diagonal, such that using as an auxiliary state reproduces : explicitly, for every ,
Then, for every positive and every allowed , there exists a PPT giving the reverse fidelity equality, , and the two displayed asymptotic suprema are equal. The one-shot quantifiers include ; the capacity definitions also include rate and the term, which does not affect their limits.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.