Qubit dephasing: third-order boundary
OpenQAlgorithms.Papers.Independent.Support50.P04.dephasing_thirdOrderLet 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 . Write , with zero-weight terms zero, and . For the phase-flip channel , assume and . Then
This gives the third-order operational boundary on the nonzero-dispersion domain.
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 pp.4,16–17, Result 1, Eq.(6).
Printed gamma in [0,1]; changed to positive nonzero dispersion, because the
+log2(n)/(2n) term is false at 0,1/2,1. Those printed cases are deferred separately. -/
theorem dephasing_thirdOrder (gamma epsilon : ℝ)
(hg0 : 0 < gamma) (hg1 : gamma < 1) (hghalf : gamma ≠ 1/2)
(he0 : 0 < epsilon) (he1 : epsilon < 1) :
thirdOrderExpansion (fun n => unassistedBoundary (QAlgorithms.Papers.Independent.Information100.P27.qubitDephasing (1-2*gamma)) n epsilon)
(1-QAlgorithms.Papers.Independent.Frontier18.P07.binaryEntropyBits gamma) (binaryVariance gamma) 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
For every satisfying , , and , let be the map on complex matrices that leaves diagonal entries unchanged and multiplies each off-diagonal entry by . Set , with the total real logarithm used by the definitions, set , and set
For each , let be the supremum of all real , embedded in the extended reals, for which there are a positive integer and channels from -dimensional matrices to matrices on and in the reverse direction such that and
Here a channel means a map with a finite Kraus family satisfying , and the tensor power is its usual multilinear extension on matrix units. Write . The theorem asserts that there exist and a natural number such that, for every natural ,
Both inequalities are in the extended reals; no assertion is made here about block lengths below .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.