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

Uniform entropy floors for optical sources with finite preparation memory

Zixuan He

Published Nov 8, 2026• 0 citations
Publisher

Abstract

Can a light source use long correlations to evade the entropy generated by single-photon noise? This paper establishes a common noise floor for an entire family of sources with finite preparation resources, even when their memory mixes arbitrarily slowly. The source repeatedly applies the same isometry to a stationary quantum memory of dimension at most \(D\). Each emitted mode is supported on photon numbers \(0,\ldots,L\), with mean emission at least \(\mu>0\); the final preparation memory is traced out. There is no fresh discarded preparation noise. Every signal then meets an independent single-photon environment at a beam splitter. Write \(\Phi_{\eta,1}\) for the channel whose retained output equals the bath at \(\eta=0\). A source-independent interval, at every finite length. For fixed \(L,D,\mu\), there exist \(\eta_*(L,D,\mu)>0\) and \(v_*(L,\mu)>0\) such that every allowed source and every finite block length \(n\) satisfy \[\frac{1}{n}S\!\left(\Phi_{\eta,1}^{\otimes n}(\rho_n)\right)\ge h_2(\eta)+v_*\eta\log(1/\eta),\qquad 0<\eta<\eta_*.\] Here S is von Neumann entropy in nats and \(h_2(t)=-t\log t-(1-t)\log(1-t)\). The complementary bound holds near \(\eta=1\), replacing the surplus by \(v_*(1-\eta)\log[1/(1-\eta)]\). The statement allows singular stationary memory states, without an ergodicity, mixing-gap or minimum-eigenvalue assumption. Mechanism and usable scope. A dimension-paid entropy comparison retains the complete quantum memory while avoiding inverse conditioning. The persistent emitted field lies in the center of the reversible memory algebra. An explicit slow-memory family shows why recovering the full perturbative coefficient uniformly would be an unnecessarily strong requirement. The surplus coefficient is explicit, while the common endpoint width is proved to exist by compactness. The occupation cutoff and memory dimension are fixed resources; a mean-energy cap alone is a different source model. The integrated 11-page article contains two figure groups, complete proofs and references. It connects finite preparation resources to a uniform single-photon-noise entropy threshold; it does not assume a general arbitrary-input additivity theorem.

DOI
10.5281/zenodo.24059264

Related papers

Quantum limits and one-qubit advantage in optical predictive compression

