Dephasing moments and second-order boundary
OpenQAlgorithms.Papers.Independent.Support50.P04.qubit_moments_secondOrderLet 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 every , put . Its coherent information and variance satisfy
Moreover, with ,
for all sufficiently large . Each side has fixed positive constants and thresholds; they may be combined into a single remainder bound. This second-order result includes zero dispersion.
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,15–16, Eqs.(58)–(60).
Printed h=1-gamma log gamma-(1-gamma)log(1-gamma) in (58); changed to Result 1's
binary entropy. The O(log n/n) statement includes zero-dispersion endpoints. -/
theorem qubit_moments_secondOrder (gamma epsilon : ℝ) (hg0 : 0 ≤ gamma) (hg1 : gamma ≤ 1)
(he0 : 0 < epsilon) (he1 : epsilon < 1) :
QAlgorithms.Papers.Independent.Dependency50.P36.stateCoherentInformationBits (choiState (QAlgorithms.Papers.Independent.Information100.P27.qubitDephasing (1-2*gamma))) = 1-QAlgorithms.Papers.Independent.Frontier18.P07.binaryEntropyBits gamma ∧
QAlgorithms.Papers.Independent.Dependency50.P36.coherentVariance (choiState (QAlgorithms.Papers.Independent.Information100.P27.qubitDephasing (1-2*gamma))) = binaryVariance gamma ∧
dispersionLower (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 ∧
dispersionUpper (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 and , let be the map on complex matrices that leaves diagonal entries unchanged and multiplies off-diagonal entries by , and let , where . Define
using the total logarithm with . The assertion gives both exact moment identities
where , and also two eventual bounds: there exist and, separately, , such that
The quantile is . The extended-real quantity is the supremum of rates obtainable with positive integer , a channel encoder into qubits, and a channel decoder from qubits, whose effective channel through has overlap at least with the normalized maximally entangled state when acting on its second half. Channels mean finite Kraus sums with complete Kraus family. The endpoints are included, and both have .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.