How much must an optical catalyst change when it supplies photons to an initially empty signal? This article gives an exact finite-budget benchmark: a specified unconditional probability of producing a nonvacuum signal requires a minimum disturbance of the entire returned catalyst, even when the output may be correlated. Exact return-error frontier. Let the catalyst have initial mean photon number at most \(E\), while the signal and all other auxiliary ports start in vacuum. A deterministic unitary strongly conserves total photon number. Define \(a\) as the actual, unconditional probability that the output signal is nonvacuum, and \(d_C=\tfrac12\|\tau'_C-\tau_C\|_1\) as the catalyst's return error. For \(0\lt a\le1\) and \(E\ge a\), put \[ m=\left\lfloor\frac{2E}{a}-1\right\rfloor,\qquad F(E,a)=\frac{2[(m+1)a-E]}{m(m+1)}. \] Every allowed process satisfies \(d_C\ge F(E,a)\), and a finite-mode catalyst with a passive cyclic permutation attains equality for every feasible pair \((E,a)\). If \(E\lt a\), the event probability is infeasible; if \(a=0\), the minimum error is zero. The converse covers normal states with photon-number coherence, infinite photon tails, finitely or countably many modes, correlations with an untouched reference, and correlated outputs. The same lower bound holds for the joint catalyst–reference return distance. Equality is a global optimization over the catalyst, its modes, the operation and the reference association, not a guarantee for each preselected catalyst. A convenient consequence is \[ d_C\ge\frac{a^2}{2E-a},\qquad E\ge\frac a2+\frac{a^2}{2d_C}. \] This smooth bound agrees with the exact frontier at the discrete budgets \(E/a=(m+1)/2\). For certain photon production, \(a=1\), a return error of one per cent requires at least 50.5 photons of initial mean catalyst number, and the construction attains this budget. Mechanism and prior work. A common input–output number record preserves the actual source and its conservation law. Every successful event crosses a number threshold, whose lost probability is bounded by the return trace distance. The mean photon budget then limits how this event probability can be distributed across thresholds. Filling the lowest levels first gives the exact piecewise frontier. Energy-ladder shifts, energy-constrained embezzlement and the equal-weight optical queue are established ingredients; the contribution here is the all-process converse and its attained finite-budget frontier for arbitrary event probability. The matching source uses a weighted version of the known queue. What the guarantee means. For a single signal mode with prescribed negative parity \(-\operatorname{Tr}[(-1)^{N_S}\rho'_S]=s\), \(0\lt s\le1\), the exact globally optimized return cost is \(F(E,(1+s)/2)\), with feasibility requiring \(E\ge(1+s)/2\). The attaining permutation transfers negativity already present in the catalyst; it does not create that resource from a Wigner-positive source. The budget counts mean photon number, not a per-run photon cutoff or physical energy at arbitrary unequal mode frequencies. The catalyst loses at least \(a\) photons on average in every allowed process, so a small single-use trace-distance change does not imply cost-free restoration or repeated use. Populated auxiliary inputs and postselected success branches obey different resource conditions. The integrated seven-page PDF contains two figures, the complete proofs and references; its constructions and curves are theoretical, not experimental performance claims.
How much must an optical catalyst change when it supplies photons to an initially empty signal? This article gives an exact finite-budget benchmark: a specified unconditional probability of producing a nonvacuum signal requires a minimum disturbance of the entire returned catalyst, even when the output may be correlated. Exact return-error frontier. Let the catalyst have initial mean photon number at most (E), while the signal and all other auxiliary ports start in vacuum. A deterministic unitary strongly conserves total photon number. Define (a) as the actual, unconditional probability that the output signal is nonvacuum, and (d_C=\tfrac12|\tau'_C-\tau_C|_1) as the catalyst's return error. For (0\lt a\le1) and (E\ge a), put [ m=\left\lfloor\frac{2E}{a}-1\right\rfloor,\qquad F(E,a)=\frac{2[(m+1)a-E]}{m(m+1)}. ] Every allowed process satisfies (d_C\ge F(E,a)), and a finite-mode catalyst with a passive cyclic permutation attains equality for every feasible pair ((E,a)). If (E\lt a), the event probability is infeasible; if (a=0), the minimum error is zero. The converse covers normal states with photon-number coherence, infinite photon tails, finitely or countably many modes, correlations with an untouched reference, and correlated outputs. The same lower bound holds for the joint catalyst–reference return distance. Equality is a global optimization over the catalyst, its modes, the operation and the reference association, not a guarantee for each preselected catalyst. A convenient consequence is [ d_C\ge\frac{a^2}{2E-a},\qquad E\ge\frac a2+\frac{a^2}{2d_C}. ] This smooth bound agrees with the exact frontier at the discrete budgets (E/a=(m+1)/2). For certain photon production, (a=1), a return error of one per cent requires at least 50.5 photons of initial mean catalyst number, and the construction attains this budget. Mechanism and prior work. A common input–output number record preserves the actual source and its conservation law. Every successful event crosses a number threshold, whose lost probability is bounded by the return trace distance. The mean photon budget then limits how this event probability can be distributed across thresholds. Filling the lowest levels first gives the exact piecewise frontier. Energy-ladder shifts, energy-constrained embezzlement and the equal-weight optical queue are established ingredients; the contribution here is the all-process converse and its attained finite-budget frontier for arbitrary event probability. The matching source uses a weighted version of the known queue. What the guarantee means. For a single signal mode with prescribed negative parity (-\operatorname{Tr}[(-1)^{N_S}\rho'_S]=s), (0\lt s\le1), the exact globally optimized return cost is (F(E,(1+s)/2)), with feasibility requiring (E\ge(1+s)/2). The attaining permutation transfers negativity already present in the catalyst; it does not create that resource from a Wigner-positive source. The budget counts mean photon number, not a per-run photon cutoff or physical energy at arbitrary unequal mode frequencies. The catalyst loses at least (a) photons on average in every allowed process, so a small single-use trace-distance change does not imply cost-free restoration or repeated use. Populated auxiliary inputs and postselected success branches obey different resource conditions. The integrated seven-page PDF contains two figures, the complete proofs and references; its constructions and curves are theoretical, not experimental performance claims.
This work gives a resource law for engineering optical noise: how many photons must a single environment mode contain to prevent any signal from producing an output that is too spectrally concentrated? It provides an explicit optimal bath preparation, a matched Gaussian benchmark, and separately proved guarantees for correlated repeated use. Exact photon cost of a spectral noise guarantee A signal mixes with an independently prepared bath σ at a beam splitter of signal transmissivity η. The requirement is Φη,σ(ρ)≤cIfor every normal input state ρ,0<c<1. Equivalently, every rank-one output projection has probability at most c and the receiver's output min-entropy is at least −lnc. Inputs may be mixed, non-Gaussian, arbitrarily energetic, and have infinite photon tails. Let d=⌈1/c⌉−1. Throughout 0<η≤1/⌈1/c⌉, the minimum mean photon numbers of the actual bath are Nall(c,η)=1−ηd−cd(d+1)/2.NG(c,η)=1−ηc−1−1. The first optimization includes all normal bath states and has a unique finite-support minimizer. The second includes all Gaussian density operators, with arbitrary squeezing and displacement; a centered thermal bath attains it. The coupling and spectral requirement are identical in both comparisons. At c=1/j, for every integer j≥2 and 0<η≤1/j, NG(1/j,η)=2Nall(1/j,η). Between reciprocal budgets the ratio varies. The cost counts mean photons in the physical bath, not laboratory preparation work or the energy of an auxiliary purification. A physical preparation and its complete single-use spectrum Writing r=1−dc, the attaining vacuum-output spectrum is λ∗=(d entriesc,…,c,r). It majorizes every output of the same channel, so the minimum von Neumann entropy is exactly Smin(Φη,σ)=−dclnc−rlnr. The other positive-order Rényi minima are fixed by the same spectrum. Coherent inputs attain these minima. The proof identifies an actual optical dilation whose port antisymmetry enforces the all-input occupation bound. Exact examples also show that baths with identical energy and covariance can have different optimized entropy floors. What survives entangled repeated use For the same resource-optimal flat-output families of ranks j=2,3,4, separate estimates prove Sout≥mlnj for every finite number m of uses and arbitrary normal joint inputs, including cross-use entanglement. The environments vary with η along their specified families. Further results give sharp tensorized purity bounds for the entire three-level diagonal bath simplex and for every Fock environment at balanced coupling. The paper then treats a different, fixed bath, σ=∣1⟩⟨1∣, at every 0<η<1. With h(η)=−ηlnη−(1−η)ln(1−η), it proves: Exact Sout≥mh(η) at arbitrary finite blocklength for joint inputs invariant under each local photon-number phase rotation by 2π/q, q≥4. Coherence and entanglement within residue sectors and infinite tails remain allowed. The residue-zero restricted channel also has strong minimum-output-entropy additivity with arbitrary normal partner channels. The same exact entropy floor for up to three globally total-phase-invariant input modes, without a mean-energy limit. Sout≥Mh(η)−o(M) for physical-mode permutation-invariant inputs of finite mean energy density, with explicit errors and full infinite-tail control. For every fixed m and interior η, all outputs remain a uniformly positive trace distance from every state of rank below 2m, without any input-energy bound. This covers nonbalanced parameters where the older purity-based distance bound vanishes; the new positive constant is spectrally implicit. Interpretation and scope The input classes above are not nested, and an entropy rate, a finite-block entropy floor and a low-rank distance are distinct guarantees. The fixed single-photon bath is not generally the resource-optimal bath. Complete unrestricted nonbalanced single-photon entropy additivity and exact classical capacity remain open. A spectral noise guarantee constrains output mixing; it does not mean that all input information or reference correlations are erased. The article separates this issue through actual resolved-erasure qubit restrictions, antidegradability of the specified optimal reciprocal families, and a classical capacity bracket under a true signal-energy budget. The integrated 52-page article contains six scientific figures, the complete proofs, and the mathematical data needed to reconstruct its finite certificates. Logarithms and entropy values use natural units unless bits are explicitly stated.
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∣. 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), the channel satisfies Pmax(p,η):=supρTr[Φp,η(ρ)2]=EX,Y∼p∏j=1mhηj(Xj,Yj), where X,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. The equality holds for every common η∈[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.
How much quantum memory is needed to restore an unknown optical pulse together with its correlations? This paper gives matching storage laws showing that the answer depends on the actual joint preparation, even when the optical marginal is a positive mixture of coherent states. Fix an optical mode number m, a known real k-dimensional displacement subspace with 1≤k≤2m, and a positive mean photon budget U0. The source is any probability mixture of coherent states in that subspace with actual mean photons at most U0. One normal encoder and decoder must work for the entire unknown source class, and every transmitted message or flag counts toward the same register dimension. The reference is inaccessible to both maps. Let δ be the required half trace-distance error and qmin(δ) the least encoded qubit count. As δ↓0, qmin(δ)=⎩⎨⎧2klog2(1/δ)+O(1),klog2(1/δ)+O(1),optical marginal or joint coherent preparation,arbitrary reference extension or classical-bit reference. A single inaccessible classical bit already witnesses the larger leading cost. To recover the smaller cost for correlations, the joint source must actually be prepared as ωAB=∫∣Jx⟩⟨Jx∣⊗τB(x)dμ(x), with ∫∣x∣2dμ≤U0. Here J is the known displacement embedding and τB(x) may be noncommuting normal reference states. The constants are uniform in the reference dimension and the orientation of J; the codec may depend on the known J. The mechanism is the difference between the probability of a rare bright component and the square-root amplitude of its retained correlations. Exact optical Gram matrices and a reference-coherence witness establish the converse for arbitrary normal decoders, including infinite-rank outputs. A common finite optical subspace supplies the attaining compression schemes while retaining the full photon tails. These are single-input universal memory-dimension laws at fixed m,k,U0, with every communication resource counted. They complement established known-source and many-copy compression theory. The integrated 10-page PDF contains two figures, complete proofs and references.
Quantum illumination uses a retained idler to improve detection of a weak optical return in thermal noise. For a source designer, the practical resource question is how much ideal quantum storage is needed for a specified improvement. This work gives the exact asymptotic answer when the signal-photon budget and the total retained-register dimension are constrained independently. Exact finite-memory frontier Consider a thermal attenuator with transmissivity 0<η<1 and vacuum-output background occupation b>0, tested against the replacer that returns the same thermal state. For n parallel uses, every admissible probe obeys a mean total signal-photon ceiling nN and a strict bound dimR≤⌊enP⌋ on the entire retained register, including retained source records. The memory rate is P/ln2 ideal qubits per use. With vanishing miss probability, the optimal false-alarm exponent is Ξ(N,P)=ηln(1+1/b)N+G(min{P,g(N)}). Here all logarithms are natural, g(x)=(x+1)ln(x+1)−xlnx, with g(0)=0, and G(p)=g(b)+p−F(g−1(p)). The function F(x) is the entropy of the full complementary output for a thermal input of mean occupation x; the complement includes the purification of the thermal environment. The first term in Ξ is the optimum without retained memory, and G is the additional detection benefit. The converse covers arbitrary normal mixed probes, correlations across channel uses and collective measurements. Matching sources satisfy the actual finite-register and energy bounds: they allocate photons between signal–idler correlations and a known displacement, and approach the frontier through finite-support preparations. How much storage is useful? The exact saturation rate and initial marginal value are Psat(N)=g(N),G′(0+)=1+bη. Because G is strictly increasing and strictly concave, at a positive signal budget N>0 the minimum rate retaining a fixed fraction 0<r<1 of the full additive memory benefit is Pr(N)=G−1(rG(g(N)))<rg(N). At low brightness, Pr(N)∼rg(N). At high brightness, this fixed-fraction storage cost remains bounded while the exact-saturation cost diverges. The relative detection benefit simultaneously tends to zero: saving a large fraction of the saturation storage does not imply a large improvement over the total no-memory exponent. Connection to optical communication For the same thermal channel, let C(N,P) denote the classical capacity under the corresponding photon budget and a strict initial maximally entangled Schmidt-rank supply. The two separately defined tasks satisfy Ξ(N,P)−Ξ(N,0)=C(N,P)−C(N,0). This identity equates optimized incremental values, not the physical resources or protocols. The manuscript explicitly attributes the shared Gaussian-reference contraction and entropy-support tools to the capacity analysis. Its detection-specific contribution is the original-register mixed-probe converse, strict finite-register attainment and operational testing limit. Scope. The result concerns parallel, phase-known thermal attenuation, ideal retained storage and the vanishing-miss Stein criterion. It is an asymptotic resource benchmark rather than a finite-sample receiver or a noisy-memory optimum. The integrated article includes the complete proofs and two figure groups showing both storage cost and the value obtained from it.
How much classical information can a noisy optical channel carry when both signal energy and preshared entanglement are limited? This work gives an exact capacity frontier for this joint resource problem. It allows one to determine the best asymptotic communication rate, price the benefit of additional entanglement, and distinguish the effect of tolerating errors from that of changing how entanglement is supplied. Exact capacity under two resource constraints The setting is any fixed bosonic Gaussian channel Φ with finitely many input and output modes. Signal energy is measured by a positive quadratic Hamiltonian HG=21RTGR, with G>0 and ground energy E0; R collects the canonical quadratures. The budgets satisfy E≥E0 and P≥0. For an n-use code, the mean total signal energy is at most nE, while the same initially shared maximally entangled state has Schmidt rank Kn satisfying logKn≤nP. Thus P is a strictly supplied entanglement rate. Encoders may be arbitrary joint quantum operations, and decoding may be collective. The classical capacity is C(E,P)=maxU≥Vphysical21Tr(GU)≤E,SG(V)≤P[SG(ΦU)+SG(V)−SG(ΦcV)]. Here V is a Gaussian seed covariance, U is the average-input covariance, and U−V is the displacement-modulation covariance. A covariance is physical when V+iΩ/2≥0, where Ω is the canonical commutation matrix and the vacuum covariance is I/2. The notation SG denotes Gaussian von Neumann entropy, and Φc is the full complementary channel, including any environment purification. All logarithms are natural, so rates are in nats per channel use. This formula replaces optimization over arbitrary quantum block codes by a finite-dimensional covariance optimization. It supplies both an achievable rate and a converse against non-Gaussian, correlated encodings. At P=0, it also determines the unassisted capacity of general fixed finite-mode Gaussian channels, including channels without a passive decomposition into independent modes. The reduction specifies the exact capacity value; it does not require a closed-form optimizer for every device. Energy and strict entanglement supply respond differently to errors For a fixed allowed average error 0≤ε<1, the exact capacity under the mean-energy constraint is Cε(E,P)=C(E0+1−εE−E0,P). Allowing failure rescales the mean energy above the ground state, but leaves the strict initial entanglement budget unchanged. The proof uses an exponential strong converse for codes whose inputs obey a hard total-energy cutoff. In a different model, where a readable flag permits random entanglement supply constrained only on average, the work establishes an achievable bound and a strict small-supply advantage for thermal attenuation at positive energy and fixed nonzero error. That comparison identifies the operational importance of the supply rule; it is not a complete capacity characterization of the flagged model. The communication value of entanglement For a thermal attenuator, let 0<η<1 be the transmissivity, b>0 the output mean photon number for vacuum input, and N the input mean photon number. Write its capacity as CN(P), and define g(N)=(N+1)log(N+1)−NlogN. The gain from entanglement obeys the sharp bound 0≤CN(P)−CN(0)≤1+bηP. For every fixed N>0, the coefficient η/(1+b) is attained as the initial right derivative at P=0. In the low-photon limit, the stronger resource law is CN(P)−CN(0)=1+bηmin{P,g(N)}+O(N),N↓0. The remainder is uniform over P≥0 at fixed η and positive b. Noise therefore determines the conversion efficiency, while g(N)∼Nlog(1/N) sets the entanglement scale sufficient for saturation. This uniform limit concerns the entanglement budget, not a simultaneous limit of vanishing thermal noise. Multimode resource allocation and scope A coupled two-mode example demonstrates how the frontier can guide resource allocation. A global resource-price certificate proves that a legal covariance pair exceeds the entire common-passive-frame Gaussian profile hull by at least 10−5 nat per two-mode use at specified budgets. The comparison includes all common passive frames, local squeezing and average-resource mixtures. The mechanism is the freedom to choose different mode allocations for the seed and average input; the benchmark is this precisely defined Gaussian class, rather than all unentangled encodings. The universal scope is the stated family of fixed finite-mode Gaussian channels, positive quadratic signal costs and strict initial maximally entangled Schmidt-rank supply, with unrestricted joint encoding and collective decoding. The model has no feedback or credit for returned entanglement. The capacity frontier and its resource consequences provide a common way to assess optical communication designs under these operational constraints.
How far can an amplifier's complete photon-count record depart from its coherent-light reference when the output entropy and the source's mean-photon budget are known? This article determines sharp endpoint laws for that inference. Photon counting reads occupations, but coherence changes the entropy cost of producing those occupations; the available energy budget selects the most efficient coherent pattern. A common physical comparison. For one optical mode, let μ=Tr(aρ), ρc=D(−μ)ρD(μ), and Ec=Tr(Nρ)−∣μ∣2. The reference is the source's actual field mean. For the quantum-limited amplifier A2 of gain two with a vacuum auxiliary mode, define Δ(ρ)=g−1(S(A2ρ))−1,T(ρ)=21∑k≥0⟨k∣A2(ρc)∣k⟩−2−k−1, where S is von Neumann entropy in nats and g(x)=(x+1)log(x+1)−xlogx. Thus Δ is an output quantum-entropy excess expressed in photon units, rather than the Shannon entropy of the observed counts. The constrained frontier is FE(δ)=sup{T(ρ):Ec(ρ)≤E,Δ(ρ)≤δ}. Three sharp endpoints. For every fixed finite E>0, FE(δ)=169δ+o(δ),δ↓0. Weak squeezing attains this coefficient. The corresponding local ratio also holds on every fixed finite number of modes, using the complete joint count record and the total entropy photon-number excess. Its neighbourhood may depend on the fixed mode count and energy budget. For centred mean-photon budgets m=1,2, put Λm=1−2−m and δmsat=g−1(S(A2(∣m⟩⟨m∣)))−1. The exact saturated frontier is Fm(δ)=Λm for δ≥δmsat, and its approach from below obeys Fm(δ)=Λm−cm(δmsat−δ)+o(δmsat−δ), with c1≃0.73151177, c2≃0.16207193, δ1sat≃0.92689630, and δ2sat≃1.70174873. The article gives exact expressions and certified numerical enclosures. Mean-cancelling vacuum/one-/two-photon superpositions attain the first saturation slope; phase-aligned zero-/two-/four-photon superpositions attain the second. The pure-state and full mixed-state optimizations have the same endpoint coefficients. Scope and mechanism. The budgets constrain centred mean energy, not the maximum photon number in each preparation. The proofs retain arbitrary normal mixed states and moving infinite photon tails. They combine uniform entropy comparisons with a decomposition that keeps the coherent part and mixed remainder tied to the same physical source. The endpoint laws concern a fixed ideal channel and its full count distribution; learning the reference and estimating entropy require separate measurement resources. The intermediate frontiers are not interpolated or claimed to be globally solved. This independent article complements entropy-minimization and single-event no-click bounds by treating the complete count law with actual-mean compensation. The integrated 27-page PDF contains four figure groups, complete proofs, reconstructible coefficient certificates and references.