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.
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.
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.
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.
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.
This record contains the revision 9 preprint and its verification and figure-reproduction materials. We determine when correlated readout-label errors cancel in a fixed measurement-based quantum wire and how finite correlation and independent noise determine its optimal length. Quantum operations and X measurements are ideal. A stationary binary Markov component with marginal 0 < p < 1/2 and persistence 0 ≤ c ≤ 1, combined with independent flips of probability 0 ≤ r < 1/2, yields an exact output Pauli channel through two-dimensional transfer matrices. The channel acts on arbitrary inputs, including reference-entangled inputs, and its entanglement infidelity equals its half-diamond distance from the identity. Common-mode errors cancel at lengths divisible by four when c = 1 and r = 0. Every fixed c < 1 instead gives a completely depolarizing long-wire limit; two residue-class crossover functions resolve the singular limit. Fidelity decreases within each even residue class, so its maximum over all positive even lengths is attained at two or four steps. Exact boundaries select the maximizer, and an effective depolarizing penalty quantifies the overhead tolerance of the four-step advantage. Contents. The ZIP includes the latest 19-page manuscript PDF, its authoritative LaTeX source, the three manuscript figures, the unchanged ESM_1.zip containing Python verification and figure-generation code, numerical data, saved execution records and provenance, plus licensing information, a BibTeX citation, and SHA-256 checksums. Scientific files are unchanged from the supplied revision 9 materials. The packaging did not rerun calculations or recompile the manuscript. The earlier reference-only PDF and submission-preparation working records are excluded. Licenses. MIT applies to Python source code, including code inside ESM_1.zip. CC BY 4.0 applies to the manuscript, LaTeX source, figures, numerical data, documentation, and other non-code research materials. These licenses apply to the respective material categories; see the README and license files for scope. Funding. No funding or grants were received for this study. Competing interests. The author has no relevant financial or non-financial interests to disclose. AI-assisted preparation. ChatGPT (OpenAI) was used to assist with mathematical analysis, code development, figure preparation, English-language editing, LaTeX submission preparation, and organization of supplementary files. The author carefully reviewed the mathematical reasoning, code, figures, and manuscript text, and takes full responsibility for the scientific content and the final manuscript.