Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Arbitrary-order suppression of source mismatch in photonic entanglement swapping

Annan Chen

Published Nov 12, 2026• 0 citations
PDF (CC BY)Publisher

Abstract

Abstract We establish the minimum number of same-source photons needed for arbitrary-order suppression of source mismatch in photonic entanglement swapping and construct a static passive circuit family that attains it. The result applies to unencoded photons, optics that act identically on all internal states, complete photon-number-resolving detection, and local-unitary recovery of the retained qubits. For two pure source wave packets with squared overlap $u$, suppressing the bare mismatch error $\epsilon=(1-u)/2$ to order $\epsilon^r$ at nonzero ideal success probability requires at least $r$ photons from each source. A cyclic interferometer attains the minimum total of $2r$ photons at every order, with ideal acceptance $2^{2-3r}$. An exact transfer expression extends the calculation to distinct wave packets and correlated classical source noise. Near a common wave packet, the leading error is proportional to the summed delayed Hong--Ou--Mandel losses along a closed tour through each source's emissions. For equally spaced emissions, losses that increase concavely with delay select chronological wiring, whereas convex growth selects a folded order; independent fluctuations add the same leading penalty to every wiring. In a Gaussian drift model, folding lowers the smallest reachable error in the compared catalogs by about $23\%$ without adding photons. Including detection, storage, and routing losses, the photon-cost advantage depends on the target and is largest in a narrow target window; at target error $4.35\times10^{-4}$, the pooled cost is lower by a factor of about $5.6$ with equal acceptance and randomization options in both catalogs. A common spectral filter is cheaper in this finite-noise example; a separate pure-source analysis gives a regime with a better cyclic cost exponent.

DOI
10.21203/rs.3.rs-11694496/v1

Related papers

Fidelity limits and purity requirements for entanglement swapping with one auxiliary photon

Annan Chen

Internal-state mismatch limits heralded entanglement swapping. We determine the limits of using one independent auxiliary photon (a helper) with passive optics acting identically on every internal state, complete photon counting and deterministic local recovery. For pure data states of overlap $0<c<1$, put $t=1-c$. Optimizing over the helper and all allowed finite networks reduces the minimum Bell error from $(1-c^2)/2\sim t$ without a helper to $t^2/(2-c+2c^2)\sim t^2/3$. Attaining this minimum requires a pure midpoint helper and three equally spaced logical Bloch directions (a trine); the largest single-record probability at equality is $(2-c+2c^2)/72$. For a mixed helper supported on the data-state span, let its eigenvalues be $(1\pm r)/2$ and $\eta=1-r$. Under a complete-record probability floor $p\ge p_0$, with fixed $0<p_0<1/64$, the optimal error has order $\min\{t^2+\eta,t\sqrt{t+\eta}\}$ as $t,\eta\to0$. Quadratic suppression is possible precisely when $\eta=O(t^2)$, requiring an ideal Hong--Ou--Mandel helper self-visibility deficit of quadratic or smaller order in the data-visibility deficit. When $\eta$ is proportional to $t$, exchange-invariant helpers leave linear error, whereas a tilted helper and a real eight-mode network attain the optimal order $t^{3/2}$. The converse follows from compatibility of the optical amplitudes shared by all photon assignments. The same order holds for local unitaries, deterministic local operations and classical communication, and deterministic separable recovery, and for the average over a bounded number of accepted records at nonvanishing total acceptance probability.

•Nov 5, 2026•0 citations

Optimal entanglement swapping with one auxiliary photon: exact fidelity limit and purity requirements

Annan Chen

Abstract Wave-packet mismatch in entanglement swapping leaves which-source information and lowers the fidelity of the heralded remote pair. We determine the exact correction achievable with one independent auxiliary photon. For pure data photons with amplitude overlap c, every finite static passive network acting identically on internal states, followed by photon counting and deterministic local recovery, yields conditional Bell fidelity at most (1 + c + c2)/(2 − c + 2c2). A five-mode circuit with four two-mode mixings attains this limit and converts first-order mismatch error to second order, whereas circuits with at most three mixings in the logical-mode basis cannot exceed (1 + c)/2. At two-photon visibility 0.98, a pure auxiliary reduces the error from 1.0 × 10−2 to 3.4 × 10−5 at heralding probability 0.041. For mixed auxiliary states supported on the span of the data wave packets, quadratic suppression is possible if and only if the purity deficit vanishes at least quadratically in the mismatch. We establish a matching error law at fixed positive heralding probability. With data visibility 0.90 and auxiliary-copy visibility 0.99, the aligned circuit reduces Bell error 6.6-fold. A centered Gaussian auxiliary of optimized width preserves the optimal leading error.

•Nov 13, 2026•0 citations

Mode-mixing threshold for quadratic error suppression in entanglement swapping

Annan Chen

Partial distinguishability limits linear-optical entanglement swapping. For pure data packets with overlap $0 < c < 1$, static, internal-state-blind passive optics and spatial photon-number-resolving detection leave an unassisted conditional Bell error of at least $\epsilon = (1-c^2)/2$. We prove that a single independent auxiliary photon (the helper) cannot eliminate this first-order error using three or fewer two-mode mixings: the error remains at least $\epsilon/(1+c)$, even with an optimized helper, finite vacuum extensions and deterministic single-copy local operations and classical communication on the retained qubits. A fixed five-mode circuit with four mixings beats this bound for every $c$. Preparing the helper in the normalized sum of the phase-aligned data packets yields a selected record with probability $(2-c+2c^2)/72$ per supplied trial and error $(1-c)^2/(2-c+2c^2) = \epsilon^2/3 + O(\epsilon^3)$. At $c = 0.99$ (two-photon visibility 0.9801), the error is $3.4 \times 10^{-5}$, compared with $1.0 \times 10^{-2}$ without a helper and $5.0 \times 10^{-3}$ for the best three-mixing circuit. A non-polarizing beam splitter, a partially polarizing beam splitter and a half-wave plate implement the four mixings in polarization encoding. The target Bell weight is proportional to the fully symmetric three-photon internal-state weight. For symmetric depolarized-qubit sources, we derive the exact helper-optimized three-mixing ceiling and a unique impurity threshold for each $0 < c < 1$; stochastic impurity contributes at first order. We also give the fixed-instrument acceptance frontier, the calibration floor, and comparisons with two helpers and internal-mode filtering, which achieves higher heralding rates in the Gaussian scenarios studied.

•Oct 29, 2026•0 citations

Classical communication with an exact photon budget: finite-block limits and optimal input ensembles

Zixuan He

