Conditional high-photon privacy and coherent-information limits
OpenQAlgorithms.Papers.Independent.Support50.P06.highPhoton_capacityLimitAssume global minimum output entropy conjecture 2 and the same full-oscillator, vacuum-dilation operational privacy convention and mean-photon budget as in the wiretap theorem. For , let denote the coherent-information supremum over all normalized inputs with mean photons at most . In nats,
At both limits are . This retains the conjectural premise of the present paper's derivation. The separately cited unconditional quantum-capacity result is inventoried as a deferral.
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.3, paragraph after (12): conditional high-photon limit in nats for
both operational privacy capacity and constrained Q^(1). The finite logarithm
formula is restricted to 0<eta<1. The eta=1 limit is infinity, not log(0).
The independently cited unconditional result [10] is inventoried separately. -/
theorem highPhoton_capacityLimit (hmoe : StrongConjecture2) :
(∀ eta : ℝ, 0 < eta → eta < 1 →
Tendsto (fun N : ℝ => holevoMessagePrivacyCapacityNats 1 eta N) atTop
(nhds (ENNReal.ofReal (max 0 (Real.log eta - Real.log (1 - eta))))) ∧
Tendsto (fun N : ℝ => coherentInformationMaximum 1 eta N) atTop
(nhds ((max 0 (Real.log eta - Real.log (1 - eta)) : ℝ) : EReal))) ∧
Tendsto (fun N : ℝ => holevoMessagePrivacyCapacityNats 1 1 N) atTop (nhds ⊤) ∧
Tendsto (fun N : ℝ => coherentInformationMaximum 1 1 N) atTop (nhds ⊤) := 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 global assertion that, for every positive integer , , and , the diagonal kernel
has entropy , the kernel has entropy , and every density kernel with entropy satisfies , where . Then, for every , writing , the asserted limits as real are
in the extended nonnegative reals and the extended reals, respectively; at , both limits are . Here a density kernel on admits , with and , has real nonnegative finite quadratic forms, and has summable real diagonal entries of sum . Its entropy is the infimum of over countable representations , with nonnegative summable weights of sum , normalized positive-weight vectors, and orthogonality between distinct positive-weight vectors; zero-weight vectors are unrestricted, and the infimum over no representations is . The mixing maps are specified by
The sums over in range over pairs of number strings. Set and , where infinite entropy converts to real ; then is the extended-real supremum of over one-mode density kernels with . For the capacity , a length- private code has messages, nonnegative summable weights of sum , density kernels , and effects with real nonnegative finite quadratic forms and . Its budget is , and its leakage is
using extended nonnegative subtraction, including . A rate is achievable if, for every and , all sufficiently large positive admit such a code with budget at most , leakage at most , , and
even when ; is the supremum of over such rates. Here in the extended nonnegative reals. The first pair of limits includes , where the displayed limiting value is ; is not covered.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.