Coherent coding with exponentially small averaged photon leakage
OpenQAlgorithms.Papers.Independent.Intakenext100.P76.photonOccupationCodingFix and for the identity-transmissivity coherent-state channel. There is , depending on these energy parameters, such that for every and there are and with the following property for every integer . One has , and there exists a deterministic code of equiprobable coherent product signals with one joint POVM, average decoding error at most , and
Here is the uniform average of the input density operators, cuts off total photon number across all modes, is thermal entropy in bits, and is thermal entropy variance in bits squared. This is simultaneous decodability and exponentially vanishing occupation leakage, distinct from a mean-energy constraint.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P76
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P76
open MeasureTheory Filter
open QAlgorithms.Papers.Independent.Information100.P63 (logTwo normalCDF normalQuantile)
open QAlgorithms.Papers.Independent.Information100.P54 (thermalEntropy)
open QAlgorithms.Papers.Independent.Dependency50.P39 (coherentCoefficient)
open QAlgorithms.Papers.Independent.Next46.P32 (PositiveKernel)
open scoped BigOperators ENNReal Topology
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
/-- PDF p.11, (6.10)–(6.11): at eta=1 there are actual finite coherent-state
codes with average error <=epsilon and exponentially small total-photon leakage.
The auxiliary error is epsilon^(1+delta2). The tail constant depends only on NS
and delta1, before blocklength; it is not an assumed tail bound on the code.
The rate and occupation claims are simultaneous, with cutoff ceil(n NS). -/
theorem photonOccupationCoding (NS delta1 : ℝ)
(hNS : 0 < NS) (hd1 : 0 < delta1) (hd1NS : delta1 < NS) :
∃ q : ℝ, 0 < q ∧ q < 1 ∧ ∀ epsilon delta2 : ℝ,
0 < epsilon → epsilon < 1 → 0 < delta2 →
∃ C : ℝ, 0 < C ∧ ∃ N : ℕ, 2 ≤ N ∧ ∀ n : ℕ, N ≤ n →
q ^ ((n : ℝ) / 2) + epsilon ^ delta2 < 1 ∧
∃ (M : ℕ) (c : PureCQCode (Fin n → ℂ) (Fin n → ℕ) M),
pureCQAverageError (coherentChannel n) c ≤ epsilon ∧
photonLeakage c NS ≤ q ^ ((n : ℝ) / 2) ∧
(n : ℝ) * thermalEntropy (NS - delta1) +
Real.sqrt ((n : ℝ) * thermalDispersion (NS - delta1)) *
normalQuantile (epsilon ^ (1 + delta2)) - C * logTwo (n : ℝ) ≤
logTwo (M : ℝ) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P76
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every pair of real numbers satisfying and , there exists a real with such that, for every and every , there exist and an integer for which the following holds for every integer : , and there exist a positive integer , amplitude vectors for , and complex matrices indexed by , each with real nonnegative quadratic forms on every finite set of indices and satisfying , such that, writing
one has
and
Here , , for , , and for the standard normal cumulative distribution function . The ceiling is the natural-number ceiling, which here agrees with the usual ceiling because . The leakage inequality averages over messages and sums only occupations strictly above this ceiling; the statement imposes no separate energy bound on each amplitude vector, and repeated amplitude vectors are allowed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.