How many uses of an optical device are needed to certify that it preserves quantum information? This article determines the optimal asymptotic number of coherent-light probes under an average photon budget. Matching upper and lower bounds show that a single optical mode carries an unavoidable logarithmic cost, while every fixed higher mode number follows a different power law. Certification task and resource accounting. The device is an arbitrary normal, memoryless bosonic quantum channel. The task distinguishes the identity from channels at least \(\varepsilon\) away in the energy-constrained diamond norm, defined using the full trace norm and a signal-energy budget \(E_s\). This guarantee includes inputs entangled with an unrestricted reference system. The physical probes are fresh coherent states with classically chosen amplitudes. Adaptive choices, retained quantum outputs and a final joint measurement are allowed. Every device call, including a vacuum pulse, is counted, and the actual illumination obeys \[\sum_{t=1}^{T}\mathbb E_{\mathcal K}\|\alpha_t\|^2\le T E_p\] under every channel in the testing promise. The probe budget \(E_p\) is distinct from the signal budget \(E_s\) defining the certification guarantee. Optimal mean-energy query laws. For fixed positive \(E_s,E_p\), fixed finite mode number \(m\), and both testing errors at most \(\delta\), the minimax number of calls satisfies \[T_{\mathrm{mean}}^{(1)}(\varepsilon,\delta)=\Theta_{E_s,E_p}\!\left(\varepsilon^{-4}\log\frac1\varepsilon\log\frac1\delta\right),\] \[T_{\mathrm{mean}}^{(m)}(\varepsilon,\delta)=\Theta_{m,E_s,E_p}\!\left(\varepsilon^{-(2m+2)}\log\frac1\delta\right),\qquad m\ge2.\] The bounds hold for sufficiently small \(\varepsilon\), uniformly over \(0<\delta\le1/4\). Independent probes drawn from a physical positive multiscale source, followed by individual binary target tests, attain these orders. The matching converse covers adaptive coherent-probe protocols with quantum output memory. Thus those additional processing capabilities do not improve the asymptotic order within the stated preparation model. The result specifies matching scaling laws, rather than exact finite-query counts or optimal numerical constants. Why one mode has an extra logarithm. Rare high-photon coherences can strongly affect an energy-bounded quantum input while leaving only a weak signature on coherent probes. The proof retains this interference through a positive coherent-frame Green kernel. Its spectral sum grows as \(t\log t\) for one mode and as \(t^m\) for fixed \(m\ge2\). A complementary family of physical channels shows that the single-mode logarithm is necessary, rather than an artifact of the reconstruction bound. What source brightness changes. The optimal mean-only laws contrast with prescribed independent Gaussian modulation, for which \(\log T_{\mathrm G}=\Theta(\varepsilon^{-2})\) at fixed confidence. A fixed brightness cap gives \(\log T_{\mathrm{cap}}=\Theta(\varepsilon^{-2}\log(1/\varepsilon))\). The article also establishes matching logarithmic orders under stretched-exponential brightness constraints and develops the conversion from average coherent-probe error to thermal Choi-state and energy-constrained worst-input guarantees. These are worst-case certification limits for the specified coherent-probe access model. The channel class retains infinite photon tails and imposes no output-energy bound. This updated, integrated 37-page article contains the main results, two figure groups, complete proofs and references.
How many uses of an optical device are needed to certify that it preserves quantum information? This article determines the optimal asymptotic number of coherent-light probes under an average photon budget. Matching upper and lower bounds show that a single optical mode carries an unavoidable logarithmic cost, while every fixed higher mode number follows a different power law. Certification task and resource accounting. The device is an arbitrary normal, memoryless bosonic quantum channel. The task distinguishes the identity from channels at least (\varepsilon) away in the energy-constrained diamond norm, defined using the full trace norm and a signal-energy budget (E_s). This guarantee includes inputs entangled with an unrestricted reference system. The physical probes are fresh coherent states with classically chosen amplitudes. Adaptive choices, retained quantum outputs and a final joint measurement are allowed. Every device call, including a vacuum pulse, is counted, and the actual illumination obeys [\sum_{t=1}^{T}\mathbb E_{\mathcal K}|\alpha_t|^2\le T E_p] under every channel in the testing promise. The probe budget (E_p) is distinct from the signal budget (E_s) defining the certification guarantee. Optimal mean-energy query laws. For fixed positive (E_s,E_p), fixed finite mode number (m), and both testing errors at most (\delta), the minimax number of calls satisfies [T_{\mathrm{mean}}^{(1)}(\varepsilon,\delta)=\Theta_{E_s,E_p}!\left(\varepsilon^{-4}\log\frac1\varepsilon\log\frac1\delta\right),] [T_{\mathrm{mean}}^{(m)}(\varepsilon,\delta)=\Theta_{m,E_s,E_p}!\left(\varepsilon^{-(2m+2)}\log\frac1\delta\right),\qquad m\ge2.] The bounds hold for sufficiently small (\varepsilon), uniformly over (0<\delta\le1/4). Independent probes drawn from a physical positive multiscale source, followed by individual binary target tests, attain these orders. The matching converse covers adaptive coherent-probe protocols with quantum output memory. Thus those additional processing capabilities do not improve the asymptotic order within the stated preparation model. The result specifies matching scaling laws, rather than exact finite-query counts or optimal numerical constants. Why one mode has an extra logarithm. Rare high-photon coherences can strongly affect an energy-bounded quantum input while leaving only a weak signature on coherent probes. The proof retains this interference through a positive coherent-frame Green kernel. Its spectral sum grows as (t\log t) for one mode and as (t^m) for fixed (m\ge2). A complementary family of physical channels shows that the single-mode logarithm is necessary, rather than an artifact of the reconstruction bound. What source brightness changes. The optimal mean-only laws contrast with prescribed independent Gaussian modulation, for which (\log T_{\mathrm G}=\Theta(\varepsilon^{-2})) at fixed confidence. A fixed brightness cap gives (\log T_{\mathrm{cap}}=\Theta(\varepsilon^{-2}\log(1/\varepsilon))). The article also establishes matching logarithmic orders under stretched-exponential brightness constraints and develops the conversion from average coherent-probe error to thermal Choi-state and energy-constrained worst-input guarantees. These are worst-case certification limits for the specified coherent-probe access model. The channel class retains infinite photon tails and imposes no output-energy bound. This updated, integrated 37-page article contains the main results, two figure groups, complete proofs and references.
How can coherent light be certified when its amplitude is unknown or its preparations are correlated? This article treats these as distinct inference problems: learning an actual coherent reference with optimal source-copy cost for independent identical inputs, and certifying the photon-counting predictions of the light left unused in a preprepared correlated batch. Optimal source-copy cost with a learned reference. For a normal one-mode source prepared independently and identically, an ideal passive multiport test and heterodyne readout produce an actual amplitude α^. After displacement by this reference and ideal quantum-limited amplification of fixed gain G>1, let Pρ,α^G be the photon-number distribution and πG(k)=(G−1)k/Gk+1 the coherent benchmark. The task-specific comparison is G1−⟨α^∣ρ∣α^⟩≤TV(Pρ,α^G,πG)≤1−⟨α^∣ρ∣α^⟩. With at most N input copies, the protocol controls the unconditional event of accepting a reference whose actual total-variation error exceeds ε. For 0<ε<1/2, soundness error βs→0, and fixed coherent-source rejection tolerance βc<1, the optimal fixed-maximum source-copy count obeys log(1/βs)Nopt[−log(1−ε)]⟶1. The matching converse covers collective and adaptive protocols under the same source-copy contract. At 1% accuracy and 5% soundness and completeness errors, the finite bounds are 293≤Nopt≤572. These are source-copy bounds under ideal optical access, not an optimum for total hardware or reference energy. The actual unmeasured batch after the full record. A separate protocol allows an arbitrary preprepared correlated or entangled optical batch, including correlations with an environment. A pilot first fixes the reference; a private random subset is then tested. A multiplicative sampling inequality yields a frequentist guarantee for the average marginal photon-count error of the retained conditional state, conditioned on the complete actual measurement record. It does not replace that state by premeasurement marginals or assert the same error for its full joint distribution. The trusted detector contract requires product joint test effects and local instruments that leave retained systems and the external environment untouched. Calibration envelopes must cover the actual signal-time gates. The bounds retain infinite photon tails and charge detector efficiency, dark counts, imperfect displacement, reference drift and calibration failure. Explicit counterexamples explain why marginal detector efficiencies or product effects alone are insufficient. An ideal finite example uses 3730 prepared systems: 1491 pilot, 1339 tested and 900 retained; calibration and optical-control resources are additional. Relation to the original two-copy result. The earlier mean-energy-controlled arm-swap cancellation and full trace-distance certificate remain valid for independent, possibly nonidentical product batches. Their source and target are kept separate from the new arbitrary-batch marginal PNR guarantee. The analysis builds on established coherent-state comparison, quantum verification and sampling identities; the new connections supply the learned-reference resource law and the full-record conditional-state return. Version 1.1 is a substantial update of Certifying unused optical states with imperfect two-copy interference, first published on 31 October 2026. The integrated 24-page PDF contains three figure groups, a source-and-target comparison table, complete proofs and references. The figures illustrate proved bounds and specified theoretical protocols, not experimental measurements.
What should an optical memory retain when only a limited amount of source information can be kept? This paper gives the complete quantum information frontier for a fixed Gaussian source and relevance channel, and identifies when a single retained qubit preserves correlations that every classical record loses. It also turns that advantage into a concrete test of whether received light belongs to its stored source preparation. The physical experiment and the complete frontier A fixed Gaussian state on A is prepared with its actual purifier C. A normal encoder acts on C to produce memory M, while a prescribed Gaussian channel maps A to the relevant optical output B. The source-information cost and useful correlation are r=I(A:M) and v=I(B:M), respectively. All logarithms are natural. The paper determines CQ(R)=supN:I(A:M)≤RI(B:M). For every fixed faithful finite-mode Gaussian source and finite-mode Gaussian relevance channel, optimization over arbitrary normal quantum encoders reduces to Gaussian supporting values and a mixture of at most two Gaussian branches. The branch flag is physically retained. The unrestricted frontier is a supremum with no imposed memory dimension or memory-energy cap; an explicit finite approximation gives an error uniform in the information budget. Hard finite-dimensional implementations are treated separately. Why one qubit can preserve the leading low-brightness information For a thermal source with mean photon number n and a thermal attenuator with transmissivity 0<η<1, write the output occupation as ηn+b, where b≥0 is the environment's added thermal occupation. With g(x)=(x+1)log(x+1)−xlogx, the exact optimum over all normal classical records is Ccl(n,R)=g(ηn+b)−g(ηuR+b),uR=g−1(max{g(n)−R,0}). A legal encoder applies vacuum loss with transmissivity λ to the purifier and then coherently retains two levels, resetting the entire higher-photon tail. For fixed b>0 and 0<λ<1/2, at the common budget Rn=g(n)+g(λn)−g((1−λ)n), its actual relevance satisfies v2=1+bηλnlog(1/n)+O(n),Ccl(n,Rn)=2ληlog(1+1/b)n+O(log(1/n)n). The full optical tail is included in the resource accounting. At n=0.01, η=b=0.5, λ=0.2 and R=0.023875, the certified predictive-mutual-information advantage exceeds 85%. The leading correlation is quantified by memory-side discord and can survive when the final output–memory state is separable. The vacuum-environment endpoint is evaluated separately for the same encoder. A same-resource correlation decision The receiver distinguishes matched source pairs from independent systems with identical marginals. For k uses, the retained predictive memory obeys dimKk≤2k and I(Ak:Kk)≤kR, including all retained flags. Both competitors may make arbitrary joint binary measurements on the received optical modes and their retained memory. The received modes are common observation access, outside the predictive-memory cap. Let αk be the missed-correlation probability and βk the false-match probability. For every classical block encoder, even with an unrestricted classical alphabet, the fixed-error converse is αk≤ϵ⟹βk≥exp[−1−ϵkcnR+log2],cn=ηlog(1+1/n)log(1+1/(ηn+b)). At the finite parameters above and ϵ=0.1, the product-qubit encoder achieves an asymptotic false-match exponent of 0.0049 nats per pair, whereas every classical block strategy has exponent below 0.003138386231. This uses one qubit per source pair and identical measurement permissions. It is an asymptotic discrimination guarantee, distinct from the 85% single-copy information comparison; it specifies neither a finite-sample threshold nor a laboratory receiver circuit. The integrated paper contains the complete proofs, resource accounting and figures. The exact thermal classical comparator, the finite-memory construction and the block-testing connection have explicit proof dependencies separate from the general Gaussian-frontier reduction.
This work gives a resource law for engineering optical noise: how many photons must a single environment mode contain to prevent any signal from producing an output that is too spectrally concentrated? It provides an explicit optimal bath preparation, a matched Gaussian benchmark, and separately proved guarantees for correlated repeated use. Exact photon cost of a spectral noise guarantee A signal mixes with an independently prepared bath σ at a beam splitter of signal transmissivity η. The requirement is Φη,σ(ρ)≤cIfor every normal input state ρ,0<c<1. Equivalently, every rank-one output projection has probability at most c and the receiver's output min-entropy is at least −lnc. Inputs may be mixed, non-Gaussian, arbitrarily energetic, and have infinite photon tails. Let d=⌈1/c⌉−1. Throughout 0<η≤1/⌈1/c⌉, the minimum mean photon numbers of the actual bath are Nall(c,η)=1−ηd−cd(d+1)/2.NG(c,η)=1−ηc−1−1. The first optimization includes all normal bath states and has a unique finite-support minimizer. The second includes all Gaussian density operators, with arbitrary squeezing and displacement; a centered thermal bath attains it. The coupling and spectral requirement are identical in both comparisons. At c=1/j, for every integer j≥2 and 0<η≤1/j, NG(1/j,η)=2Nall(1/j,η). Between reciprocal budgets the ratio varies. The cost counts mean photons in the physical bath, not laboratory preparation work or the energy of an auxiliary purification. A physical preparation and its complete single-use spectrum Writing r=1−dc, the attaining vacuum-output spectrum is λ∗=(d entriesc,…,c,r). It majorizes every output of the same channel, so the minimum von Neumann entropy is exactly Smin(Φη,σ)=−dclnc−rlnr. The other positive-order Rényi minima are fixed by the same spectrum. Coherent inputs attain these minima. The proof identifies an actual optical dilation whose port antisymmetry enforces the all-input occupation bound. Exact examples also show that baths with identical energy and covariance can have different optimized entropy floors. What survives entangled repeated use For the same resource-optimal flat-output families of ranks j=2,3,4, separate estimates prove Sout≥mlnj for every finite number m of uses and arbitrary normal joint inputs, including cross-use entanglement. The environments vary with η along their specified families. Further results give sharp tensorized purity bounds for the entire three-level diagonal bath simplex and for every Fock environment at balanced coupling. The paper then treats a different, fixed bath, σ=∣1⟩⟨1∣, at every 0<η<1. With h(η)=−ηlnη−(1−η)ln(1−η), it proves: Exact Sout≥mh(η) at arbitrary finite blocklength for joint inputs invariant under each local photon-number phase rotation by 2π/q, q≥4. Coherence and entanglement within residue sectors and infinite tails remain allowed. The residue-zero restricted channel also has strong minimum-output-entropy additivity with arbitrary normal partner channels. The same exact entropy floor for up to three globally total-phase-invariant input modes, without a mean-energy limit. Sout≥Mh(η)−o(M) for physical-mode permutation-invariant inputs of finite mean energy density, with explicit errors and full infinite-tail control. For every fixed m and interior η, all outputs remain a uniformly positive trace distance from every state of rank below 2m, without any input-energy bound. This covers nonbalanced parameters where the older purity-based distance bound vanishes; the new positive constant is spectrally implicit. Interpretation and scope The input classes above are not nested, and an entropy rate, a finite-block entropy floor and a low-rank distance are distinct guarantees. The fixed single-photon bath is not generally the resource-optimal bath. Complete unrestricted nonbalanced single-photon entropy additivity and exact classical capacity remain open. A spectral noise guarantee constrains output mixing; it does not mean that all input information or reference correlations are erased. The article separates this issue through actual resolved-erasure qubit restrictions, antidegradability of the specified optimal reciprocal families, and a classical capacity bracket under a true signal-energy budget. The integrated 52-page article contains six scientific figures, the complete proofs, and the mathematical data needed to reconstruct its finite certificates. Logarithms and entropy values use natural units unless bits are explicitly stated.
How much quantum information must a sequential optical test retain, and how reliably must that information survive between source preparations? This paper gives preparation budgets and impossibility bounds that distinguish useful quantum storage from regimes where the classical sample order is unavoidable. Optical source and fully counted memory A fixed unknown normal state supplies independent, identical preparations on m bosonic modes. The null consists of all pure Gaussian states with total mean photon number at most one. Alternatives have half trace distance at least 1/32 from every pure Gaussian state; neither their energy nor the comparison family's energy is capped. Mixed states and infinite photon tails are included. Each visit accesses one entire original once. The total quantum dimension retained between visits is at most D, while classical records and computation are unrestricted. At every actual waiting interval, the entire register independently survives unchanged with known probability a, or is erased with a classical flag. The quantity ka(D,m) is the smallest deterministic original-preparation cap achieving worst-case error at most 1/3. Failed preparations, discarded trials and reserved positions are all charged. A retained register of q qubits has D=2q. An exact threshold for statistical advantage Without retained quantum information, the optimal sample order is Θ(m). Along arbitrary growing-mode sequences, the precise criterion for improving that order is ka(D,m)=o(m)⟺am→∞andmaD→∞. The two conditions express separate capacity and survival requirements. Arbitrarily large storage cannot reduce the linear sample order when a=O(1/m), yet a survival probability tending to zero can still permit an advantage. Let A=max{1,m2/D}. At the fixed energy and separation above, constants c,C>0, independent of m,D,a, give cmin{m,A/a}≤ka(D,m)≤Cmin{m,A/a+min(a−2,m2/3)},0<a≤1. At a=0, the sample cost is Θ(m). For ideal memory the complete rate is k1(D,m)=Θ(min{m,max(1,m2/D)}). With loss, the bounds match whenever A≥min{a−1,am2/3}. For example, a=m−1/6 and D=⌈m11/6⌉ give Θ(m1/3) preparations. The existence of sublinear advantage is fully characterized even where its optimal exponent remains bracketed: for D≥m2, a=m−1/2, the stated bounds are Ω(m1/2) and O(m2/3). Why the construction and converse fit the same resources A physical completely positive contraction combines first- and second-moment information before the next wait. Although the temporary pair output has order m2 labels, only a positive register of dimension m+1 is retained. The three-visit route requires D≥m+1 and pays two actual survival events; a classical alternative handles the centering statistics. The converse covers arbitrary adaptive instruments and persistent noncommuting memory. Erasure removes the coherent prediction contribution while preserving information already learned in the full classical history. Unflagged noise and applicability For a fixed memoryless channel on the entire retained register with a physical reset decomposition N=aΨ+(1−a)Rτ, where Ψ is CPTP and Rτ(X)=Tr(X)τ, an exact flagged-erasure simulation gives kN(D,m)≥ka(D,m). The established positive quantum Doeblin coefficient optimizes this lower obstruction. Whole-register depolarizing noise with unchanged fraction 1−q=O(1/m) therefore forces Θ(m) samples for every memory dimension. General unflagged noise inherits a converse, not the flagged model's complete achievability guarantees. The results quantify asymptotic preparation and persistent-memory resources under ideal visit-local control. Temporary auxiliary systems and gate complexity have no imposed budget, and the explicit sufficient finite-sample constants are conservative. The task is pure Gaussianity testing, rather than membership in the full family of mixed Gaussian states. The single integrated PDF contains the short main text, full proofs, four figures and precise resource accounting.
Quantum illumination uses a retained idler to improve detection of a weak optical return in thermal noise. For a source designer, the practical resource question is how much ideal quantum storage is needed for a specified improvement. This work gives the exact asymptotic answer when the signal-photon budget and the total retained-register dimension are constrained independently. Exact finite-memory frontier Consider a thermal attenuator with transmissivity 0<η<1 and vacuum-output background occupation b>0, tested against the replacer that returns the same thermal state. For n parallel uses, every admissible probe obeys a mean total signal-photon ceiling nN and a strict bound dimR≤⌊enP⌋ on the entire retained register, including retained source records. The memory rate is P/ln2 ideal qubits per use. With vanishing miss probability, the optimal false-alarm exponent is Ξ(N,P)=ηln(1+1/b)N+G(min{P,g(N)}). Here all logarithms are natural, g(x)=(x+1)ln(x+1)−xlnx, with g(0)=0, and G(p)=g(b)+p−F(g−1(p)). The function F(x) is the entropy of the full complementary output for a thermal input of mean occupation x; the complement includes the purification of the thermal environment. The first term in Ξ is the optimum without retained memory, and G is the additional detection benefit. The converse covers arbitrary normal mixed probes, correlations across channel uses and collective measurements. Matching sources satisfy the actual finite-register and energy bounds: they allocate photons between signal–idler correlations and a known displacement, and approach the frontier through finite-support preparations. How much storage is useful? The exact saturation rate and initial marginal value are Psat(N)=g(N),G′(0+)=1+bη. Because G is strictly increasing and strictly concave, at a positive signal budget N>0 the minimum rate retaining a fixed fraction 0<r<1 of the full additive memory benefit is Pr(N)=G−1(rG(g(N)))<rg(N). At low brightness, Pr(N)∼rg(N). At high brightness, this fixed-fraction storage cost remains bounded while the exact-saturation cost diverges. The relative detection benefit simultaneously tends to zero: saving a large fraction of the saturation storage does not imply a large improvement over the total no-memory exponent. Connection to optical communication For the same thermal channel, let C(N,P) denote the classical capacity under the corresponding photon budget and a strict initial maximally entangled Schmidt-rank supply. The two separately defined tasks satisfy Ξ(N,P)−Ξ(N,0)=C(N,P)−C(N,0). This identity equates optimized incremental values, not the physical resources or protocols. The manuscript explicitly attributes the shared Gaussian-reference contraction and entropy-support tools to the capacity analysis. Its detection-specific contribution is the original-register mixed-probe converse, strict finite-register attainment and operational testing limit. Scope. The result concerns parallel, phase-known thermal attenuation, ideal retained storage and the vanishing-miss Stein criterion. It is an asymptotic resource benchmark rather than a finite-sample receiver or a noisy-memory optimum. The integrated article includes the complete proofs and two figure groups showing both storage cost and the value obtained from it.
How far can an amplifier's complete photon-count record depart from its coherent-light reference when the output entropy and the source's mean-photon budget are known? This article determines sharp endpoint laws for that inference. Photon counting reads occupations, but coherence changes the entropy cost of producing those occupations; the available energy budget selects the most efficient coherent pattern. A common physical comparison. For one optical mode, let μ=Tr(aρ), ρc=D(−μ)ρD(μ), and Ec=Tr(Nρ)−∣μ∣2. The reference is the source's actual field mean. For the quantum-limited amplifier A2 of gain two with a vacuum auxiliary mode, define Δ(ρ)=g−1(S(A2ρ))−1,T(ρ)=21∑k≥0⟨k∣A2(ρc)∣k⟩−2−k−1, where S is von Neumann entropy in nats and g(x)=(x+1)log(x+1)−xlogx. Thus Δ is an output quantum-entropy excess expressed in photon units, rather than the Shannon entropy of the observed counts. The constrained frontier is FE(δ)=sup{T(ρ):Ec(ρ)≤E,Δ(ρ)≤δ}. Three sharp endpoints. For every fixed finite E>0, FE(δ)=169δ+o(δ),δ↓0. Weak squeezing attains this coefficient. The corresponding local ratio also holds on every fixed finite number of modes, using the complete joint count record and the total entropy photon-number excess. Its neighbourhood may depend on the fixed mode count and energy budget. For centred mean-photon budgets m=1,2, put Λm=1−2−m and δmsat=g−1(S(A2(∣m⟩⟨m∣)))−1. The exact saturated frontier is Fm(δ)=Λm for δ≥δmsat, and its approach from below obeys Fm(δ)=Λm−cm(δmsat−δ)+o(δmsat−δ), with c1≃0.73151177, c2≃0.16207193, δ1sat≃0.92689630, and δ2sat≃1.70174873. The article gives exact expressions and certified numerical enclosures. Mean-cancelling vacuum/one-/two-photon superpositions attain the first saturation slope; phase-aligned zero-/two-/four-photon superpositions attain the second. The pure-state and full mixed-state optimizations have the same endpoint coefficients. Scope and mechanism. The budgets constrain centred mean energy, not the maximum photon number in each preparation. The proofs retain arbitrary normal mixed states and moving infinite photon tails. They combine uniform entropy comparisons with a decomposition that keeps the coherent part and mixed remainder tied to the same physical source. The endpoint laws concern a fixed ideal channel and its full count distribution; learning the reference and estimating entropy require separate measurement resources. The intermediate frontiers are not interpolated or claimed to be globally solved. This independent article complements entropy-minimization and single-event no-click bounds by treating the complete count law with actual-mean compensation. The integrated 27-page PDF contains four figure groups, complete proofs, reconstructible coefficient certificates and references.