Coherent-information dispersion achievability
OpenQAlgorithms.Papers.Independent.Support50.P04.coherent_dispersion_achievabilityLet be a CPTP channel on finite positive-dimensional complex Hilbert spaces with fixed orthonormal bases. Write and for the maximum unassisted and classical-post-processing assisted entanglement-transmission rates. A code has a positive integer message dimension , rate , and squared fidelity to the normalized maximally entangled target at least . A cpp encoder may retain sender memory; its decoder is LOCC across that memory and the receiver outputs, with its final quantum output at the receiver and no preshared entanglement. Fix . All logarithms are binary and is the standard Gaussian quantile. Remainder constants may depend on the fixed channel and error, and are chosen before the block length: there are and such that the displayed bound holds for every integer . For every normalized density input , use the source purification with coefficients in the reference/input bases, and put . Let , and let be all maximizing density inputs, including rank-deficient ones. Let be the minimum of over below , and the maximum at or above . Then
This is a general achievable lower bound; it need not equal the optimal boundary.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P04
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder
open QAlgorithms
namespace QAlgorithms.Papers.Independent.Support50.P04
variable {A B E : Type} [Fintype A] [DecidableEq A]
variable [Fintype B] [DecidableEq B] [Fintype E] [DecidableEq E]
/-- arXiv:1504.04617v2, PDF p.14, Theorem 6, Eqs.(48)–(50).
All normalized density inputs are allowed; min variance below 1/2 and max above.
This states only the source's one-sided achievable expansion. -/
theorem coherent_dispersion_achievability [Nonempty A] [Nonempty B]
(N : Superop A B) (hN : IsChannel N) (epsilon : ℝ)
(he0 : 0 < epsilon) (he1 : epsilon < 1) :
dispersionLower (fun n => unassistedBoundary N n epsilon)
(channelCoherentBits N) (coherentInformationVariance N epsilon) epsilon := by sorry
end QAlgorithms.Papers.Independent.Support50.P04
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be nonempty finite sets with decidable equality, let be a finite Kraus sum with , and let . For each density matrix on , write , form , and put and . Define
where , with the scalar logarithm assigned its total value at zero. For every attaining this supremum, define
Let over those optimizers if , and if ; these are real extrema, with the formal default if the optimizer set is empty, and optimizer attainment is not a separate conclusion. The assertion is that there exist and an integer such that, for every ,
Here , and is the extended-real supremum of real rates realized by a positive integer , a channel encoder into , and a channel decoder from , with and entanglement fidelity at least through . That fidelity is the overlap with the normalized maximally entangled state of dimension after applying the effective channel to its second half; encoders and decoders are finite complete Kraus sums. The square root is the total real square-root function used in the statement.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.