What can be transmitted with a fixed photon supply? An optical source that supplies exactly K photons across n modes poses a concrete communication problem: how many messages can it transmit at a chosen error probability, and which input states make the best use of those photons? This paper gives directly evaluable coding bounds for pure loss and identifies the exact optimal input ensembles for identical noisy Gaussian channels. The results allow researchers to assess finite optical blocks, quantify the information cost of fixing the photon supply, and determine when entanglement between separately constrained blocks can be dispensed with. Every message is supported on the same exact K-photon sector. Within that sector, encoding may use arbitrary mixed states and entanglement among modes, and the receiver may perform a joint measurement. Communication is unassisted. All logarithms below are natural; information is measured in nats. Finite-message bounds and the optimal third-order rate For n ≥ 2 identical pure-loss channels of transmissivity 0 < η < 1 and K ≥ 1, the number L of surviving photons has the same binomial distribution for every encoded state. Define \[p_\ell=\binom K\ell\eta^\ell(1-\eta)^{K-\ell},\qquad d_{n,\ell}=\binom{n+\ell-1}{\ell}.\] If ps*(M;n,K) is the best average success probability for M equiprobable messages, then \[\sum_{\ell=0}^{K}p_\ell\left[1-\frac{M-1}{d_{n,\ell}}\right]_+\le p_{\mathrm s}^{*}(M;n,K)\le\sum_{\ell=0}^{K}p_\ell\min\!\left\{1,\frac{d_{n,\ell}}{M}\right\}.\] Here [x]+ = max{x,0}. The lower bound provides an achievable guarantee; the upper bound limits every admissible code. Evaluating both sums brackets the performance at a specified photon supply and block length. Their proof has a simple physical interpretation: surviving photons determine the available output dimension, while one collective-mode codebook works across all possible survivor counts. For fixed E > 0, fixed error tolerance 0 < ε < 1, Kn = ⌊nE⌋ and en = Kn/n, the bounds determine the largest message count through third order: \[\log M^*(n,K_n,\varepsilon)=ng(\eta e_n)+\sqrt{n\eta(1-\eta)e_n}\,h(\eta e_n)\Phi_{\mathrm N}^{-1}(\varepsilon)-\tfrac12\log n+O(1).\] Here g(x) = (x+1)log(x+1) − x log x, h(x) = log(1+1/x), and ΦN is the standard normal distribution function. This fixes both the fluctuation scale and the optimal −½ log n correction. The finite bounds also yield the exact decay exponent of success above capacity and a matching error exponent on a specified interval below capacity. Which inputs are optimal under Gaussian noise? For n identical nonidentity gauge-covariant Gaussian channels, with thermal photon means transformed as r ↦ ar+b, a > 0 and b ≥ max{0,a−1}, the paper determines the exact fixed-photon Holevo optimum and every ensemble attaining it. Each optimal letter places all K photons in one collective mode: \[|K,u\rangle=\frac{\left(\sum_{j=1}^{n}u_j a_j^\dagger\right)^K}{\sqrt{K!}}|0\rangle,\qquad \sum_j|u_j|^2=1.\] An ensemble is optimal precisely when almost all its letters have this form and its average is uniform on the K-photon sector. A finite weighted optimal ensemble exists. These collective modes may themselves extend across, and be entangled among, physical optical modes. Thus the characterization identifies the structure to optimize without imposing a Gaussian-input restriction. The central proof step combines different loss histories that end in the same output photon sector. A common ordering of the comparison eigenstates allows the separate majorization bounds to be combined. For pure loss, a quantitative rigidity estimate further converts a small Holevo deficit into closeness to collective-mode number states. Resource cost and communication across blocks At fixed positive photon density and fixed nonidentity Gaussian noise, requiring an exact photon supply incurs a Holevo penalty of ½ log n plus an explicitly determined constant, relative to the usual mean-energy value. The paper separates this cost into photon-count uncertainty and the mismatch from a thermal output distribution. For separately constrained blocks of quantum-limited loss, quantum-limited amplification or entanglement-breaking Gaussian noise, the one-block Holevo values add exactly. Every optimal letter is a product of blockwise collective-mode number states, and the repeated-block unassisted classical capacity equals the one-block Holevo value. The low-rate reliability interval outside the matching range and repeated-block additivity for intermediate Gaussian noise remain open.

•Oct 13, 2026•0 citations

The photon cost of detecting weak optical dephasing

Zixuan He

How many uses of an optical channel are required to detect weak phase noise when only the actual mean number of submitted photons is bounded? This paper determines the optimal fixed-confidence order, including every causal protocol with quantum memory and feedback. The two hypotheses are ideal transmission and independent Gaussian phase diffusion of known variance \(\gamma>0\). In the photon-number basis the noisy channel is \[\mathcal G_\gamma(|n\rangle\langle\ell|)=e^{-\gamma(n-\ell)^2/2}|n\rangle\langle\ell|.\] A protocol has at most \(T\) channel calls. Under each hypothesis separately, the sum of unconditional mean photons submitted over all calls is at most \(TE\). Reused photons are charged on every submission, including failed or discarded branches. Inputs may be arbitrary normal states with infinite photon tails, entangled across calls and with retained reference systems. Let \(T_\delta^{\mathrm{causal}}(E,\gamma)\) be the minimum call count for both decision errors to be at most a fixed \(0<\delta<1/2\). For \(0<\gamma\le1\) and \(0<E\sqrt\gamma\le1/4\), \[T_\delta^{\mathrm{causal}}(E,\gamma)=\Theta_\delta\!\left((E\sqrt\gamma)^{-1}\right).\] The explicit bounds are \[\frac{\sqrt2[1-2\sqrt{\delta(1-\delta)}]}{E\sqrt\gamma}\le T_\delta^{\mathrm{causal}}(E,\gamma)\le\left\lceil\frac{\log(1/\delta)}{b_0E\sqrt\gamma}\right\rceil,\qquad b_0=\tfrac34(1-e^{-1/2}).\] A common-environment overlap bound charges each loss of fidelity to the two actual hypothesis-dependent photon budgets, giving the converse even with causal feedback. Independent vacuum–Fock superpositions with \(n=\lceil\gamma^{-1/2}\rceil\), photon probability \(p=E/n\), and immediate binary measurements attain the order. The powers match at fixed confidence; the numerical constants and vanishing-error dependence are distinct. The paper also separates information measures under the same mean-only constraint. The maximum single-use Umegaki relative-entropy disturbance, allowing any reference on a separable Hilbert space, is of order \(s\log(1/s)\) for \(s=E\sqrt\gamma\downarrow0\) in the stated regime. The corresponding energy-constrained Belavkin–Staszewski divergence is infinite. The entropy statement concerns single-use disturbance, while the detection theorem covers complete causal strategies. Vacuum–Fock probes and their actual photon accounting are inherited from established dephasing-discrimination work; the matching causal converse and reusable overlap and fractional-moment controls are developed with their full resource conditions. Retained memory and controller complexity are unrestricted. The integrated 11-page PDF contains two figures, complete proofs and eight references.

•Oct 29, 2026•0 citations

Distinct stability laws for Wigner entropy and non-Gaussian structure

Zixuan He

