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

The Cost of a Quantum Reference: Sharp Limits on Discrimination, Coherence and Precision

Ahmet Faruk Arapoglu

Published Nov 14, 2026• 0 citations
Publisher

Abstract

A quantum phase reference must repay both its size and the precision that keeps it coherent. For complementary binomial signals with cyclic phase noise and an unknown common phase, we derive exact resource laws for binary discrimination. A contracting variational operator gives the ideal error exponent over every independent reference state and joint measurement. An entropy crossing identifies the sharp two-charge recovery threshold, p_G = 0.197884450826..., with a certified rational enclosure. Above this threshold, two charges attain the entire global ideal partial-recovery curve; at p = 0.3 and equal phase-use costs, the optimal charged exponent is 67.57% above counting. A finite polynomial comparison proves balanced-population exponent optimality for every bias and visibility. Under intermittent complete phase randomization, a tapered multi-charge profile attains a matching converse at a finite linear span and can outperform every two-charge design at the same noise rate and resource prices. Within the two-charge architecture, charging control precision yields an exact matching principle for monotone costs and three distinct regimes: bulk effort sublinear in log-precision preserves the ideal price law, linear effort renormalizes it, and superlinear effort makes counting optimal. Separately charged, diverging local precision costs also remove the advantage in an explicit independent-dephasing implementation. Finite converses, constructive receivers and reproducible certificates connect the attainable quantum gain to the resources required to realize it. This record archives the same scientific work as the manuscript titled Finite phase references: sharp resource and precision limits for quantum discrimination, under an alternative repository title. It is an author preprint; journal peer review has not been completed. The main manuscript, two proof supplements, LaTeX sources and computational materials are included. Version P19_9994. Access to all files is restricted, with no automatic release date. Bibliographic metadata are public.

DOI
10.5281/zenodo.24222046

Related papers

Sharp support transitions and Gaussian recovery for quantum references

Ahmet Faruk Arapoglu

A finite quantum phase reference can restore information lost by counting, but occupied support and phase noise impose different limits. For complementary binomial signals with sublinear cyclic order, we establish these limits and compare designs under a declared resource budget. At critical uniform-dephasing quality, bounded support attains the full coherent error exponent precisely above the bias threshold p* = (1 − 1/√2)/2. At and below it, every fixed support bound leaves a positive gap, while arbitrarily slow support growth suffices. Near the threshold from above, a geometric construction needs only logarithmically many charges in the inverse distance to the threshold. Four charges are necessary and sufficient for 3/10 ≤ p < 1/2. Gaussian recovery also depends on how rapidly the cyclic order grows. Widths decaying as a power faster than the inverse square root of signal size recover the ideal exponent at any fixed span ratio when cyclic order grows slower than the logarithm of that size. When cyclic order grows faster than this logarithm, every fixed polynomial precision loses its exponential advantage. The ideal optimized rate survives logarithmic precision costs and a declared polynomial charge for the largest protected subspace dimension in an occupied block. At a common budget, an explicit four-charge reference outperforms the fully optimized two-charge class. Explicit constructions and converses over all reference states distinguish occupied support, register span and noise as separate resources. Author preprint, version V2.7. The main manuscript, complete proofs, LaTeX sources, computational resource and alternative figure/table descriptions are included. The scientific content and author declarations are preserved; journal-specific packaging and the editorial cover letter are excluded. All files are embargoed until 15 February 2027, when they will automatically become publicly accessible. Bibliographic metadata are public.

•Nov 14, 2026•0 citations

Rare-component quantum calibration: sharp costs and stopping limits

Ahmet Faruk Arapoglu

We determine how errors in a coherent receiver's outputs change the cost of calibrating an exponentially rare quantum component. For a smooth moment-matched phase family, one receiver exposes informative events that counting misses. The optimal robust cost follows an explicit curve: an ideal-cost plateau ends at a tail-mass threshold, then an increasing branch approaches the feasibility boundary. One stopping rule attains this exponent at every unknown label, even when conditional errors depend on the observed history. Near the boundary, the remaining contamination margin δ and an explicit midpoint variance v* determine a finer law. As δ and the error target α vanish, the minimax cost is 2v* δ⁻² log(1/α), without a relative-rate restriction for a fixed receiver. This coefficient governs fixed sampling and every fixed positive-moment cost of arbitrary randomized stopping; a single clean source forces the lower bound. A uniform theorem carries the constant to changing finite receivers under explicit margin conditions and gives a computable critical strip for the physical family. These laws locate the loss of efficient calibration and quantify the cost of approaching the last feasible regime. This author preprint includes the main manuscript, complete proofs, LaTeX sources and computational materials. Journal peer review has not been completed. The scientific files are preserved unchanged; author identity is provided in the record metadata and the accompanying README. Version V1.7. All files are embargoed until 1 February 2027, when they will automatically become publicly accessible. Bibliographic metadata are public.