Zixuan He

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 \[ C_{\mathrm Q}(R)=\sup_{\mathcal N:\,I(A:M)\le R}I(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<\eta<1\), write the output occupation as \(\eta n+b\), where \(b\ge0\) is the environment's added thermal occupation. With \(g(x)=(x+1)\log(x+1)-x\log x\), the exact optimum over all normal classical records is \[ C_{\mathrm{cl}}(n,R)=g(\eta n+b)-g(\eta u_R+b),\qquad u_R=g^{-1}\!\bigl(\max\{g(n)-R,0\}\bigr). \] A legal encoder applies vacuum loss with transmissivity \(\lambda\) to the purifier and then coherently retains two levels, resetting the entire higher-photon tail. For fixed \(b>0\) and \(0<\lambda<1/2\), at the common budget \(R_n=g(n)+g(\lambda n)-g((1-\lambda)n)\), its actual relevance satisfies \[ v_2=\frac{\eta\lambda}{1+b}\,n\log(1/n)+O(n),\qquad C_{\mathrm{cl}}(n,R_n)=2\lambda\eta\log(1+1/b)\,n+O\!\left(\frac{n}{\log(1/n)}\right). \] The full optical tail is included in the resource accounting. At \(n=0.01\), \(\eta=b=0.5\), \(\lambda=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 \(\dim K_k\le2^k\) and \(I(A^k:K_k)\le 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 \(\alpha_k\) be the missed-correlation probability and \(\beta_k\) the false-match probability. For every classical block encoder, even with an unrestricted classical alphabet, the fixed-error converse is \[ \alpha_k\le\epsilon\quad\Longrightarrow\quad \beta_k\ge\exp\!\left[-\frac{k c_nR+\log2}{1-\epsilon}\right],\qquad c_n=\eta\frac{\log(1+1/(\eta n+b))}{\log(1+1/n)}. \] At the finite parameters above and \(\epsilon=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.

•Oct 25, 2026•0 citations

Size and reliability limits of quantum memory for heterodyne uncertainty

Zixuan He

Can a larger quantum memory compensate for a less reliable one? This paper answers that question for optical heterodyne quantum conditional entropy under a total photon budget and a strict physical memory dimension. It separates an uncertainty loss that additional storage can reduce from an erasure floor that no increase in dimension can remove. Preparation and noise model. The optical system has \(m\) modes and total mean photon number at most \(E\). Its joint preparation with a memory is optimized over all normal mixed states, including arbitrary optical coherence and infinite photon tails. The input memory has dimension at most \(d\). Independently, the entire register survives with probability \(1-p\) or is erased into an orthogonal readable failure state. The physical output therefore has \(d+1\) levels; a total \(q\)-qubit register permits \(d\le2^q-1\). Every event is retained, with no postselection. For heterodyne measure \(d^{2m}z/\pi^m\) and natural logarithms, the exact all-preparation reduction is \[V_{\rm er}(m,d,E,p)=\min_{\operatorname{rank}\rho\le d,\;\operatorname{Tr}(N\rho)\le E}\{W(\rho)-(1-p)S(\rho)\}.\] Here \(W\) is Wehrl entropy, \(S\) is von Neumann entropy and \(N\) is total photon number. The rank constraint follows from pure attainment of the original mixed optical–memory problem. The objective describes quantum side information; it is not automatically the uncertainty achieved by a classical readout of the memory. An exact reliability ceiling. Define \(g(x)=(1+x)\ln(1+x)-x\ln x\), \(S_*=m g(E/m)\), the ideal unlimited-memory value \(B_m(E)=m-E\ln(1+m/E)\), and \(a_E=1-[(1+E/m)\ln(1+m/E)]^{-1}\). For any target excess satisfying \(0<\varepsilon<a_ES_*\), \[p_{\rm crit}=\frac{\varepsilon}{m g(E/m)}.\] A finite register reaches \(V_{\rm er}\le B_m(E)+\varepsilon\) if and only if \(p<p_{\rm crit}\). At equality only an infinite memory attains the target. Above the ceiling the target is impossible even with unlimited memory. Finite storage and reliability pay different costs. Let \(S_d\) be the largest entropy of any rank-at-most-\(d\) optical state within the same photon budget, and \(\Delta_d=S_*-S_d\). For \(0\le p<a_E\), \[pS_*+(a_E-p)\Delta_d\le V_{\rm er}-B_m(E)\le pS_*+(1-p)\Delta_d.\] The first contribution survives at unlimited dimension, whereas \(\Delta_d\) tends to zero as storage grows. An exact finite Gibbs program computes \(S_d\), including partially occupied photon shells. The two bounds give necessary and sufficient resource tests rather than an exact full finite-dimensional frontier. The unlimited-memory floor is obtained from an explicit scalar thermal optimization. Above its energy-use crossover the attaining thermal source uses less than the allowed energy. At \(0<E\le10^{-4}\), \(2\le d\le m+1\) and \(p<1/8\), an explicit vacuum–one-photon entangled preparation remains globally optimal over the full preparation class. Finite examples also reserve the failure flag inside the stated register and distinguish heralded erasure from unheralded replacement. The analysis builds on Gaussian Wehrl extremality theorems established in earlier literature and on Zixuan He's previous results on ideal-memory spectrum shaping and low-photon resource laws. Its additional contribution is the optimized finite-memory erasure contract, the exact feasibility boundary and physically budgeted attaining sources. The integrated 14-page article contains the complete proofs, two figure groups, finite certificates and references.

•Oct 26, 2026•0 citations

Photon-number hierarchies in the quantum memory cost of heterodyne uncertainty

Zixuan He

How much quantum memory is needed to retain the contributions of rare photon events to a measurement record? This paper determines the memory scales required to approach the best heterodyne conditional entropy when the total optical energy tends to zero. Its resource laws distinguish precisions for which counting photon configurations suffices from critical precisions at which energy-calibrated entropy corrections determine additional memory costs. Full preparation model and reference value. The optical system has \(m\) bosonic modes, total mean photon number at most \(E\), and an entire accessible quantum side system \(B\) of dimension at most \(D\), including retained preparation labels. The optical source and its correlations with the memory are optimized over all normal mixed states; arbitrary coherences and infinite photon tails are allowed. With natural logarithms and heterodyne measure \(d\mu=\pi^{-m}d^{2m}z\), define \[V_{m,D}(E)=\min_{\rho_{AB}}H_\mu(Z|B),\qquad H_\mu(Z|B)=h_\mu(Z)-\chi(Z:B).\] Here \(Z\) is the heterodyne outcome and \(\chi\) is Holevo information. The unlimited-memory optimum at the same energy is \[B_m(E)=m-E\ln(1+m/E),\qquad D_{\min}(m,E,\varepsilon)=\min\{D:V_{m,D}(E)-B_m(E)\le\varepsilon\}.\] The tolerance \(\varepsilon\) is a total conditional-entropy excess in nats. It is not a measurement-error probability. Classical side information satisfies \(H_\mu(Z|Y)\ge m\); entangled quantum side information can go below this benchmark. The resource \(D\) is a Hilbert-space dimension, corresponding to \(\lceil\log_2D\rceil\) qubits. Precision selects a photon-number hierarchy. Along arbitrary joint limits \(m\to\infty\), \(E\to0\), with no prescribed relation between \(E\) and \(1/m\), \[\frac{\varepsilon}{E}\to c>0\quad\Longrightarrow\quad D_{\min}\sim e^{-c}m.\] For every fixed integer \(K\ge2\), \[\frac{\varepsilon}{E^K}\to c\in(0,1/K!)\quad\Longrightarrow\quad D_{\min}\sim(1-K!c)\frac{m^K}{K!}.\] Although higher-photon events become rarer, they occupy increasingly many orthogonal mode configurations. Resolving their entropy contribution therefore requires a larger memory dimension. In qubits, the fixed-\(K\) law is \(K\log_2m+O(1)\). Critical precisions resolve costs beyond sector counting. At the exact tolerance \(E^2/2\), the complete vacuum–one-photon head is not sufficient at leading dimension: \[D_{\min}(m,E,E^2/2)=m+1+(1+o(1))\left(\frac m2+\frac{Em^2}{6}\right).\] The error is relative to the additional dimension in parentheses. Both terms come from the entropy of the mean-calibrated finite head, together with an all-state output-entropy comparison. At the next critical tolerance \(E^3/6\), the paper determines an added-to-removed-level transition near the complete two-photon head \(\binom{m+2}{2}\), including the boundary near \(mE=4\) and precisely qualified integer conclusions. An exact finite-energy source. For every finite \(m\), \(2\le D\le m+1\), and \(0<E\le10^{-4}\), let \(r=D-1\) and choose orthonormal one-photon modes \(u_1,\ldots,u_r\). The preparation \[|\Psi\rangle=\sqrt{1-E}|0\rangle_A|0\rangle_B+\sqrt{E/r}\sum_{j=1}^{r}|u_j\rangle_A|j\rangle_B\] attains the original global minimum over the full preparation class. Its vacuum–one-photon support is a conclusion of the optimization, rather than an imposed photon cutoff. The paper also characterizes exact small-energy optima for every fixed complete photon head. A record-reconstruction interpretation with explicit resource accounting. A common finite heterodyne digitizer, including a genuine overflow symbol, approximates the conditional entropy uniformly over all legal preparations. For independent repetitions of a known preparation, classical–quantum Slepian–Wolf coding identifies the asymptotic reconstruction rate with \(H(X|B)\). The uniform comparison transfers the hierarchy to the excess optimized communication rate relative to unlimited finite memory using the same digitizer. Preserving the first critical formula requires digitization error \(\xi=o(E^2/m+E^3)\); the corresponding error scales for the separated second-critical regimes are also given. The decoder may act collectively after receiving the classical message. For \(n\) independent preparations, the supplied side-system dimension is at most \(D^n\) and total mean optical energy is at most \(nE\). This is a supplied-memory resource law, not an optimization over arbitrary correlated block preparations, a minimum Schumacher-compressed storage rate, or a bound on peak decoder workspace. Coding limits are taken at fixed finite parameters before the low-energy, growing-mode limit. The work develops the low-photon, growing-mode regime of the preparation problem studied in Optimal entanglement weights for heterodyne uncertainty with finite quantum memory (doi:10.5281/zenodo.23647071). The integrated 29-page paper contains the complete proofs, three figures and two tables.

•Oct 25, 2026•0 citations

The energy cost of optical noise

Zixuan He

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 \(\sigma\) at a beam splitter of signal transmissivity \(\eta\). The requirement is \[\Phi_{\eta,\sigma}(\rho)\le cI\qquad\text{for every normal input state }\rho,\qquad 0<c<1.\] Equivalently, every rank-one output projection has probability at most \(c\) and the receiver's output min-entropy is at least \(-\ln c\). Inputs may be mixed, non-Gaussian, arbitrarily energetic, and have infinite photon tails. Let \(d=\lceil 1/c\rceil-1\). Throughout \(0<\eta\le 1/\lceil 1/c\rceil\), the minimum mean photon numbers of the actual bath are \[N_{\mathrm{all}}(c,\eta)=\frac{d-cd(d+1)/2}{1-\eta}.\] \[N_{\mathrm G}(c,\eta)=\frac{c^{-1}-1}{1-\eta}.\] 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\ge2\) and \(0<\eta\le1/j\), \[N_{\mathrm G}(1/j,\eta)=2N_{\mathrm{all}}(1/j,\eta).\] 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 \[\lambda_*=(\underbrace{c,\ldots,c}_{d\text{ entries}},r).\] It majorizes every output of the same channel, so the minimum von Neumann entropy is exactly \[S_{\min}(\Phi_{\eta,\sigma})=-dc\ln c-r\ln r.\] 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 \[S_{\mathrm{out}}\ge m\ln j\] for every finite number \(m\) of uses and arbitrary normal joint inputs, including cross-use entanglement. The environments vary with \(\eta\) 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, \(\sigma=\lvert1\rangle\langle1\rvert\), at every \(0<\eta<1\). With \[h(\eta)=-\eta\ln\eta-(1-\eta)\ln(1-\eta),\] it proves: Exact \(S_{\mathrm{out}}\ge mh(\eta)\) at arbitrary finite blocklength for joint inputs invariant under each local photon-number phase rotation by \(2\pi/q\), \(q\ge4\). 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. \(S_{\mathrm{out}}\ge Mh(\eta)-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 \(\eta\), all outputs remain a uniformly positive trace distance from every state of rank below \(2^m\), 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.

•Oct 25, 2026•0 citations

Memory capacity and lifetime thresholds for testing pure Gaussianity

Zixuan He

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 \(k_a(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=2^q\). An exact threshold for statistical advantage Without retained quantum information, the optimal sample order is \(\Theta(m)\). Along arbitrary growing-mode sequences, the precise criterion for improving that order is \[ k_a(D,m)=o(m)\quad\Longleftrightarrow\quad am\to\infty\ \text{and}\ \frac{aD}{m}\to\infty. \] 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,m^2/D\}\). At the fixed energy and separation above, constants \(c,C>0\), independent of \(m,D,a\), give \[ c\min\{m,A/a\}\le k_a(D,m)\le C\min\{m,A/a+\min(a^{-2},m^{2/3})\},\qquad 0<a\le1. \] At \(a=0\), the sample cost is \(\Theta(m)\). For ideal memory the complete rate is \[ k_1(D,m)=\Theta\!\left(\min\{m,\max(1,m^2/D)\}\right). \] With loss, the bounds match whenever \(A\ge\min\{a^{-1},am^{2/3}\}\). For example, \(a=m^{-1/6}\) and \(D=\lceil m^{11/6}\rceil\) give \(\Theta(m^{1/3})\) preparations. The existence of sublinear advantage is fully characterized even where its optimal exponent remains bracketed: for \(D\ge m^2\), \(a=m^{-1/2}\), the stated bounds are \(\Omega(m^{1/2})\) and \(O(m^{2/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 \(m^2\) labels, only a positive register of dimension \(m+1\) is retained. The three-visit route requires \(D\ge 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 \(\mathcal N=a\Psi+(1-a)\mathcal R_\tau\), where \(\Psi\) is CPTP and \(\mathcal R_\tau(X)=\operatorname{Tr}(X)\tau\), an exact flagged-erasure simulation gives \(k_{\mathcal N}(D,m)\ge k_a(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 \(\Theta(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.

•Oct 25, 2026•0 citations

Maximum output purity under correlated non-Gaussian optical noise

Zixuan He

Can correlations in an optical environment allow an entangled signal to produce a purer output than coherent light? This article removes that input optimization for a specified class of non-Gaussian noise, providing an exact entropy benchmark for every joint signal state. Exact maximum over all inputs. Consider m signal modes coupled locally to an initially independent environment \[\omega_E=\sum_x p(x)|x\rangle\langle x|.\] The sum runs over all binary photon-number histories, with zero or one photon in each environment mode. Their probability law p may have arbitrary correlations across the entire block. Environmental outputs are discarded. For the transmissivity vector \(\vec{\eta}=(\eta_1,\ldots,\eta_m)\), the channel satisfies \[P_{\max}(p,\vec{\eta}):=\sup_{\rho}\operatorname{Tr}[\Phi_{p,\vec{\eta}}(\rho)^2]=\mathbb{E}_{X,Y\sim p}\prod_{j=1}^m h_{\eta_j}(X_j,Y_j),\] where \(X,Y\) are independent draws from the same complete bath law and \[h_\eta(0,0)=1,\qquad h_\eta(0,1)=h_\eta(1,0)=\eta,\qquad h_\eta(1,1)=\eta^2+(1-\eta)^2.\] The equality holds for every common \(\eta\in[0,1]\), and separately when all transmissivities lie in \([1/2,1]\) or all lie in \([0,7/24]\). The supremum includes arbitrary normal mixed and entangled inputs without a signal-energy restriction. Vacuum and every coherent product input attain it. The right-hand side is the collision probability of the vacuum-output distribution, not of the bath histories themselves. What correlations change. Two explicit baths with identical one- and two-mode marginals, identical corresponding reduced signal channels and equal mean photon budgets have exponentially versus polynomially decaying maximum output purity. At balanced coupling and 31 modes, their maxima differ by approximately 2080. The large separation already follows from a vacuum construction and the established independent-bath result; the new all-input theorem fixes the correlated bath's exact optimum. A Markov example turns the infinite-dimensional optimization into a four-dimensional transfer calculation. Mechanism and boundaries. The proof retains the even total relative-photon parity imposed by two identical signal copies and controls the cross terms between distinct bath histories. Convexity and bounded-operator continuity return the comparison to all normal inputs, including infinite photon tails. Diagonality of the bath is essential: an explicit coherent binary bath allows a noncoherent signal to outperform all coherent products. For arbitrary heterogeneous couplings uniformly separated from zero and one, exponential suppression of maximum purity is equivalent to an exponentially small probability of a whole-block low-occupation event. The results give lower bounds on output second Rényi entropy and necessary ranks for approximating the complete output. They do not determine ordinary-entropy additivity or communication capacity; a same-bath comparison shows that a history-conditioned entropy method can give a tighter communication bound than exact purity. The independent contribution extends exact all-input purity beyond independent non-Gaussian baths, while retaining the attribution of Gaussian extremality, replica methods and classical collision calculations. The integrated 19-page PDF contains two figure groups, complete proofs and references. Its finite zero-click example is a theoretical test of two specified bath models with explicit reset, detection and mean-energy assumptions.

•Nov 9, 2026•0 citations
Can a light source use long correlations to evade the entropy generated by single-photon noise? This paper establishes a common noise floor for an entire family of sources with finite preparation resources, even when their memory mixes arbitrarily slowly. The source repeatedly applies the same isometry to a stationary quantum memory of dimension at most (D). Each emitted mode is supported on photon numbers (0,\ldots,L), with mean emission at least (\mu>0); the final preparation memory is traced out. There is no fresh discarded preparation noise. Every signal then meets an independent single-photon environment at a beam splitter. Write (\Phi_{\eta,1}) for the channel whose retained output equals the bath at (\eta=0). A source-independent interval, at every finite length. For fixed (L,D,\mu), there exist (\eta_(L,D,\mu)>0) and (v_(L,\mu)>0) such that every allowed source and every finite block length (n) satisfy [\frac{1}{n}S!\left(\Phi_{\eta,1}^{\otimes n}(\rho_n)\right)\ge h_2(\eta)+v_\eta\log(1/\eta),\qquad 0<\eta<\eta_.] Here S is von Neumann entropy in nats and (h_2(t)=-t\log t-(1-t)\log(1-t)). The complementary bound holds near (\eta=1), replacing the surplus by (v_*(1-\eta)\log[1/(1-\eta)]). The statement allows singular stationary memory states, without an ergodicity, mixing-gap or minimum-eigenvalue assumption. Mechanism and usable scope. A dimension-paid entropy comparison retains the complete quantum memory while avoiding inverse conditioning. The persistent emitted field lies in the center of the reversible memory algebra. An explicit slow-memory family shows why recovering the full perturbative coefficient uniformly would be an unnecessarily strong requirement. The surplus coefficient is explicit, while the common endpoint width is proved to exist by compactness. The occupation cutoff and memory dimension are fixed resources; a mean-energy cap alone is a different source model. The integrated 11-page article contains two figure groups, complete proofs and references. It connects finite preparation resources to a uniform single-photon-noise entropy threshold; it does not assume a general arbitrary-input additivity theorem.
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 AAA is prepared with its actual purifier CCC. A normal encoder acts on CCC to produce memory MMM, while a prescribed Gaussian channel maps AAA to the relevant optical output BBB. The source-information cost and useful correlation are r=I(A:M)r=I(A:M)r=I(A:M) and v=I(B:M)v=I(B:M)v=I(B:M), respectively. All logarithms are natural. The paper determines CQ(R)=sup⁡N: I(A:M)≤RI(B:M). C_{\mathrm Q}(R)=\sup_{\mathcal N:\,I(A:M)\le R}I(B:M). CQ​(R)=supN:I(A:M)≤R​I(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 nnn and a thermal attenuator with transmissivity 0<η<10<\eta<10<η<1, write the output occupation as ηn+b\eta n+bηn+b, where b≥0b\ge0b≥0 is the environment's added thermal occupation. With g(x)=(x+1)log⁡(x+1)−xlog⁡xg(x)=(x+1)\log(x+1)-x\log xg(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}). C_{\mathrm{cl}}(n,R)=g(\eta n+b)-g(\eta u_R+b),\qquad u_R=g^{-1}\!\bigl(\max\{g(n)-R,0\}\bigr). 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 λ\lambdaλ to the purifier and then coherently retains two levels, resetting the entire higher-photon tail. For fixed b>0b>0b>0 and 0<λ<1/20<\lambda<1/20<λ<1/2, at the common budget Rn=g(n)+g(λn)−g((1−λ)n)R_n=g(n)+g(\lambda n)-g((1-\lambda)n)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 ⁣(nlog⁡(1/n)). v_2=\frac{\eta\lambda}{1+b}\,n\log(1/n)+O(n),\qquad C_{\mathrm{cl}}(n,R_n)=2\lambda\eta\log(1+1/b)\,n+O\!\left(\frac{n}{\log(1/n)}\right). 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.01n=0.01n=0.01, η=b=0.5\eta=b=0.5η=b=0.5, λ=0.2\lambda=0.2λ=0.2 and R=0.023875R=0.023875R=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 kkk uses, the retained predictive memory obeys dim⁡Kk≤2k\dim K_k\le2^kdimKk​≤2k and I(Ak:Kk)≤kRI(A^k:K_k)\le kRI(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\alpha_kαk​ be the missed-correlation probability and βk\beta_kβk​ the false-match probability. For every classical block encoder, even with an unrestricted classical alphabet, the fixed-error converse is αk≤ϵ⟹βk≥exp⁡ ⁣[−kcnR+log⁡21−ϵ],cn=ηlog⁡(1+1/(ηn+b))log⁡(1+1/n). \alpha_k\le\epsilon\quad\Longrightarrow\quad \beta_k\ge\exp\!\left[-\frac{k c_nR+\log2}{1-\epsilon}\right],\qquad c_n=\eta\frac{\log(1+1/(\eta n+b))}{\log(1+1/n)}. αk​≤ϵ⟹βk​≥exp[−1−ϵkcn​R+log2​],cn​=ηlog(1+1/n)log(1+1/(ηn+b))​. At the finite parameters above and ϵ=0.1\epsilon=0.1ϵ=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.
Can a larger quantum memory compensate for a less reliable one? This paper answers that question for optical heterodyne quantum conditional entropy under a total photon budget and a strict physical memory dimension. It separates an uncertainty loss that additional storage can reduce from an erasure floor that no increase in dimension can remove. Preparation and noise model. The optical system has mmm modes and total mean photon number at most EEE. Its joint preparation with a memory is optimized over all normal mixed states, including arbitrary optical coherence and infinite photon tails. The input memory has dimension at most ddd. Independently, the entire register survives with probability 1−p1-p1−p or is erased into an orthogonal readable failure state. The physical output therefore has d+1d+1d+1 levels; a total qqq-qubit register permits d≤2q−1d\le2^q-1d≤2q−1. Every event is retained, with no postselection. For heterodyne measure d2mz/πmd^{2m}z/\pi^md2mz/πm and natural logarithms, the exact all-preparation reduction is Ver(m,d,E,p)=min⁡rank⁡ρ≤d,  Tr⁡(Nρ)≤E{W(ρ)−(1−p)S(ρ)}.V_{\rm er}(m,d,E,p)=\min_{\operatorname{rank}\rho\le d,\;\operatorname{Tr}(N\rho)\le E}\{W(\rho)-(1-p)S(\rho)\}.Ver​(m,d,E,p)=minrankρ≤d,Tr(Nρ)≤E​{W(ρ)−(1−p)S(ρ)}. Here WWW is Wehrl entropy, SSS is von Neumann entropy and NNN is total photon number. The rank constraint follows from pure attainment of the original mixed optical–memory problem. The objective describes quantum side information; it is not automatically the uncertainty achieved by a classical readout of the memory. An exact reliability ceiling. Define g(x)=(1+x)ln⁡(1+x)−xln⁡xg(x)=(1+x)\ln(1+x)-x\ln xg(x)=(1+x)ln(1+x)−xlnx, S∗=mg(E/m)S_*=m g(E/m)S∗​=mg(E/m), the ideal unlimited-memory value Bm(E)=m−Eln⁡(1+m/E)B_m(E)=m-E\ln(1+m/E)Bm​(E)=m−Eln(1+m/E), and aE=1−[(1+E/m)ln⁡(1+m/E)]−1a_E=1-[(1+E/m)\ln(1+m/E)]^{-1}aE​=1−[(1+E/m)ln(1+m/E)]−1. For any target excess satisfying 0<ε<aES∗0<\varepsilon<a_ES_*0<ε<aE​S∗​, pcrit=εmg(E/m).p_{\rm crit}=\frac{\varepsilon}{m g(E/m)}.pcrit​=mg(E/m)ε​. A finite register reaches Ver≤Bm(E)+εV_{\rm er}\le B_m(E)+\varepsilonVer​≤Bm​(E)+ε if and only if p<pcritp<p_{\rm crit}p<pcrit​. At equality only an infinite memory attains the target. Above the ceiling the target is impossible even with unlimited memory. Finite storage and reliability pay different costs. Let SdS_dSd​ be the largest entropy of any rank-at-most-ddd optical state within the same photon budget, and Δd=S∗−Sd\Delta_d=S_*-S_dΔd​=S∗​−Sd​. For 0≤p<aE0\le p<a_E0≤p<aE​, pS∗+(aE−p)Δd≤Ver−Bm(E)≤pS∗+(1−p)Δd.pS_*+(a_E-p)\Delta_d\le V_{\rm er}-B_m(E)\le pS_*+(1-p)\Delta_d.pS∗​+(aE​−p)Δd​≤Ver​−Bm​(E)≤pS∗​+(1−p)Δd​. The first contribution survives at unlimited dimension, whereas Δd\Delta_dΔd​ tends to zero as storage grows. An exact finite Gibbs program computes SdS_dSd​, including partially occupied photon shells. The two bounds give necessary and sufficient resource tests rather than an exact full finite-dimensional frontier. The unlimited-memory floor is obtained from an explicit scalar thermal optimization. Above its energy-use crossover the attaining thermal source uses less than the allowed energy. At 0<E≤10−40<E\le10^{-4}0<E≤10−4, 2≤d≤m+12\le d\le m+12≤d≤m+1 and p<1/8p<1/8p<1/8, an explicit vacuum–one-photon entangled preparation remains globally optimal over the full preparation class. Finite examples also reserve the failure flag inside the stated register and distinguish heralded erasure from unheralded replacement. The analysis builds on Gaussian Wehrl extremality theorems established in earlier literature and on Zixuan He's previous results on ideal-memory spectrum shaping and low-photon resource laws. Its additional contribution is the optimized finite-memory erasure contract, the exact feasibility boundary and physically budgeted attaining sources. The integrated 14-page article contains the complete proofs, two figure groups, finite certificates and references.
How much quantum memory is needed to retain the contributions of rare photon events to a measurement record? This paper determines the memory scales required to approach the best heterodyne conditional entropy when the total optical energy tends to zero. Its resource laws distinguish precisions for which counting photon configurations suffices from critical precisions at which energy-calibrated entropy corrections determine additional memory costs. Full preparation model and reference value. The optical system has mmm bosonic modes, total mean photon number at most EEE, and an entire accessible quantum side system BBB of dimension at most DDD, including retained preparation labels. The optical source and its correlations with the memory are optimized over all normal mixed states; arbitrary coherences and infinite photon tails are allowed. With natural logarithms and heterodyne measure dμ=π−md2mzd\mu=\pi^{-m}d^{2m}zdμ=π−md2mz, define Vm,D(E)=min⁡ρABHμ(Z∣B),Hμ(Z∣B)=hμ(Z)−χ(Z:B).V_{m,D}(E)=\min_{\rho_{AB}}H_\mu(Z|B),\qquad H_\mu(Z|B)=h_\mu(Z)-\chi(Z:B).Vm,D​(E)=minρAB​​Hμ​(Z∣B),Hμ​(Z∣B)=hμ​(Z)−χ(Z:B). Here ZZZ is the heterodyne outcome and χ\chiχ is Holevo information. The unlimited-memory optimum at the same energy is Bm(E)=m−Eln⁡(1+m/E),Dmin⁡(m,E,ε)=min⁡{D:Vm,D(E)−Bm(E)≤ε}.B_m(E)=m-E\ln(1+m/E),\qquad D_{\min}(m,E,\varepsilon)=\min\{D:V_{m,D}(E)-B_m(E)\le\varepsilon\}.Bm​(E)=m−Eln(1+m/E),Dmin​(m,E,ε)=min{D:Vm,D​(E)−Bm​(E)≤ε}. The tolerance ε\varepsilonε is a total conditional-entropy excess in nats. It is not a measurement-error probability. Classical side information satisfies Hμ(Z∣Y)≥mH_\mu(Z|Y)\ge mHμ​(Z∣Y)≥m; entangled quantum side information can go below this benchmark. The resource DDD is a Hilbert-space dimension, corresponding to ⌈log⁡2D⌉\lceil\log_2D\rceil⌈log2​D⌉ qubits. Precision selects a photon-number hierarchy. Along arbitrary joint limits m→∞m\to\inftym→∞, E→0E\to0E→0, with no prescribed relation between EEE and 1/m1/m1/m, εE→c>0⟹Dmin⁡∼e−cm.\frac{\varepsilon}{E}\to c>0\quad\Longrightarrow\quad D_{\min}\sim e^{-c}m.Eε​→c>0⟹Dmin​∼e−cm. For every fixed integer K≥2K\ge2K≥2, εEK→c∈(0,1/K!)⟹Dmin⁡∼(1−K!c)mKK!.\frac{\varepsilon}{E^K}\to c\in(0,1/K!)\quad\Longrightarrow\quad D_{\min}\sim(1-K!c)\frac{m^K}{K!}.EKε​→c∈(0,1/K!)⟹Dmin​∼(1−K!c)K!mK​. Although higher-photon events become rarer, they occupy increasingly many orthogonal mode configurations. Resolving their entropy contribution therefore requires a larger memory dimension. In qubits, the fixed-KKK law is Klog⁡2m+O(1)K\log_2m+O(1)Klog2​m+O(1). Critical precisions resolve costs beyond sector counting. At the exact tolerance E2/2E^2/2E2/2, the complete vacuum–one-photon head is not sufficient at leading dimension: Dmin⁡(m,E,E2/2)=m+1+(1+o(1))(m2+Em26).D_{\min}(m,E,E^2/2)=m+1+(1+o(1))\left(\frac m2+\frac{Em^2}{6}\right).Dmin​(m,E,E2/2)=m+1+(1+o(1))(2m​+6Em2​). The error is relative to the additional dimension in parentheses. Both terms come from the entropy of the mean-calibrated finite head, together with an all-state output-entropy comparison. At the next critical tolerance E3/6E^3/6E3/6, the paper determines an added-to-removed-level transition near the complete two-photon head (m+22)\binom{m+2}{2}(2m+2​), including the boundary near mE=4mE=4mE=4 and precisely qualified integer conclusions. An exact finite-energy source. For every finite mmm, 2≤D≤m+12\le D\le m+12≤D≤m+1, and 0<E≤10−40<E\le10^{-4}0<E≤10−4, let r=D−1r=D-1r=D−1 and choose orthonormal one-photon modes u1,…,uru_1,\ldots,u_ru1​,…,ur​. The preparation ∣Ψ⟩=1−E∣0⟩A∣0⟩B+E/r∑j=1r∣uj⟩A∣j⟩B|\Psi\rangle=\sqrt{1-E}|0\rangle_A|0\rangle_B+\sqrt{E/r}\sum_{j=1}^{r}|u_j\rangle_A|j\rangle_B∣Ψ⟩=1−E​∣0⟩A​∣0⟩B​+E/r​∑j=1r​∣uj​⟩A​∣j⟩B​ attains the original global minimum over the full preparation class. Its vacuum–one-photon support is a conclusion of the optimization, rather than an imposed photon cutoff. The paper also characterizes exact small-energy optima for every fixed complete photon head. A record-reconstruction interpretation with explicit resource accounting. A common finite heterodyne digitizer, including a genuine overflow symbol, approximates the conditional entropy uniformly over all legal preparations. For independent repetitions of a known preparation, classical–quantum Slepian–Wolf coding identifies the asymptotic reconstruction rate with H(X∣B)H(X|B)H(X∣B). The uniform comparison transfers the hierarchy to the excess optimized communication rate relative to unlimited finite memory using the same digitizer. Preserving the first critical formula requires digitization error ξ=o(E2/m+E3)\xi=o(E^2/m+E^3)ξ=o(E2/m+E3); the corresponding error scales for the separated second-critical regimes are also given. The decoder may act collectively after receiving the classical message. For nnn independent preparations, the supplied side-system dimension is at most DnD^nDn and total mean optical energy is at most nEnEnE. This is a supplied-memory resource law, not an optimization over arbitrary correlated block preparations, a minimum Schumacher-compressed storage rate, or a bound on peak decoder workspace. Coding limits are taken at fixed finite parameters before the low-energy, growing-mode limit. The work develops the low-photon, growing-mode regime of the preparation problem studied in Optimal entanglement weights for heterodyne uncertainty with finite quantum memory (doi:10.5281/zenodo.23647071). The integrated 29-page paper contains the complete proofs, three figures and two tables.
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 σ\sigmaσ at a beam splitter of signal transmissivity η\etaη. The requirement is Φη,σ(ρ)≤cIfor every normal input state ρ,0<c<1.\Phi_{\eta,\sigma}(\rho)\le cI\qquad\text{for every normal input state }\rho,\qquad 0<c<1.Φη,σ​(ρ)≤cIfor every normal input state ρ,0<c<1. Equivalently, every rank-one output projection has probability at most ccc and the receiver's output min-entropy is at least −ln⁡c-\ln c−lnc. Inputs may be mixed, non-Gaussian, arbitrarily energetic, and have infinite photon tails. Let d=⌈1/c⌉−1d=\lceil 1/c\rceil-1d=⌈1/c⌉−1. Throughout 0<η≤1/⌈1/c⌉0<\eta\le 1/\lceil 1/c\rceil0<η≤1/⌈1/c⌉, the minimum mean photon numbers of the actual bath are Nall(c,η)=d−cd(d+1)/21−η.N_{\mathrm{all}}(c,\eta)=\frac{d-cd(d+1)/2}{1-\eta}.Nall​(c,η)=1−ηd−cd(d+1)/2​. NG(c,η)=c−1−11−η.N_{\mathrm G}(c,\eta)=\frac{c^{-1}-1}{1-\eta}.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/jc=1/jc=1/j, for every integer j≥2j\ge2j≥2 and 0<η≤1/j0<\eta\le1/j0<η≤1/j, NG(1/j,η)=2Nall(1/j,η).N_{\mathrm G}(1/j,\eta)=2N_{\mathrm{all}}(1/j,\eta).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−dcr=1-dcr=1−dc, the attaining vacuum-output spectrum is λ∗=(c,…,c⏟d entries,r).\lambda_*=(\underbrace{c,\ldots,c}_{d\text{ entries}},r).λ∗​=(d entriesc,…,c​​,r). It majorizes every output of the same channel, so the minimum von Neumann entropy is exactly Smin⁡(Φη,σ)=−dcln⁡c−rln⁡r.S_{\min}(\Phi_{\eta,\sigma})=-dc\ln c-r\ln r.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,4j=2,3,4j=2,3,4, separate estimates prove Sout≥mln⁡jS_{\mathrm{out}}\ge m\ln jSout​≥mlnj for every finite number mmm of uses and arbitrary normal joint inputs, including cross-use entanglement. The environments vary with η\etaη 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∣\sigma=\lvert1\rangle\langle1\rvertσ=∣1⟩⟨1∣, at every 0<η<10<\eta<10<η<1. With h(η)=−ηln⁡η−(1−η)ln⁡(1−η),h(\eta)=-\eta\ln\eta-(1-\eta)\ln(1-\eta),h(η)=−ηlnη−(1−η)ln(1−η), it proves: Exact Sout≥mh(η)S_{\mathrm{out}}\ge mh(\eta)Sout​≥mh(η) at arbitrary finite blocklength for joint inputs invariant under each local photon-number phase rotation by 2π/q2\pi/q2π/q, q≥4q\ge4q≥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)S_{\mathrm{out}}\ge Mh(\eta)-o(M)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 mmm and interior η\etaη, all outputs remain a uniformly positive trace distance from every state of rank below 2m2^m2m, 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 mmm 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/321/321/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 DDD, while classical records and computation are unrestricted. At every actual waiting interval, the entire register independently survives unchanged with known probability aaa, or is erased with a classical flag. The quantity ka(D,m)k_a(D,m)ka​(D,m) is the smallest deterministic original-preparation cap achieving worst-case error at most 1/31/31/3. Failed preparations, discarded trials and reserved positions are all charged. A retained register of qqq qubits has D=2qD=2^qD=2q. An exact threshold for statistical advantage Without retained quantum information, the optimal sample order is Θ(m)\Theta(m)Θ(m). Along arbitrary growing-mode sequences, the precise criterion for improving that order is ka(D,m)=o(m)⟺am→∞ and aDm→∞. k_a(D,m)=o(m)\quad\Longleftrightarrow\quad am\to\infty\ \text{and}\ \frac{aD}{m}\to\infty. ka​(D,m)=o(m)⟺am→∞ and maD​→∞. The two conditions express separate capacity and survival requirements. Arbitrarily large storage cannot reduce the linear sample order when a=O(1/m)a=O(1/m)a=O(1/m), yet a survival probability tending to zero can still permit an advantage. Let A=max⁡{1,m2/D}A=\max\{1,m^2/D\}A=max{1,m2/D}. At the fixed energy and separation above, constants c,C>0c,C>0c,C>0, independent of m,D,am,D,am,D,a, give cmin⁡{m,A/a}≤ka(D,m)≤Cmin⁡{m,A/a+min⁡(a−2,m2/3)},0<a≤1. c\min\{m,A/a\}\le k_a(D,m)\le C\min\{m,A/a+\min(a^{-2},m^{2/3})\},\qquad 0<a\le1. cmin{m,A/a}≤ka​(D,m)≤Cmin{m,A/a+min(a−2,m2/3)},0<a≤1. At a=0a=0a=0, the sample cost is Θ(m)\Theta(m)Θ(m). For ideal memory the complete rate is k1(D,m)=Θ ⁣(min⁡{m,max⁡(1,m2/D)}). k_1(D,m)=\Theta\!\left(\min\{m,\max(1,m^2/D)\}\right). k1​(D,m)=Θ(min{m,max(1,m2/D)}). With loss, the bounds match whenever A≥min⁡{a−1,am2/3}A\ge\min\{a^{-1},am^{2/3}\}A≥min{a−1,am2/3}. For example, a=m−1/6a=m^{-1/6}a=m−1/6 and D=⌈m11/6⌉D=\lceil m^{11/6}\rceilD=⌈m11/6⌉ give Θ(m1/3)\Theta(m^{1/3})Θ(m1/3) preparations. The existence of sublinear advantage is fully characterized even where its optimal exponent remains bracketed: for D≥m2D\ge m^2D≥m2, a=m−1/2a=m^{-1/2}a=m−1/2, the stated bounds are Ω(m1/2)\Omega(m^{1/2})Ω(m1/2) and O(m2/3)O(m^{2/3})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 m2m^2m2 labels, only a positive register of dimension m+1m+1m+1 is retained. The three-visit route requires D≥m+1D\ge m+1D≥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τ\mathcal N=a\Psi+(1-a)\mathcal R_\tauN=aΨ+(1−a)Rτ​, where Ψ\PsiΨ is CPTP and Rτ(X)=Tr⁡(X)τ\mathcal R_\tau(X)=\operatorname{Tr}(X)\tauRτ​(X)=Tr(X)τ, an exact flagged-erasure simulation gives kN(D,m)≥ka(D,m)k_{\mathcal N}(D,m)\ge k_a(D,m)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)1-q=O(1/m)1−q=O(1/m) therefore forces Θ(m)\Theta(m)Θ(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.
Can correlations in an optical environment allow an entangled signal to produce a purer output than coherent light? This article removes that input optimization for a specified class of non-Gaussian noise, providing an exact entropy benchmark for every joint signal state. Exact maximum over all inputs. Consider m signal modes coupled locally to an initially independent environment ωE=∑xp(x)∣x⟩⟨x∣.\omega_E=\sum_x p(x)|x\rangle\langle x|.ωE​=∑x​p(x)∣x⟩⟨x∣. The sum runs over all binary photon-number histories, with zero or one photon in each environment mode. Their probability law p may have arbitrary correlations across the entire block. Environmental outputs are discarded. For the transmissivity vector η⃗=(η1,…,ηm)\vec{\eta}=(\eta_1,\ldots,\eta_m)η​=(η1​,…,ηm​), the channel satisfies Pmax⁡(p,η⃗):=sup⁡ρTr⁡[Φp,η⃗(ρ)2]=EX,Y∼p∏j=1mhηj(Xj,Yj),P_{\max}(p,\vec{\eta}):=\sup_{\rho}\operatorname{Tr}[\Phi_{p,\vec{\eta}}(\rho)^2]=\mathbb{E}_{X,Y\sim p}\prod_{j=1}^m h_{\eta_j}(X_j,Y_j),Pmax​(p,η​):=supρ​Tr[Φp,η​​(ρ)2]=EX,Y∼p​∏j=1m​hηj​​(Xj​,Yj​), where X,YX,YX,Y are independent draws from the same complete bath law and hη(0,0)=1,hη(0,1)=hη(1,0)=η,hη(1,1)=η2+(1−η)2.h_\eta(0,0)=1,\qquad h_\eta(0,1)=h_\eta(1,0)=\eta,\qquad h_\eta(1,1)=\eta^2+(1-\eta)^2.hη​(0,0)=1,hη​(0,1)=hη​(1,0)=η,hη​(1,1)=η2+(1−η)2. The equality holds for every common η∈[0,1]\eta\in[0,1]η∈[0,1], and separately when all transmissivities lie in [1/2,1][1/2,1][1/2,1] or all lie in [0,7/24][0,7/24][0,7/24]. The supremum includes arbitrary normal mixed and entangled inputs without a signal-energy restriction. Vacuum and every coherent product input attain it. The right-hand side is the collision probability of the vacuum-output distribution, not of the bath histories themselves. What correlations change. Two explicit baths with identical one- and two-mode marginals, identical corresponding reduced signal channels and equal mean photon budgets have exponentially versus polynomially decaying maximum output purity. At balanced coupling and 31 modes, their maxima differ by approximately 2080. The large separation already follows from a vacuum construction and the established independent-bath result; the new all-input theorem fixes the correlated bath's exact optimum. A Markov example turns the infinite-dimensional optimization into a four-dimensional transfer calculation. Mechanism and boundaries. The proof retains the even total relative-photon parity imposed by two identical signal copies and controls the cross terms between distinct bath histories. Convexity and bounded-operator continuity return the comparison to all normal inputs, including infinite photon tails. Diagonality of the bath is essential: an explicit coherent binary bath allows a noncoherent signal to outperform all coherent products. For arbitrary heterogeneous couplings uniformly separated from zero and one, exponential suppression of maximum purity is equivalent to an exponentially small probability of a whole-block low-occupation event. The results give lower bounds on output second Rényi entropy and necessary ranks for approximating the complete output. They do not determine ordinary-entropy additivity or communication capacity; a same-bath comparison shows that a history-conditioned entropy method can give a tighter communication bound than exact purity. The independent contribution extends exact all-input purity beyond independent non-Gaussian baths, while retaining the attribution of Gaussian extremality, replica methods and classical collision calculations. The integrated 19-page PDF contains two figure groups, complete proofs and references. Its finite zero-click example is a theoretical test of two specified bath models with explicit reset, detection and mean-energy assumptions.