Loss can restore the vacuum entropy bound without erasing non-Gaussian structure. This paper determines when an entropy statement justifies a coherent-state approximation, when non-Gaussian structure survives optical loss, and what mode and source-request budgets are needed to use that structure. The results give quantum-optics researchers separate criteria for entropy recovery, state approximation, Gaussian concentration and conversion to a specified output. Version 1.5 — revised 10 October 2026. The 96-page PDF contains the main article, Methods, Supplementary Information and references. This revision connects the exact loss boundary to a mode-uniform near-equality certificate, finite-data validation, a conversion-cost lower bound for the same thermally repaired source, and an exact equal-entropy comparison of sources with different conversion-cost exponents. The central figures are updated accordingly. 1. Near-vacuum states can have an unbounded entropy deficit Write $\nu_m$ for the $m$-mode vacuum and define $\Delta_{\alpha,m}(\rho)=H_\alpha(W_{\nu_m})-H_\alpha(W_\rho)$, using natural logarithms; $H_1$ is Shannon entropy. Positive deficit means entropy below vacuum. We construct physical Wigner-positive states satisfying, simultaneously, $$E_m=\operatorname{Tr}(N_m\rho_m)\to0,\qquad \tfrac12\|\rho_m-\nu_m\|_1\to0,\qquad d_{\mathcal F_m}(\rho_m)\to0,\qquad \Delta_{1,m}(\rho_m)\to+\infty.$$ Here $\mathcal F_m$ is the trace-norm-closed convex hull of Gaussian states and $d_{\mathcal F_m}$ uses half the trace norm. Thus proximity to the entire Gaussian model does not control Wigner entropy uniformly in mode number. Independent weak modes amplify a one-mode entropy effect while their total excitation vanishes. For the same sequence, half loss instead gives $-E_m\le\Delta_{1,m}(\mathcal L_{1/2}^{\otimes m}\rho_m)\le0$, so the entropy difference from vacuum tends to zero. 2. The exact pure-loss recovery boundary For Wigner-positive inputs, intensity transmissivity $\eta$ and any fixed positive total input-energy budget $E$, the sharp threshold is $$\eta_c(\alpha)=\begin{cases}1/2,&0<\alpha\le1,\\ \alpha/2,&1<\alpha<2.\end{cases}$$ With $\mathcal P_{m,E}=\{\rho:W_\rho\ge0,\ \operatorname{Tr}(N_m\rho)\le E\}$, $$\sup_{m\ge1}\sup_{\rho\in\mathcal P_{m,E}}\Delta_{\alpha,m}(\mathcal L_\eta^{\otimes m}\rho)=\begin{cases}0,&\eta\le\eta_c(\alpha),\\+\infty,&\eta>\eta_c(\alpha).\end{cases}$$ The recovery statement includes the boundary itself and is independent of mode number. Half loss also restores vacuum majorization for arbitrary density operators. For $\alpha\ge2$, established Wigner-norm bounds give the vacuum entropy bound at every transmissivity for Wigner-positive outputs. These statements distinguish a universal guarantee from the earlier sign crossing that a particular source may exhibit. 3. Near equality gives a certificate for the entire input For an arbitrary input $\rho$, define the half-loss output Shannon excess $$s(\rho)=h(W_{\mathcal L_{1/2}^{\otimes m}\rho})-m(1+\ln\pi)\ge0.$$ The half-loss identity identifies this quantity with the input's total Wehrl entropy excess. Applying mode-uniform Wehrl stability yields $$\inf_a\|\rho-|a\rangle\langle a|\|_1^2\le\frac{64}{\ln2}\,s(\rho).$$ The bound controls the full input state, with no energy or photon-support restriction. One coherent reference then controls every subsequent quantum channel and every unconditional measurement event. In particular, an event-probability error at most $\epsilon$ is guaranteed by $s\le(\ln2)\epsilon^2/16$. Conversely, a surviving output Gaussian-hull gap enforces $$s(\rho)\ge\frac{\ln2}{16}\,d_{\mathcal F_m}(\mathcal L_{1/2}^{\otimes m}\rho)^2.$$ Recovery of the inequality and proximity to equality therefore support different physical inferences: the former permits residual non-Gaussian structure, while the latter certifies a coherent-state approximation. 4. Surviving structure has mode and conversion costs A thermally repaired vacuum–three-photon source with per-mode occupation $c/m$ has total input energy tending to $3c$. Along the recovery boundary, its attenuated state obeys $$\liminf_{m\to\infty}d_{\mathcal F_m}(\widetilde\rho_{m,\eta_c})\ge c\eta_c^3\exp\{-c[1-(1-\eta_c)^3]\}>0.$$ At half transmission this lower bound is $g(c)=(c/8)e^{-7c/8}$. Starting from one complete block, Gaussian processing requires $\Theta(m)$ output modes to retain any fixed positive gap below this bound at success probability at least a fixed $p_0>0$. Gaussian ancillary states, adaptive Gaussian measurements, feedback, discarding and postselection are included. A distinct task requests fresh independent blocks of this same half-loss source to produce the one-mode target $\tau_*=(18|0\rangle\langle0|+6|1\rangle\langle1|+|2\rangle\langle2|)/25$ within half trace distance $10^{-6}$. Let $C_m$ be the infimum of expected complete-block requests divided by success probability, including all failed requests. For fixed $0<c\le1$, every achieving Gaussian protocol obeys the asymptotic lower bound $$\log C_m\ge\frac1{128}(m/c)^{1/3}-\log m-O(1).$$ This is a source-request lower bound; the optimal achievable cost for this source remains undetermined. The proof evaluates a curvature-controlled input certificate for the actual thermally repaired state and applies the Gaussian conversion theorem of the companion paper cited below. 5. Exactly equal entropy does not fix conversion cost For two separate two-mode quartic source families, their mixture probabilities can be adjusted so that their half-loss Shannon entropies are exactly equal. Under a common target, tolerance and failure-inclusive accounting, the inherited matching conversion laws become $$h(W_{\omega_A})=h(W_{\omega_B})=2(1+\ln\pi)+s,\qquad \log C_A(s)=\Theta(s^{-1/3}),\qquad \log C_B(s)=\Theta(s^{-1/2}).$$ The target tolerance is held fixed in these asymptotics. The delivered energies after entropy matching satisfy $E_A,E_B\sim s/2$. At exactly equal energy, the two excesses instead share $s_i(E)=2E-(35/8)E^2+O(E^3)$ and differ by $s_A(E)-s_B(E)=15E^3+O(E^4)$. Entropy alone therefore cannot select the cheaper source for a fixed output task. 6. Finite data and finite mode budgets Under a declared displaced-input photon-tail bound $\operatorname{Tr}[N\mathbf1_{N>K}\sigma_a]\le\tau_K$, trusted half loss and all-mode on/off detection with efficiency at least $\xi_{\min}$, the click probability $q$ gives $$s(\sigma)\le A_Kq+\tau_K,\qquad A_K=\frac{K}{1-(1-\xi_{\min}/2)^K}.$$ A one-sided binomial bound turns this into an entropy confidence certificate. An explicit undisplaced four-photon-cutoff example uses $K=4$, $\tau_K=0$, $\xi=0.8$ and $N=3{,}517{,}336$ independent validation blocks, accepting at most 41 clicks, to certify unconditional event error at most $0.05$ with false-acceptance probability at most $0.001$ and missed acceptance at most $0.001$ on the stated low-click alternative class. All vacuum results count; training, calibration and source heralding are separate costs. When coherent-state approximation alone is the task, the same click measurement supplies a stronger direct fidelity test. The paper also gives all-input finite-budget exclusions above the loss-recovery line. For example, at $E=1$, $\alpha=1.9$, $\eta=0.9505$ and $m=10^5$, the certified bound $\Delta_\alpha<0.06942$ rules out a target deficit of $0.1$ nat. A separate finite single-mode preparation model predicts positive Shannon deficit near $\eta=0.97$, negative deficit near $\eta=0.85$, and a Gaussian-hull witness above $4.4\times10^{-3}$ at half transmission, with explicit preparation, measurement-error and raw-trial budgets in the PDF. 7. Dimensional scales, a strict entropy floor and ORCS Near order two, put $\alpha=2-\delta$ and $L=\ln(1/\delta)$. For the maximum deficit $D_{m,E}$ at fixed total energy, $$D_{m,E}(2-\delta)=\Theta_{m,E}(\delta/L)\quad\text{for fixed }m,\qquad T_h(\delta,E)=\Theta_{E,h}(L/\delta),$$ where $T_h$ is the first mode number allowing a fixed positive deficit $h$. Beyond a sufficiently large fixed multiple of $L/\delta$, $D_{m,E}(2-\delta)=\Theta_E(m\delta)$. The manuscript separates proved sufficient fronts from necessary exit bounds; the sharp first-crossing coefficient remains open. At every fixed mode number, an energy-unrestricted strict Shannon floor also holds: $h(W_\rho)\ge m\ln(2\pi)+\varepsilon_m$ with $\varepsilon_m>0$ for all Wigner-positive states. The ordering-resolved coherence spectrum (ORCS) supplies an exact single-mode loss coordinate. With $\mathcal C_{r,k}$ denoting the ordering-weighted norm of photon-number-difference block $k$, $$\mathcal C_{r,k}(\mathcal L_\eta\rho)=\mathcal C_{T_\eta(r),k}(\rho),\qquad T_\eta(r)=1-\frac{1-r}{\eta}.$$ For vacuum–$n$-photon coherence and $1<\alpha<2$, $$\mathcal C_{1-\alpha/2}(\mathcal L_\eta|n\rangle\langle0|)=\left(\frac{2\eta}{\alpha}\right)^n.$$ This formula exposes the high-order coherence mechanism at the loss threshold; the universal recovery result is proved through the full nonlinear Wigner-norm inequality. Related papers and history The counterexample paper Wigner entropy below vacuum: physical counterexamples and stability limits expands arXiv:2609.13312v1, submitted on 10 September 2026. This stability paper develops the dimensional, loss-dependent and operational consequences. Its state-approximation and conversion interfaces use the companion results From phase-space entropy to coherent-state error: mode-uniform Rényi–Wehrl stability and Phase records control the conversion cost of non-Gaussian light. The mode-retention comparison connects to Limits to Gaussian concentration of non-Gaussian light.