•Nov 14, 2026•0 citations

Retained Quantum Records: Recovery Limits and Control-Dependent Formation Costs

Kent Nimmo

AbstractRetained measurement records constrain recoverability, but their formation also depends on the available physical controls. We give exact, constructively attained answers to both questions in two specified models. For a balanced nondemolition qubit process with actual binary observer memories unavailable to the decoder, we determine the maximum recovery compatible with average readout accuracy and pair agreement. The finite-record solution includes its feasible region and a common memory-writing and recovery process, without assuming exchangeability of observed records. Under a complete conditional-pairwise-independence promise at fixed informative accuracy, the optimal coherence has a sharp inverse-square-root asymptotic; fully conditionally independent records instead give exponential decay. Thus identical single-record and pair-record calibrations need not justify the product-law recovery bound. We then fix a logical code in four spin-3/2 systems and sequential diagonal contacts with exact controlled-swap endpoints. Hard budgets for net contact action and added spectral control charge yield an exact peak-excursion frontier within a declared quadratic-plus-cubic control class. A single positive-amplitude preparation jointly attains the record, recovery and occupation requirements, connecting the two results through an exact finite-dimensional optimization. A closed three-record example distinguishes fixed complete records from fixed averaged data. Separately calibrated imperfect contacts admit one-sided finite-error extensions. Together, the results characterize both informational compatibility and control-dependent formation through common attaining apparatuses.Preprint status and related materialsAuthor-submitted preprint; not peer reviewed or accepted for publication. This theoretical and computational work addresses the compatibility of retained binary quantum records with optimized accessible-system recovery, and the control-dependent resources required to form those records in a specified spin encoding. The article provides exact finite-record bounds, attainable recovery and resource frontiers, and calibrated finite-error qualifications. The manuscript has been submitted to Foundations of Physics for journal consideration; this Figshare record is not a journal publication. The technical supplement is included as a second PDF in this same record. Related software, verification code, exact certificates, and selected computational evidence are available separately at https://doi.org/10.6084/m9.figshare.34886079 under the MIT licence. When a journal version of record becomes available, a link to its DOI will be added here.AuthorKent Nimmo; Independent Researcher, Vancouver, British Columbia, Canada; ORCID 0009-0003-8503-8891.Reading and related workBrowse Quantum Foundations for related work on records, access and measurement, and Mathematics for exact bounds and certified constructions. The MIT software/certificate archive remains a distinct record from these manuscript PDFs.

•Nov 2, 2026•0 citations

Local Access and Phase Recovery of Source-Tagged Quantum Records

Qingchun Zhang

A quantum record can have locally accessible populations while its distinguishing phase remains correlated with a distant source. We study this access boundary in a specified finite recording apparatus with a returning, vacuum/one-excitation source. Source-position weights give finite-time cutoff bounds without removing any physical hopping or return coupling. For an initially far-tagged record and its incoherent mixture, every reader in a declared position-preserving local-control class obeys a phase-visibility envelope and a necessary access-time inequality. A separate finite local probe shows why that state-discrimination limit is not an unrestricted limit on distinguishing two dynamical laws: fresh local coherence can reveal a stipulated added dephaser without recovering the old record phase. We construct a bounded, degree-three reader accessing only source positions 1–32. With the initial tag fixed at position 65, exact finite-source arrival certificates and an analytical tail comparison yield recovery uniformly over every finite total source length at least 65. Accessible control faults are charged against the arrived signed-phase norm, while source-moving drift is charged against the full norm. At the fixed deadline 25.02/J, the matched phase-dependent difference between coherent and archive-gated dynamics exceeds 0.005, including the stated simultaneous control faults and four additional absolute response allowances of 0.008 each. Complementary results cover a vacuum-ready source and a stronger endpoint-prepared finite example. The conclusions are conditional on the supplied model, preparations, common realized controls and calibration bounds. They are not a switchable-fundamental-law experiment, a nuisance-independent classifier, an optimal-speed theorem or an end-to-end formal verification. The supporting Lean companion contains 59 declarations in eight modules with accepted returned Mac compilation, type and axiom evidence; physical analytical interfaces remain explicit hypotheses or outside that subset. The deposit files include the main manuscript, technical supplement and full research/reproduction package.

