Conditional bosonic private capacity, additivity and Gaussian coherent achievability
OpenQAlgorithms.Papers.Independent.Support50.P06.wiretap_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 minimum output entropy conjecture 2: for every positive number of modes and every entropy shell , mixing with vacuum has minimum output entropy , attained by identical thermal inputs. 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 pp.2–3, §III Theorem, (10): conditional operational privacy capacity,
additivity, and coherent-state achievability with the printed Gaussian prior.
Printed (5) uses j=(m,k); changed to Holevo secrecy of m after averaging k,
because (6) and the proof use secret MESSAGE information. Rates use ln(M)/n
instead of the printed bit-count notation 2^(nR). At Nbar=0 the Gaussian prior
is its vacuum point mass. The Gaussian assertion concerns eta>1/2; zero rate
is achievable below that threshold. No one-shot error-free claim is made. -/
theorem wiretap_privateCapacity (hmoe : StrongConjecture2)
(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 following global assertion: for every positive integer , every , and every , the diagonal kernel
has entropy , the first marginal of the specified mixing of the vacuum with has entropy , and every density kernel on satisfying satisfies
Here , with the total real logarithm, and in . For any real with and , put
The theorem asserts simultaneously that
where the fourth equality is in the extended real numbers and the other capacity equalities are in the extended nonnegative reals. The quantities in these assertions are defined as follows. A density kernel on is a complex matrix admitting a countable expansion with and , whose finite quadratic forms are real and nonnegative for every finite and every complex function , and whose real diagonal entries are summable with sum . The entropy is the infimum of over representations , where the nonnegative weights are summable with sum , positive-weight vectors have norm , and distinct positive-weight vectors are orthogonal; zero-weight vectors are unrestricted, and the infimum is if there is no such representation. To specify the mixing, define
For a kernel , its energy is
A private code of length consists of a positive message count , nonnegative summable weights with , density kernels for every and , and effects whose finite quadratic forms are real and nonnegative and whose entries sum to . It has photon budget , eavesdropper kernels and , and leakage
where subtraction is extended nonnegative subtraction, in particular . A real rate is achievable at width if and, for every and every , there is such that for every integer there is such a code of length , with photon budget at most , leakage at most , rate , and
including randomization indices of weight zero. Coherent achievability additionally requires every to have entries
for some complex amplitudes . The capacities and are the suprema of over achievable rates with and without this additional requirement, respectively. For a finite ensemble , with positive alphabet size, , , and density kernels , write and
Then is the extended-real supremum of over such ensembles with ; the real conversion sends infinite entropy to . Finally, if , the theorem also asserts
and for every . Here , entry by entry, and is the point mass at when , otherwise the measure with density . The parameter endpoints and are included; the block and width assertions quantify only over positive integers.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.