•Sep 23, 2026•0 citations
Abstract We establish the minimum number of same-source photons needed for arbitrary-order suppression of source mismatch in photonic entanglement swapping and construct a static passive circuit family that attains it. The result applies to unencoded photons, optics that act identically on all internal states, complete photon-number-resolving detection, and local-unitary recovery of the retained qubits. For two pure source wave packets with squared overlap uuu, suppressing the bare mismatch error ϵ=(1−u)/2\epsilon=(1-u)/2ϵ=(1−u)/2 to order ϵr\epsilon^rϵr at nonzero ideal success probability requires at least rrr photons from each source. A cyclic interferometer attains the minimum total of 2r2r2r photons at every order, with ideal acceptance 22−3r2^{2-3r}22−3r. An exact transfer expression extends the calculation to distinct wave packets and correlated classical source noise. Near a common wave packet, the leading error is proportional to the summed delayed Hong--Ou--Mandel losses along a closed tour through each source's emissions. For equally spaced emissions, losses that increase concavely with delay select chronological wiring, whereas convex growth selects a folded order; independent fluctuations add the same leading penalty to every wiring. In a Gaussian drift model, folding lowers the smallest reachable error in the compared catalogs by about 23%23\%23% without adding photons. Including detection, storage, and routing losses, the photon-cost advantage depends on the target and is largest in a narrow target window; at target error 4.35×10−44.35\times10^{-4}4.35×10−4, the pooled cost is lower by a factor of about 5.65.65.6 with equal acceptance and randomization options in both catalogs. A common spectral filter is cheaper in this finite-noise example; a separate pure-source analysis gives a regime with a better cyclic cost exponent.
Internal-state mismatch limits heralded entanglement swapping. We determine the limits of using one independent auxiliary photon (a helper) with passive optics acting identically on every internal state, complete photon counting and deterministic local recovery. For pure data states of overlap 0<c<10<c<10<c<1, put t=1−ct=1-ct=1−c. Optimizing over the helper and all allowed finite networks reduces the minimum Bell error from (1−c2)/2∼t(1-c^2)/2\sim t(1−c2)/2∼t without a helper to t2/(2−c+2c2)∼t2/3t^2/(2-c+2c^2)\sim t^2/3t2/(2−c+2c2)∼t2/3. Attaining this minimum requires a pure midpoint helper and three equally spaced logical Bloch directions (a trine); the largest single-record probability at equality is (2−c+2c2)/72(2-c+2c^2)/72(2−c+2c2)/72. For a mixed helper supported on the data-state span, let its eigenvalues be (1±r)/2(1\pm r)/2(1±r)/2 and η=1−r\eta=1-rη=1−r. Under a complete-record probability floor p≥p0p\ge p_0p≥p0​, with fixed 0<p0<1/640<p_0<1/640<p0​<1/64, the optimal error has order min⁡{t2+η,tt+η}\min\{t^2+\eta,t\sqrt{t+\eta}\}min{t2+η,tt+η​} as t,η→0t,\eta\to0t,η→0. Quadratic suppression is possible precisely when η=O(t2)\eta=O(t^2)η=O(t2), requiring an ideal Hong--Ou--Mandel helper self-visibility deficit of quadratic or smaller order in the data-visibility deficit. When η\etaη is proportional to ttt, exchange-invariant helpers leave linear error, whereas a tilted helper and a real eight-mode network attain the optimal order t3/2t^{3/2}t3/2. The converse follows from compatibility of the optical amplitudes shared by all photon assignments. The same order holds for local unitaries, deterministic local operations and classical communication, and deterministic separable recovery, and for the average over a bounded number of accepted records at nonvanishing total acceptance probability.
Abstract Wave-packet mismatch in entanglement swapping leaves which-source information and lowers the fidelity of the heralded remote pair. We determine the exact correction achievable with one independent auxiliary photon. For pure data photons with amplitude overlap c, every finite static passive network acting identically on internal states, followed by photon counting and deterministic local recovery, yields conditional Bell fidelity at most (1 + c + c2)/(2 − c + 2c2). A five-mode circuit with four two-mode mixings attains this limit and converts first-order mismatch error to second order, whereas circuits with at most three mixings in the logical-mode basis cannot exceed (1 + c)/2. At two-photon visibility 0.98, a pure auxiliary reduces the error from 1.0 × 10−2 to 3.4 × 10−5 at heralding probability 0.041. For mixed auxiliary states supported on the span of the data wave packets, quadratic suppression is possible if and only if the purity deficit vanishes at least quadratically in the mismatch. We establish a matching error law at fixed positive heralding probability. With data visibility 0.90 and auxiliary-copy visibility 0.99, the aligned circuit reduces Bell error 6.6-fold. A centered Gaussian auxiliary of optimized width preserves the optimal leading error.
Partial distinguishability limits linear-optical entanglement swapping. For pure data packets with overlap 0<c<10 < c < 10<c<1, static, internal-state-blind passive optics and spatial photon-number-resolving detection leave an unassisted conditional Bell error of at least ϵ=(1−c2)/2\epsilon = (1-c^2)/2ϵ=(1−c2)/2. We prove that a single independent auxiliary photon (the helper) cannot eliminate this first-order error using three or fewer two-mode mixings: the error remains at least ϵ/(1+c)\epsilon/(1+c)ϵ/(1+c), even with an optimized helper, finite vacuum extensions and deterministic single-copy local operations and classical communication on the retained qubits. A fixed five-mode circuit with four mixings beats this bound for every ccc. Preparing the helper in the normalized sum of the phase-aligned data packets yields a selected record with probability (2−c+2c2)/72(2-c+2c^2)/72(2−c+2c2)/72 per supplied trial and error (1−c)2/(2−c+2c2)=ϵ2/3+O(ϵ3)(1-c)^2/(2-c+2c^2) = \epsilon^2/3 + O(\epsilon^3)(1−c)2/(2−c+2c2)=ϵ2/3+O(ϵ3). At c=0.99c = 0.99c=0.99 (two-photon visibility 0.9801), the error is 3.4×10−53.4 \times 10^{-5}3.4×10−5, compared with 1.0×10−21.0 \times 10^{-2}1.0×10−2 without a helper and 5.0×10−35.0 \times 10^{-3}5.0×10−3 for the best three-mixing circuit. A non-polarizing beam splitter, a partially polarizing beam splitter and a half-wave plate implement the four mixings in polarization encoding. The target Bell weight is proportional to the fully symmetric three-photon internal-state weight. For symmetric depolarized-qubit sources, we derive the exact helper-optimized three-mixing ceiling and a unique impurity threshold for each 0<c<10 < c < 10<c<1; stochastic impurity contributes at first order. We also give the fixed-instrument acceptance frontier, the calibration floor, and comparisons with two helpers and internal-mode filtering, which achieves higher heralding rates in the Gaussian scenarios studied.
What can be transmitted with a fixed photon supply? An optical source that supplies exactly K photons across n modes poses a concrete communication problem: how many messages can it transmit at a chosen error probability, and which input states make the best use of those photons? This paper gives directly evaluable coding bounds for pure loss and identifies the exact optimal input ensembles for identical noisy Gaussian channels. The results allow researchers to assess finite optical blocks, quantify the information cost of fixing the photon supply, and determine when entanglement between separately constrained blocks can be dispensed with. Every message is supported on the same exact K-photon sector. Within that sector, encoding may use arbitrary mixed states and entanglement among modes, and the receiver may perform a joint measurement. Communication is unassisted. All logarithms below are natural; information is measured in nats. Finite-message bounds and the optimal third-order rate For n ≥ 2 identical pure-loss channels of transmissivity 0 < η < 1 and K ≥ 1, the number L of surviving photons has the same binomial distribution for every encoded state. Define pℓ=(Kℓ)ηℓ(1−η)K−ℓ,dn,ℓ=(n+ℓ−1ℓ).p_\ell=\binom K\ell\eta^\ell(1-\eta)^{K-\ell},\qquad d_{n,\ell}=\binom{n+\ell-1}{\ell}.pℓ​=(ℓK​)ηℓ(1−η)K−ℓ,dn,ℓ​=(ℓn+ℓ−1​). If ps*(M;n,K) is the best average success probability for M equiprobable messages, then ∑ℓ=0Kpℓ[1−M−1dn,ℓ]+≤ps∗(M;n,K)≤∑ℓ=0Kpℓmin⁡ ⁣{1,dn,ℓM}.\sum_{\ell=0}^{K}p_\ell\left[1-\frac{M-1}{d_{n,\ell}}\right]_+\le p_{\mathrm s}^{*}(M;n,K)\le\sum_{\ell=0}^{K}p_\ell\min\!\left\{1,\frac{d_{n,\ell}}{M}\right\}.∑ℓ=0K​pℓ​[1−dn,ℓ​M−1​]+​≤ps∗​(M;n,K)≤∑ℓ=0K​pℓ​min{1,Mdn,ℓ​​}. Here [x]+ = max{x,0}. The lower bound provides an achievable guarantee; the upper bound limits every admissible code. Evaluating both sums brackets the performance at a specified photon supply and block length. Their proof has a simple physical interpretation: surviving photons determine the available output dimension, while one collective-mode codebook works across all possible survivor counts. For fixed E > 0, fixed error tolerance 0 < ε < 1, Kn = ⌊nE⌋ and en = Kn/n, the bounds determine the largest message count through third order: log⁡M∗(n,Kn,ε)=ng(ηen)+nη(1−η)en h(ηen)ΦN−1(ε)−12log⁡n+O(1).\log M^*(n,K_n,\varepsilon)=ng(\eta e_n)+\sqrt{n\eta(1-\eta)e_n}\,h(\eta e_n)\Phi_{\mathrm N}^{-1}(\varepsilon)-\tfrac12\log n+O(1).logM∗(n,Kn​,ε)=ng(ηen​)+nη(1−η)en​​h(ηen​)ΦN−1​(ε)−21​logn+O(1). Here g(x) = (x+1)log(x+1) − x log x, h(x) = log(1+1/x), and ΦN is the standard normal distribution function. This fixes both the fluctuation scale and the optimal −½ log n correction. The finite bounds also yield the exact decay exponent of success above capacity and a matching error exponent on a specified interval below capacity. Which inputs are optimal under Gaussian noise? For n identical nonidentity gauge-covariant Gaussian channels, with thermal photon means transformed as r ↦ ar+b, a > 0 and b ≥ max{0,a−1}, the paper determines the exact fixed-photon Holevo optimum and every ensemble attaining it. Each optimal letter places all K photons in one collective mode: ∣K,u⟩=(∑j=1nujaj†)KK!∣0⟩,∑j∣uj∣2=1.|K,u\rangle=\frac{\left(\sum_{j=1}^{n}u_j a_j^\dagger\right)^K}{\sqrt{K!}}|0\rangle,\qquad \sum_j|u_j|^2=1.∣K,u⟩=K!​(∑j=1n​uj​aj†​)K​∣0⟩,∑j​∣uj​∣2=1. An ensemble is optimal precisely when almost all its letters have this form and its average is uniform on the K-photon sector. A finite weighted optimal ensemble exists. These collective modes may themselves extend across, and be entangled among, physical optical modes. Thus the characterization identifies the structure to optimize without imposing a Gaussian-input restriction. The central proof step combines different loss histories that end in the same output photon sector. A common ordering of the comparison eigenstates allows the separate majorization bounds to be combined. For pure loss, a quantitative rigidity estimate further converts a small Holevo deficit into closeness to collective-mode number states. Resource cost and communication across blocks At fixed positive photon density and fixed nonidentity Gaussian noise, requiring an exact photon supply incurs a Holevo penalty of ½ log n plus an explicitly determined constant, relative to the usual mean-energy value. The paper separates this cost into photon-count uncertainty and the mismatch from a thermal output distribution. For separately constrained blocks of quantum-limited loss, quantum-limited amplification or entanglement-breaking Gaussian noise, the one-block Holevo values add exactly. Every optimal letter is a product of blockwise collective-mode number states, and the repeated-block unassisted classical capacity equals the one-block Holevo value. The low-rate reliability interval outside the matching range and repeated-block additivity for intermediate Gaussian noise remain open.
How many uses of an optical channel are required to detect weak phase noise when only the actual mean number of submitted photons is bounded? This paper determines the optimal fixed-confidence order, including every causal protocol with quantum memory and feedback. The two hypotheses are ideal transmission and independent Gaussian phase diffusion of known variance γ>0\gamma>0γ>0. In the photon-number basis the noisy channel is Gγ(∣n⟩⟨ℓ∣)=e−γ(n−ℓ)2/2∣n⟩⟨ℓ∣.\mathcal G_\gamma(|n\rangle\langle\ell|)=e^{-\gamma(n-\ell)^2/2}|n\rangle\langle\ell|.Gγ​(∣n⟩⟨ℓ∣)=e−γ(n−ℓ)2/2∣n⟩⟨ℓ∣. A protocol has at most TTT channel calls. Under each hypothesis separately, the sum of unconditional mean photons submitted over all calls is at most TETETE. Reused photons are charged on every submission, including failed or discarded branches. Inputs may be arbitrary normal states with infinite photon tails, entangled across calls and with retained reference systems. Let Tδcausal(E,γ)T_\delta^{\mathrm{causal}}(E,\gamma)Tδcausal​(E,γ) be the minimum call count for both decision errors to be at most a fixed 0<δ<1/20<\delta<1/20<δ<1/2. For 0<γ≤10<\gamma\le10<γ≤1 and 0<Eγ≤1/40<E\sqrt\gamma\le1/40<Eγ​≤1/4, Tδcausal(E,γ)=Θδ ⁣((Eγ)−1).T_\delta^{\mathrm{causal}}(E,\gamma)=\Theta_\delta\!\left((E\sqrt\gamma)^{-1}\right).Tδcausal​(E,γ)=Θδ​((Eγ​)−1). The explicit bounds are 2[1−2δ(1−δ)]Eγ≤Tδcausal(E,γ)≤⌈log⁡(1/δ)b0Eγ⌉,b0=34(1−e−1/2).\frac{\sqrt2[1-2\sqrt{\delta(1-\delta)}]}{E\sqrt\gamma}\le T_\delta^{\mathrm{causal}}(E,\gamma)\le\left\lceil\frac{\log(1/\delta)}{b_0E\sqrt\gamma}\right\rceil,\qquad b_0=\tfrac34(1-e^{-1/2}).Eγ​2​[1−2δ(1−δ)​]​≤Tδcausal​(E,γ)≤⌈b0​Eγ​log(1/δ)​⌉,b0​=43​(1−e−1/2). A common-environment overlap bound charges each loss of fidelity to the two actual hypothesis-dependent photon budgets, giving the converse even with causal feedback. Independent vacuum–Fock superpositions with n=⌈γ−1/2⌉n=\lceil\gamma^{-1/2}\rceiln=⌈γ−1/2⌉, photon probability p=E/np=E/np=E/n, and immediate binary measurements attain the order. The powers match at fixed confidence; the numerical constants and vanishing-error dependence are distinct. The paper also separates information measures under the same mean-only constraint. The maximum single-use Umegaki relative-entropy disturbance, allowing any reference on a separable Hilbert space, is of order slog⁡(1/s)s\log(1/s)slog(1/s) for s=Eγ↓0s=E\sqrt\gamma\downarrow0s=Eγ​↓0 in the stated regime. The corresponding energy-constrained Belavkin–Staszewski divergence is infinite. The entropy statement concerns single-use disturbance, while the detection theorem covers complete causal strategies. Vacuum–Fock probes and their actual photon accounting are inherited from established dephasing-discrimination work; the matching causal converse and reusable overlap and fractional-moment controls are developed with their full resource conditions. Retained memory and controller complexity are unrestricted. The integrated 11-page PDF contains two figures, complete proofs and eight references.
Loss can restore the vacuum entropy bound without erasing non-Gaussian structure. This paper determines when an entropy statement justifies a coherent-state approximation, when non-Gaussian structure survives optical loss, and what mode and source-request budgets are needed to use that structure. The results give quantum-optics researchers separate criteria for entropy recovery, state approximation, Gaussian concentration and conversion to a specified output. Version 1.5 — revised 10 October 2026. The 96-page PDF contains the main article, Methods, Supplementary Information and references. This revision connects the exact loss boundary to a mode-uniform near-equality certificate, finite-data validation, a conversion-cost lower bound for the same thermally repaired source, and an exact equal-entropy comparison of sources with different conversion-cost exponents. The central figures are updated accordingly. 1. Near-vacuum states can have an unbounded entropy deficit Write νm\nu_mνm​ for the mmm-mode vacuum and define Δα,m(ρ)=Hα(Wνm)−Hα(Wρ)\Delta_{\alpha,m}(\rho)=H_\alpha(W_{\nu_m})-H_\alpha(W_\rho)Δα,m​(ρ)=Hα​(Wνm​​)−Hα​(Wρ​), using natural logarithms; H1H_1H1​ is Shannon entropy. Positive deficit means entropy below vacuum. We construct physical Wigner-positive states satisfying, simultaneously, Em=Tr⁡(Nmρm)→0,12∥ρm−νm∥1→0,dFm(ρm)→0,Δ1,m(ρm)→+∞.E_m=\operatorname{Tr}(N_m\rho_m)\to0,\qquad \tfrac12\|\rho_m-\nu_m\|_1\to0,\qquad d_{\mathcal F_m}(\rho_m)\to0,\qquad \Delta_{1,m}(\rho_m)\to+\infty.Em​=Tr(Nm​ρm​)→0,21​∥ρm​−νm​∥1​→0,dFm​​(ρm​)→0,Δ1,m​(ρm​)→+∞. Here Fm\mathcal F_mFm​ is the trace-norm-closed convex hull of Gaussian states and dFmd_{\mathcal F_m}dFm​​ uses half the trace norm. Thus proximity to the entire Gaussian model does not control Wigner entropy uniformly in mode number. Independent weak modes amplify a one-mode entropy effect while their total excitation vanishes. For the same sequence, half loss instead gives −Em≤Δ1,m(L1/2⊗mρm)≤0-E_m\le\Delta_{1,m}(\mathcal L_{1/2}^{\otimes m}\rho_m)\le0−Em​≤Δ1,m​(L1/2⊗m​ρm​)≤0, so the entropy difference from vacuum tends to zero. 2. The exact pure-loss recovery boundary For Wigner-positive inputs, intensity transmissivity η\etaη and any fixed positive total input-energy budget EEE, the sharp threshold is ηc(α)={1/2,0<α≤1,α/2,1<α<2.\eta_c(\alpha)=\begin{cases}1/2,&0<\alpha\le1,\\ \alpha/2,&1<\alpha<2.\end{cases}ηc​(α)={1/2,α/2,​0<α≤1,1<α<2.​ With Pm,E={ρ:Wρ≥0, Tr⁡(Nmρ)≤E}\mathcal P_{m,E}=\{\rho:W_\rho\ge0,\ \operatorname{Tr}(N_m\rho)\le E\}Pm,E​={ρ:Wρ​≥0, Tr(Nm​ρ)≤E}, sup⁡m≥1sup⁡ρ∈Pm,EΔα,m(Lη⊗mρ)={0,η≤ηc(α),+∞,η>ηc(α).\sup_{m\ge1}\sup_{\rho\in\mathcal P_{m,E}}\Delta_{\alpha,m}(\mathcal L_\eta^{\otimes m}\rho)=\begin{cases}0,&\eta\le\eta_c(\alpha),\\+\infty,&\eta>\eta_c(\alpha).\end{cases}supm≥1​supρ∈Pm,E​​Δα,m​(Lη⊗m​ρ)={0,+∞,​η≤ηc​(α),η>ηc​(α).​ The recovery statement includes the boundary itself and is independent of mode number. Half loss also restores vacuum majorization for arbitrary density operators. For α≥2\alpha\ge2α≥2, established Wigner-norm bounds give the vacuum entropy bound at every transmissivity for Wigner-positive outputs. These statements distinguish a universal guarantee from the earlier sign crossing that a particular source may exhibit. 3. Near equality gives a certificate for the entire input For an arbitrary input ρ\rhoρ, define the half-loss output Shannon excess s(ρ)=h(WL1/2⊗mρ)−m(1+ln⁡π)≥0.s(\rho)=h(W_{\mathcal L_{1/2}^{\otimes m}\rho})-m(1+\ln\pi)\ge0.s(ρ)=h(WL1/2⊗m​ρ​)−m(1+lnπ)≥0. The half-loss identity identifies this quantity with the input's total Wehrl entropy excess. Applying mode-uniform Wehrl stability yields inf⁡a∥ρ−∣a⟩⟨a∣∥12≤64ln⁡2 s(ρ).\inf_a\|\rho-|a\rangle\langle a|\|_1^2\le\frac{64}{\ln2}\,s(\rho).infa​∥ρ−∣a⟩⟨a∣∥12​≤ln264​s(ρ). The bound controls the full input state, with no energy or photon-support restriction. One coherent reference then controls every subsequent quantum channel and every unconditional measurement event. In particular, an event-probability error at most ϵ\epsilonϵ is guaranteed by s≤(ln⁡2)ϵ2/16s\le(\ln2)\epsilon^2/16s≤(ln2)ϵ2/16. Conversely, a surviving output Gaussian-hull gap enforces s(ρ)≥ln⁡216 dFm(L1/2⊗mρ)2.s(\rho)\ge\frac{\ln2}{16}\,d_{\mathcal F_m}(\mathcal L_{1/2}^{\otimes m}\rho)^2.s(ρ)≥16ln2​dFm​​(L1/2⊗m​ρ)2. Recovery of the inequality and proximity to equality therefore support different physical inferences: the former permits residual non-Gaussian structure, while the latter certifies a coherent-state approximation. 4. Surviving structure has mode and conversion costs A thermally repaired vacuum–three-photon source with per-mode occupation c/mc/mc/m has total input energy tending to 3c3c3c. Along the recovery boundary, its attenuated state obeys lim inf⁡m→∞dFm(ρ~m,ηc)≥cηc3exp⁡{−c[1−(1−ηc)3]}>0.\liminf_{m\to\infty}d_{\mathcal F_m}(\widetilde\rho_{m,\eta_c})\ge c\eta_c^3\exp\{-c[1-(1-\eta_c)^3]\}>0.liminfm→∞​dFm​​(ρ​m,ηc​​)≥cηc3​exp{−c[1−(1−ηc​)3]}>0. At half transmission this lower bound is g(c)=(c/8)e−7c/8g(c)=(c/8)e^{-7c/8}g(c)=(c/8)e−7c/8. Starting from one complete block, Gaussian processing requires Θ(m)\Theta(m)Θ(m) output modes to retain any fixed positive gap below this bound at success probability at least a fixed p0>0p_0>0p0​>0. Gaussian ancillary states, adaptive Gaussian measurements, feedback, discarding and postselection are included. A distinct task requests fresh independent blocks of this same half-loss source to produce the one-mode target τ∗=(18∣0⟩⟨0∣+6∣1⟩⟨1∣+∣2⟩⟨2∣)/25\tau_*=(18|0\rangle\langle0|+6|1\rangle\langle1|+|2\rangle\langle2|)/25τ∗​=(18∣0⟩⟨0∣+6∣1⟩⟨1∣+∣2⟩⟨2∣)/25 within half trace distance 10−610^{-6}10−6. Let CmC_mCm​ be the infimum of expected complete-block requests divided by success probability, including all failed requests. For fixed 0<c≤10<c\le10<c≤1, every achieving Gaussian protocol obeys the asymptotic lower bound log⁡Cm≥1128(m/c)1/3−log⁡m−O(1).\log C_m\ge\frac1{128}(m/c)^{1/3}-\log m-O(1).logCm​≥1281​(m/c)1/3−logm−O(1). This is a source-request lower bound; the optimal achievable cost for this source remains undetermined. The proof evaluates a curvature-controlled input certificate for the actual thermally repaired state and applies the Gaussian conversion theorem of the companion paper cited below. 5. Exactly equal entropy does not fix conversion cost For two separate two-mode quartic source families, their mixture probabilities can be adjusted so that their half-loss Shannon entropies are exactly equal. Under a common target, tolerance and failure-inclusive accounting, the inherited matching conversion laws become h(WωA)=h(WωB)=2(1+ln⁡π)+s,log⁡CA(s)=Θ(s−1/3),log⁡CB(s)=Θ(s−1/2).h(W_{\omega_A})=h(W_{\omega_B})=2(1+\ln\pi)+s,\qquad \log C_A(s)=\Theta(s^{-1/3}),\qquad \log C_B(s)=\Theta(s^{-1/2}).h(WωA​​)=h(WωB​​)=2(1+lnπ)+s,logCA​(s)=Θ(s−1/3),logCB​(s)=Θ(s−1/2). The target tolerance is held fixed in these asymptotics. The delivered energies after entropy matching satisfy EA,EB∼s/2E_A,E_B\sim s/2EA​,EB​∼s/2. At exactly equal energy, the two excesses instead share si(E)=2E−(35/8)E2+O(E3)s_i(E)=2E-(35/8)E^2+O(E^3)si​(E)=2E−(35/8)E2+O(E3) and differ by sA(E)−sB(E)=15E3+O(E4)s_A(E)-s_B(E)=15E^3+O(E^4)sA​(E)−sB​(E)=15E3+O(E4). Entropy alone therefore cannot select the cheaper source for a fixed output task. 6. Finite data and finite mode budgets Under a declared displaced-input photon-tail bound Tr⁡[N1N>Kσa]≤τK\operatorname{Tr}[N\mathbf1_{N>K}\sigma_a]\le\tau_KTr[N1N>K​σa​]≤τK​, trusted half loss and all-mode on/off detection with efficiency at least ξmin⁡\xi_{\min}ξmin​, the click probability qqq gives s(σ)≤AKq+τK,AK=K1−(1−ξmin⁡/2)K.s(\sigma)\le A_Kq+\tau_K,\qquad A_K=\frac{K}{1-(1-\xi_{\min}/2)^K}.s(σ)≤AK​q+τK​,AK​=1−(1−ξmin​/2)KK​. A one-sided binomial bound turns this into an entropy confidence certificate. An explicit undisplaced four-photon-cutoff example uses K=4K=4K=4, τK=0\tau_K=0τK​=0, ξ=0.8\xi=0.8ξ=0.8 and N=3,517,336N=3{,}517{,}336N=3,517,336 independent validation blocks, accepting at most 41 clicks, to certify unconditional event error at most 0.050.050.05 with false-acceptance probability at most 0.0010.0010.001 and missed acceptance at most 0.0010.0010.001 on the stated low-click alternative class. All vacuum results count; training, calibration and source heralding are separate costs. When coherent-state approximation alone is the task, the same click measurement supplies a stronger direct fidelity test. The paper also gives all-input finite-budget exclusions above the loss-recovery line. For example, at E=1E=1E=1, α=1.9\alpha=1.9α=1.9, η=0.9505\eta=0.9505η=0.9505 and m=105m=10^5m=105, the certified bound Δα<0.06942\Delta_\alpha<0.06942Δα​<0.06942 rules out a target deficit of 0.10.10.1 nat. A separate finite single-mode preparation model predicts positive Shannon deficit near η=0.97\eta=0.97η=0.97, negative deficit near η=0.85\eta=0.85η=0.85, and a Gaussian-hull witness above 4.4×10−34.4\times10^{-3}4.4×10−3 at half transmission, with explicit preparation, measurement-error and raw-trial budgets in the PDF. 7. Dimensional scales, a strict entropy floor and ORCS Near order two, put α=2−δ\alpha=2-\deltaα=2−δ and L=ln⁡(1/δ)L=\ln(1/\delta)L=ln(1/δ). For the maximum deficit Dm,ED_{m,E}Dm,E​ at fixed total energy, Dm,E(2−δ)=Θm,E(δ/L)for fixed m,Th(δ,E)=ΘE,h(L/δ),D_{m,E}(2-\delta)=\Theta_{m,E}(\delta/L)\quad\text{for fixed }m,\qquad T_h(\delta,E)=\Theta_{E,h}(L/\delta),Dm,E​(2−δ)=Θm,E​(δ/L)for fixed m,Th​(δ,E)=ΘE,h​(L/δ), where ThT_hTh​ is the first mode number allowing a fixed positive deficit hhh. Beyond a sufficiently large fixed multiple of L/δL/\deltaL/δ, Dm,E(2−δ)=ΘE(mδ)D_{m,E}(2-\delta)=\Theta_E(m\delta)Dm,E​(2−δ)=ΘE​(mδ). The manuscript separates proved sufficient fronts from necessary exit bounds; the sharp first-crossing coefficient remains open. At every fixed mode number, an energy-unrestricted strict Shannon floor also holds: h(Wρ)≥mln⁡(2π)+εmh(W_\rho)\ge m\ln(2\pi)+\varepsilon_mh(Wρ​)≥mln(2π)+εm​ with εm>0\varepsilon_m>0εm​>0 for all Wigner-positive states. The ordering-resolved coherence spectrum (ORCS) supplies an exact single-mode loss coordinate. With Cr,k\mathcal C_{r,k}Cr,k​ denoting the ordering-weighted norm of photon-number-difference block kkk, Cr,k(Lηρ)=CTη(r),k(ρ),Tη(r)=1−1−rη.\mathcal C_{r,k}(\mathcal L_\eta\rho)=\mathcal C_{T_\eta(r),k}(\rho),\qquad T_\eta(r)=1-\frac{1-r}{\eta}.Cr,k​(Lη​ρ)=CTη​(r),k​(ρ),Tη​(r)=1−η1−r​. For vacuum–nnn-photon coherence and 1<α<21<\alpha<21<α<2, C1−α/2(Lη∣n⟩⟨0∣)=(2ηα)n.\mathcal C_{1-\alpha/2}(\mathcal L_\eta|n\rangle\langle0|)=\left(\frac{2\eta}{\alpha}\right)^n.C1−α/2​(Lη​∣n⟩⟨0∣)=(α2η​)n. This formula exposes the high-order coherence mechanism at the loss threshold; the universal recovery result is proved through the full nonlinear Wigner-norm inequality. Related papers and history The counterexample paper Wigner entropy below vacuum: physical counterexamples and stability limits expands arXiv:2609.13312v1, submitted on 10 September 2026. This stability paper develops the dimensional, loss-dependent and operational consequences. Its state-approximation and conversion interfaces use the companion results From phase-space entropy to coherent-state error: mode-uniform Rényi–Wehrl stability and Phase records control the conversion cost of non-Gaussian light. The mode-retention comparison connects to Limits to Gaussian concentration of non-Gaussian light.