•Oct 20, 2026•0 citations

Coherence and sharp endpoint laws for photon counting in quantum amplifiers

Zixuan He

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 \(\mu=\mathrm{Tr}(a\rho)\), \(\rho_c=D(-\mu)\rho D(\mu)\), and \(E_c=\mathrm{Tr}(N\rho)-|\mu|^2\). The reference is the source's actual field mean. For the quantum-limited amplifier \(\mathcal A_2\) of gain two with a vacuum auxiliary mode, define \[\Delta(\rho)=g^{-1}(S(\mathcal A_2\rho))-1,\qquad T(\rho)=\tfrac12\sum_{k\ge0}\left|\langle k|\mathcal A_2(\rho_c)|k\rangle-2^{-k-1}\right|,\] where \(S\) is von Neumann entropy in nats and \(g(x)=(x+1)\log(x+1)-x\log x\). Thus \(\Delta\) is an output quantum-entropy excess expressed in photon units, rather than the Shannon entropy of the observed counts. The constrained frontier is \[F_E(\delta)=\sup\{T(\rho):E_c(\rho)\le E,\ \Delta(\rho)\le\delta\}.\] Three sharp endpoints. For every fixed finite \(E>0\), \[F_E(\delta)=\frac9{16}\delta+o(\delta),\qquad\delta\downarrow0.\] 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 \(\Lambda_m=1-2^{-m}\) and \(\delta_m^{\mathrm{sat}}=g^{-1}(S(\mathcal A_2(|m\rangle\langle m|)))-1\). The exact saturated frontier is \(F_m(\delta)=\Lambda_m\) for \(\delta\ge\delta_m^{\mathrm{sat}}\), and its approach from below obeys \[F_m(\delta)=\Lambda_m-c_m(\delta_m^{\mathrm{sat}}-\delta)+o(\delta_m^{\mathrm{sat}}-\delta),\] with \(c_1\simeq0.73151177\), \(c_2\simeq0.16207193\), \(\delta_1^{\mathrm{sat}}\simeq0.92689630\), and \(\delta_2^{\mathrm{sat}}\simeq1.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.

•Nov 8, 2026•0 citations

Exact local phase readout in commuting spin stars and noise selection of balanced three-qubit decoding

Daniel Pavlica

This theoretical and computational preprint studies how the direction of central-qubit noise affects optimal local readout of a multipartite GHZ phase. The task is equal-prior discrimination of GHZ+ and GHZ- by a final measurement of one central qubit, using commuting spin-star interactions with fixed axes and a bound on the instantaneous sum of absolute coupling strengths. For signed, time-dependent controls, the study derives an exact attainable trace-distance frontier and its inverse error-time relation. Equal integrated coupling angles attain the noiseless frontier, so balanced simultaneous and sequential schedules are equivalent under the stated resource model. Central dephasing along the commuting axis preserves this equivalence and gives an exact optimal stopping time. The main additional result concerns three qubits with transverse central Pauli-jump noise. Among nonnegative deterministic controls that achieve perfect noiseless discrimination at the minimum possible decoding time, balanced simultaneous couplings are uniquely optimal at every finite positive noise rate. The proof establishes nonnegativity of the signed contrast, an exact performance-gap identity, and a lower bound in terms of accumulated coupling imbalance. Optimality is restricted to this control class and endpoint time; allowing a later measurement can improve the result. The supplementary materials contain supporting proofs, calibration bounds and classical scalar-output prediction results. The companion RM01 analysis compares finite-sample prediction and serialized storage against methods using the same measurement information. It explicitly identifies cases where a conventional polynomial representation uses fewer bytes, and does not claim a new general compression principle. The archive supplies editable manuscript sources, code, simulated data, recorded results, reproduction instructions and checksums. Archived validation includes 2,348 Q1 assertions and 530 transverse-noise schedule cases. A publication review dated 4 November 2026 adds separate numerical checks and a fresh reproduction of the RM01 analysis of 12,000 simulated measurement records. Its report distinguishes newly executed checks from archived results and documents execution limitations. All findings concern the specified mathematical and simulation models. No laboratory measurements or device-level advantage are reported. AI assistance is disclosed. Scientific priority and independent human peer review are not established.

