EPnI implies the full bosonic private-capacity conclusion
OpenQAlgorithms.Papers.Independent.Support50.P06.epni_privateCapacityConsider the full single-mode noiseless bosonic wiretap channel with vacuum environment, Bob transmissivity , and complementary Eve output from the same lossless beam splitter. Let be a finite photon budget. Use unassisted classical private codes with arbitrary normalized mixed, possibly entangled block inputs, uniform messages, independent private discrete encoder randomness, and a normalized POVM decoder. The unconditional total input photon number, averaged over messages and randomness, is at most in an -use block. For every message and random branch, decoding success exceeds ; Holevo leakage about the message, after averaging the private randomness, tends to zero. Rates are nats/use.
Assume global EPnI for all positive mode counts and transmissivities in , with independent normalized port states of finite input entropies; output entropy may be infinite. Then
This rate is asymptotically achievable with product coherent signal states and collective block decoding, and restricting the encoder to such states leaves the capacity unchanged. For every positive , the unrestricted -letter private-information supremum under total budget equals ; grouping any positive number of parallel identical modes multiplies operational capacity by that number. On the branch, the single-use coherent ensemble with isotropic prior has private information and thermal average input of mean . Individual coherent signals have pure outputs at both receivers. At the prior is the point mass at vacuum.
This identifies the conditional operational capacity and its single-use signal ensemble, while allowing arbitrarily long codes.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P06
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P06
open MeasureTheory Filter
open scoped ENNReal BigOperators Topology
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P33 (State IsDensity rankOne)
open QAlgorithms.Papers.Independent.Next46.P32
(NumberString FockKernel identicalThermalKernel vacuum productCoherentKernel
jointMix bobMarginal charlieMarginal pureLoss broadcast mixedOutput
spectralEntropyNats FockPOVM realFockTracePair modeEnergy complexNormal
StrongConjecture2)
open QAlgorithms.Papers.Independent.Claimed50.P39 (g)
open QAlgorithms.Papers.Independent.Claimed50.P11 (thermalEntropyInverse)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF p.1 abstract and p.5 §VI: EPnI implies the entire conditional privacy
capacity conclusion, including additivity and Gaussian coherent achievability.
Source correction: (5) prints j=(m,k); secrecy here concerns m after averaging
k, as required by (6) and the proof. Nats use ln(M)/n; Nbar=0 uses delta_0.
This theorem does not assert the EPnI conjecture or an operational quantum code. -/
theorem epni_privateCapacity (hepni : EntropyPhotonNumberInequality)
(eta Nbar : ℝ) (heta : 0 ≤ eta) (heta_one : eta ≤ 1) (hNbar : 0 ≤ Nbar) :
holevoMessagePrivacyCapacityNats 1 eta Nbar =
ENNReal.ofReal (if 1 / 2 < eta then g (eta * Nbar) - g ((1 - eta) * Nbar) else 0) ∧
holevoMessagePrivacyCapacityNats 1 eta Nbar true = holevoMessagePrivacyCapacityNats 1 eta Nbar ∧
privateAchievable 1 eta Nbar true
(if 1 / 2 < eta then g (eta * Nbar) - g ((1 - eta) * Nbar) else 0) ∧
(∀ n : ℕ, 0 < n → blockPrivateInformation n eta Nbar =
(((n : ℝ) * (if 1 / 2 < eta then
g (eta * Nbar) - g ((1 - eta) * Nbar) else 0) : ℝ) : EReal)) ∧
(∀ width : ℕ, 0 < width → holevoMessagePrivacyCapacityNats width eta Nbar =
(width : ℝ≥0∞) * holevoMessagePrivacyCapacityNats 1 eta Nbar) ∧
(1 / 2 < eta →
gaussianPrivateInformation eta Nbar = g (eta * Nbar) - g ((1 - eta) * Nbar) ∧
coherentMixture Nbar = identicalThermalKernel 1 Nbar ∧
∀ alpha : ℂ,
spectralEntropyNats (pureLoss 1 eta (productCoherentKernel 1 (fun _ => alpha))) = 0 ∧
spectralEntropyNats ((charlieMarginal (broadcast 1 eta (productCoherentKernel 1 (fun _ => alpha))))) = 0) := by sorry
end QAlgorithms.Papers.Independent.Support50.P06
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Assume the entropy photon number inequality defined below, and fix real parameters and . The kernels, entropies, codes, and optimizations occurring in the conclusion have the following literal meanings. For any positive integer , let . A density kernel on this index set has a representation , where and is summable; every finite quadratic form is real and nonnegative; and the real diagonal entries are summable with sum . Define to be the infimum of over representations with nonnegative summable weights of total , unit norm vectors for positive weights, and mutually orthogonal vectors for distinct positive weights; zero-weight vectors are unrestricted. If there is no such representation, . Here is the nonnegative part of a real number embedded in . Put
The logarithm is natural, with the total convention ; an empty real infimum defining is . For nonnegative integers , define unless , and otherwise define
All natural-number subtraction is truncated at zero. Set , and define
Let be when and otherwise. The broadcast kernel is ; its two marginals used here are
All unrestricted complex or real series use total sums, taking value zero when nonsummable. The assumed entropy photon number inequality says that, for every positive integer , every , and every pair of density kernels with ,
To specify the capacity, write
A private code of length and message count consists of , , a nonnegative summable real sequence of total , density kernels for and every , and decoder kernels . Each has real nonnegative quadratic forms on every finite set, and they satisfy the coefficientwise completeness condition
Its photon budget, Eve kernels, and leakage are
The budget and leakage use arithmetic in ; in particular the leakage subtraction is truncated subtraction, including . Decoding with parameter means the strict inequality
including indices with . For amplitudes , define
A coherent private code is one for which some amplitudes satisfy for every . For a width and a flag , say holds when and, for every and every , there exists such that for every integer there is such a private code of length , with some positive message count , satisfying
and the decoding inequalities above, with the additional coherent-code requirement when . Thus the rate denominator is , whereas the physical code length is . Define
For the finite-ensemble quantity, let an ensemble on modes consist of a positive integer , nonnegative real weights , , of total , and density kernels . Put , and define
where for finite , and . Let
where the supremum is in the extended real numbers and ranges over all such finite ensembles. Finally, for , let be the point mass at when , and otherwise the measure on with density relative to planar volume. Define the one-mode kernel coefficientwise by , and define
These integrals are the total integrals in the definitions; a nonintegrable integrand has integral zero. With all these meanings, put
The declaration asserts simultaneously that
that as an extended real number for every positive integer , and that
In addition, if , it asserts
where is diagonal with
and it asserts, for every , that both and . The parameter range includes , , and ; the last of these uses the zero branch of .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.