•Nov 4, 2026•1 citation
A quantum phase reference must repay both its size and the precision that keeps it coherent. For complementary binomial signals with cyclic phase noise and an unknown common phase, we derive exact resource laws for binary discrimination. A contracting variational operator gives the ideal error exponent over every independent reference state and joint measurement. An entropy crossing identifies the sharp two-charge recovery threshold, p_G = 0.197884450826..., with a certified rational enclosure. Above this threshold, two charges attain the entire global ideal partial-recovery curve; at p = 0.3 and equal phase-use costs, the optimal charged exponent is 67.57% above counting. A finite polynomial comparison proves balanced-population exponent optimality for every bias and visibility. Under intermittent complete phase randomization, a tapered multi-charge profile attains a matching converse at a finite linear span and can outperform every two-charge design at the same noise rate and resource prices. Within the two-charge architecture, charging control precision yields an exact matching principle for monotone costs and three distinct regimes: bulk effort sublinear in log-precision preserves the ideal price law, linear effort renormalizes it, and superlinear effort makes counting optimal. Separately charged, diverging local precision costs also remove the advantage in an explicit independent-dephasing implementation. Finite converses, constructive receivers and reproducible certificates connect the attainable quantum gain to the resources required to realize it. This record archives the same scientific work as the manuscript titled Finite phase references: sharp resource and precision limits for quantum discrimination, under an alternative repository title. It is an author preprint; journal peer review has not been completed. The main manuscript, two proof supplements, LaTeX sources and computational materials are included. Version P19_9994. Access to all files is restricted, with no automatic release date. Bibliographic metadata are public.
A finite quantum phase reference can restore information lost by counting, but occupied support and phase noise impose different limits. For complementary binomial signals with sublinear cyclic order, we establish these limits and compare designs under a declared resource budget. At critical uniform-dephasing quality, bounded support attains the full coherent error exponent precisely above the bias threshold p* = (1 − 1/√2)/2. At and below it, every fixed support bound leaves a positive gap, while arbitrarily slow support growth suffices. Near the threshold from above, a geometric construction needs only logarithmically many charges in the inverse distance to the threshold. Four charges are necessary and sufficient for 3/10 ≤ p < 1/2. Gaussian recovery also depends on how rapidly the cyclic order grows. Widths decaying as a power faster than the inverse square root of signal size recover the ideal exponent at any fixed span ratio when cyclic order grows slower than the logarithm of that size. When cyclic order grows faster than this logarithm, every fixed polynomial precision loses its exponential advantage. The ideal optimized rate survives logarithmic precision costs and a declared polynomial charge for the largest protected subspace dimension in an occupied block. At a common budget, an explicit four-charge reference outperforms the fully optimized two-charge class. Explicit constructions and converses over all reference states distinguish occupied support, register span and noise as separate resources. Author preprint, version V2.7. The main manuscript, complete proofs, LaTeX sources, computational resource and alternative figure/table descriptions are included. The scientific content and author declarations are preserved; journal-specific packaging and the editorial cover letter are excluded. All files are embargoed until 15 February 2027, when they will automatically become publicly accessible. Bibliographic metadata are public.
We determine how errors in a coherent receiver's outputs change the cost of calibrating an exponentially rare quantum component. For a smooth moment-matched phase family, one receiver exposes informative events that counting misses. The optimal robust cost follows an explicit curve: an ideal-cost plateau ends at a tail-mass threshold, then an increasing branch approaches the feasibility boundary. One stopping rule attains this exponent at every unknown label, even when conditional errors depend on the observed history. Near the boundary, the remaining contamination margin δ and an explicit midpoint variance v* determine a finer law. As δ and the error target α vanish, the minimax cost is 2v* δ⁻² log(1/α), without a relative-rate restriction for a fixed receiver. This coefficient governs fixed sampling and every fixed positive-moment cost of arbitrary randomized stopping; a single clean source forces the lower bound. A uniform theorem carries the constant to changing finite receivers under explicit margin conditions and gives a computable critical strip for the physical family. These laws locate the loss of efficient calibration and quantify the cost of approaching the last feasible regime. This author preprint includes the main manuscript, complete proofs, LaTeX sources and computational materials. Journal peer review has not been completed. The scientific files are preserved unchanged; author identity is provided in the record metadata and the accompanying README. Version V1.7. All files are embargoed until 1 February 2027, when they will automatically become publicly accessible. Bibliographic metadata are public.
AbstractRetained measurement records constrain recoverability, but their formation also depends on the available physical controls. We give exact, constructively attained answers to both questions in two specified models. For a balanced nondemolition qubit process with actual binary observer memories unavailable to the decoder, we determine the maximum recovery compatible with average readout accuracy and pair agreement. The finite-record solution includes its feasible region and a common memory-writing and recovery process, without assuming exchangeability of observed records. Under a complete conditional-pairwise-independence promise at fixed informative accuracy, the optimal coherence has a sharp inverse-square-root asymptotic; fully conditionally independent records instead give exponential decay. Thus identical single-record and pair-record calibrations need not justify the product-law recovery bound. We then fix a logical code in four spin-3/2 systems and sequential diagonal contacts with exact controlled-swap endpoints. Hard budgets for net contact action and added spectral control charge yield an exact peak-excursion frontier within a declared quadratic-plus-cubic control class. A single positive-amplitude preparation jointly attains the record, recovery and occupation requirements, connecting the two results through an exact finite-dimensional optimization. A closed three-record example distinguishes fixed complete records from fixed averaged data. Separately calibrated imperfect contacts admit one-sided finite-error extensions. Together, the results characterize both informational compatibility and control-dependent formation through common attaining apparatuses.Preprint status and related materialsAuthor-submitted preprint; not peer reviewed or accepted for publication. This theoretical and computational work addresses the compatibility of retained binary quantum records with optimized accessible-system recovery, and the control-dependent resources required to form those records in a specified spin encoding. The article provides exact finite-record bounds, attainable recovery and resource frontiers, and calibrated finite-error qualifications. The manuscript has been submitted to Foundations of Physics for journal consideration; this Figshare record is not a journal publication. The technical supplement is included as a second PDF in this same record. Related software, verification code, exact certificates, and selected computational evidence are available separately at https://doi.org/10.6084/m9.figshare.34886079 under the MIT licence. When a journal version of record becomes available, a link to its DOI will be added here.AuthorKent Nimmo; Independent Researcher, Vancouver, British Columbia, Canada; ORCID 0009-0003-8503-8891.Reading and related workBrowse Quantum Foundations for related work on records, access and measurement, and Mathematics for exact bounds and certified constructions. The MIT software/certificate archive remains a distinct record from these manuscript PDFs.
A quantum record can have locally accessible populations while its distinguishing phase remains correlated with a distant source. We study this access boundary in a specified finite recording apparatus with a returning, vacuum/one-excitation source. Source-position weights give finite-time cutoff bounds without removing any physical hopping or return coupling. For an initially far-tagged record and its incoherent mixture, every reader in a declared position-preserving local-control class obeys a phase-visibility envelope and a necessary access-time inequality. A separate finite local probe shows why that state-discrimination limit is not an unrestricted limit on distinguishing two dynamical laws: fresh local coherence can reveal a stipulated added dephaser without recovering the old record phase. We construct a bounded, degree-three reader accessing only source positions 1–32. With the initial tag fixed at position 65, exact finite-source arrival certificates and an analytical tail comparison yield recovery uniformly over every finite total source length at least 65. Accessible control faults are charged against the arrived signed-phase norm, while source-moving drift is charged against the full norm. At the fixed deadline 25.02/J, the matched phase-dependent difference between coherent and archive-gated dynamics exceeds 0.005, including the stated simultaneous control faults and four additional absolute response allowances of 0.008 each. Complementary results cover a vacuum-ready source and a stronger endpoint-prepared finite example. The conclusions are conditional on the supplied model, preparations, common realized controls and calibration bounds. They are not a switchable-fundamental-law experiment, a nuisance-independent classifier, an optimal-speed theorem or an end-to-end formal verification. The supporting Lean companion contains 59 declarations in eight modules with accepted returned Mac compilation, type and axiom evidence; physical analytical interfaces remain explicit hypotheses or outside that subset. The deposit files include the main manuscript, technical supplement and full research/reproduction package.
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ρ)\mu=\mathrm{Tr}(a\rho)μ=Tr(aρ), ρc=D(−μ)ρD(μ)\rho_c=D(-\mu)\rho D(\mu)ρc​=D(−μ)ρD(μ), and Ec=Tr(Nρ)−∣μ∣2E_c=\mathrm{Tr}(N\rho)-|\mu|^2Ec​=Tr(Nρ)−∣μ∣2. The reference is the source's actual field mean. For the quantum-limited amplifier A2\mathcal A_2A2​ of gain two with a vacuum auxiliary mode, define Δ(ρ)=g−1(S(A2ρ))−1,T(ρ)=12∑k≥0∣⟨k∣A2(ρc)∣k⟩−2−k−1∣,\Delta(\rho)=g^{-1}(S(\mathcal A_2\rho))-1,\qquad T(\rho)=\tfrac12\sum_{k\ge0}\left|\langle k|\mathcal A_2(\rho_c)|k\rangle-2^{-k-1}\right|,Δ(ρ)=g−1(S(A2​ρ))−1,T(ρ)=21​∑k≥0​​⟨k∣A2​(ρc​)∣k⟩−2−k−1​, where SSS is von Neumann entropy in nats and 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. Thus Δ\DeltaΔ 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, Δ(ρ)≤δ}.F_E(\delta)=\sup\{T(\rho):E_c(\rho)\le E,\ \Delta(\rho)\le\delta\}.FE​(δ)=sup{T(ρ):Ec​(ρ)≤E, Δ(ρ)≤δ}. Three sharp endpoints. For every fixed finite E>0E>0E>0, FE(δ)=916δ+o(δ),δ↓0.F_E(\delta)=\frac9{16}\delta+o(\delta),\qquad\delta\downarrow0.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,2m=1,2m=1,2, put Λm=1−2−m\Lambda_m=1-2^{-m}Λm​=1−2−m and δmsat=g−1(S(A2(∣m⟩⟨m∣)))−1\delta_m^{\mathrm{sat}}=g^{-1}(S(\mathcal A_2(|m\rangle\langle m|)))-1δmsat​=g−1(S(A2​(∣m⟩⟨m∣)))−1. The exact saturated frontier is Fm(δ)=ΛmF_m(\delta)=\Lambda_mFm​(δ)=Λm​ for δ≥δmsat\delta\ge\delta_m^{\mathrm{sat}}δ≥δmsat​, and its approach from below obeys Fm(δ)=Λm−cm(δmsat−δ)+o(δmsat−δ),F_m(\delta)=\Lambda_m-c_m(\delta_m^{\mathrm{sat}}-\delta)+o(\delta_m^{\mathrm{sat}}-\delta),Fm​(δ)=Λm​−cm​(δmsat​−δ)+o(δmsat​−δ), with c1≃0.73151177c_1\simeq0.73151177c1​≃0.73151177, c2≃0.16207193c_2\simeq0.16207193c2​≃0.16207193, δ1sat≃0.92689630\delta_1^{\mathrm{sat}}\simeq0.92689630δ1sat​≃0.92689630, and δ2sat≃1.70174873\delta_2^{\mathrm{sat}}\simeq1.70174873δ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.
This theoretical and computational preprint studies how the direction of central-qubit noise affects optimal local readout of a multipartite GHZ phase. The task is equal-prior discrimination of GHZ+ and GHZ- by a final measurement of one central qubit, using commuting spin-star interactions with fixed axes and a bound on the instantaneous sum of absolute coupling strengths. For signed, time-dependent controls, the study derives an exact attainable trace-distance frontier and its inverse error-time relation. Equal integrated coupling angles attain the noiseless frontier, so balanced simultaneous and sequential schedules are equivalent under the stated resource model. Central dephasing along the commuting axis preserves this equivalence and gives an exact optimal stopping time. The main additional result concerns three qubits with transverse central Pauli-jump noise. Among nonnegative deterministic controls that achieve perfect noiseless discrimination at the minimum possible decoding time, balanced simultaneous couplings are uniquely optimal at every finite positive noise rate. The proof establishes nonnegativity of the signed contrast, an exact performance-gap identity, and a lower bound in terms of accumulated coupling imbalance. Optimality is restricted to this control class and endpoint time; allowing a later measurement can improve the result. The supplementary materials contain supporting proofs, calibration bounds and classical scalar-output prediction results. The companion RM01 analysis compares finite-sample prediction and serialized storage against methods using the same measurement information. It explicitly identifies cases where a conventional polynomial representation uses fewer bytes, and does not claim a new general compression principle. The archive supplies editable manuscript sources, code, simulated data, recorded results, reproduction instructions and checksums. Archived validation includes 2,348 Q1 assertions and 530 transverse-noise schedule cases. A publication review dated 4 November 2026 adds separate numerical checks and a fresh reproduction of the RM01 analysis of 12,000 simulated measurement records. Its report distinguishes newly executed checks from archived results and documents execution limitations. All findings concern the specified mathematical and simulation models. No laboratory measurements or device-level advantage are reported. AI assistance is disclosed. Scientific priority and independent human peer review are not established.