Unrefereed research candidate. A quantum system evolves under a fixed gate, step by step, and is occasionally reset; the waiting times between resets are independent and may have an infinite mean. Wald, Yao, Platini, Hooley and Carollo (Quantum 9, 1742, 2025, doi:10.22331/q-2025-05-13-1742) inferred from estimates and numerics how the averaged state behaves for the hazard r_n = gamma/(n+1)^alpha. This paper proves it: for alpha < 1 the state converges to a survival-weighted mixture, for alpha = 1 to the dephased state, and for alpha > 1 it approaches a rotating orbit and converges iff the reset state commutes with the gate. For complete resets the behaviour is classified for every renewal clock (finite mean, infinite mean, periodic, defective); a clock makes every finite-dimensional unitary reset system converge iff it is proper and aperiodic. This part is a short consequence of classical renewal theory. The claimed contributions are: the exact infinite-dimensional trace-norm defect 1 - m_pp (continuous spectral mass) for proper infinite-mean clocks, with no trace-norm convergent subsequence unless m_pp = 1; a laboratory-time reduction of imperfect resets (general jump channels, possibly noncommuting) to complete resetting at an effective state under a nonresonance condition (W), which is characterised, decidable for finitely supported clocks and open and dense, but is sufficient, not necessary, and not a classification; and uniform two-term asymptotics, endpoint and near-resonance crossovers for the critical clock gamma/(n+1), with practical time scales (dephasing can need more than 10^9 steps; numerical estimates). The archive contains the manuscript (PDF and LaTeX), a single deterministic verifier with its JSON report, semantic negative controls and SHA-256 sums. Assurance: written proofs; exact finite checks and labelled numerical checks; producer-side clean replay; internal AI-assisted review, AI-assisted adversarial audits before and after revision (OpenAI gpt-6-astra via Codex) and an AI-assisted verification re-review. This is not peer review, independent reproduction or formal verification. Creator: Anonymous. Prose, manuscript and data CC0-1.0; code MIT.
Unrefereed research candidate. A quantum system evolves under a fixed gate, step by step, and is occasionally reset; the waiting times between resets are independent and may have an infinite mean. Wald, Yao, Platini, Hooley and Carollo (Quantum 9, 1742, 2025, doi:10.22331/q-2025-05-13-1742) inferred from estimates and numerics how the averaged state behaves for the hazard r_n = gamma/(n+1)^alpha. This paper proves it: for alpha < 1 the state converges to a survival-weighted mixture, for alpha = 1 to the dephased state, and for alpha > 1 it approaches a rotating orbit and converges iff the reset state commutes with the gate. For complete resets the behaviour is classified for every renewal clock (finite mean, infinite mean, periodic, defective); a clock makes every finite-dimensional unitary reset system converge iff it is proper and aperiodic. This part is a short consequence of classical renewal theory. The claimed contributions are: the exact infinite-dimensional trace-norm defect 1 - m_pp (continuous spectral mass) for proper infinite-mean clocks, with no trace-norm convergent subsequence unless m_pp = 1; a laboratory-time reduction of imperfect resets (general jump channels, possibly noncommuting) to complete resetting at an effective state under a nonresonance condition (W), which is characterised, decidable for finitely supported clocks and open and dense, but is sufficient, not necessary, and not a classification; and uniform two-term asymptotics, endpoint and near-resonance crossovers for the critical clock gamma/(n+1), with practical time scales (dephasing can need more than 10^9 steps; numerical estimates). The archive contains the manuscript (PDF and LaTeX), a single deterministic verifier with its JSON report, semantic negative controls and SHA-256 sums. Assurance: written proofs; exact finite checks and labelled numerical checks; producer-side clean replay; internal AI-assisted review, AI-assisted adversarial audits before and after revision (OpenAI gpt-6-astra via Codex) and an AI-assisted verification re-review. This is not peer review, independent reproduction or formal verification. Creator: Anonymous. Prose, manuscript and data CC0-1.0; code MIT.
A quantum processor is controlled through a sequence of operations distributed across time. Its reliability therefore depends on more than the decay observed when the device is left undisturbed. Environmental correlations, stochastic timing, intervention history, acceptance rules, and the observable being computed can all change which errors matter and which protection strategy is justified. The Subordinator Renormalization Problem examines this dependence through an integrated treatment of stochastic clocks, fractional dynamics, multi-time quantum processes, task-specific protection, and finite-sample certification. Its central question is precise: how can temporal resolution be changed and environmental memory compressed while preserving the predictions required by a specified quantum task, including the effects of permitted interventions and their full physical cost? Scientific motivation Coherence time, average gate fidelity, qubit count, and scalar measures of non-Markovianity characterize different aspects of a quantum device. They do not individually determine whether a particular computation can deliver a reliable answer within a given resource budget. A reduced model may reproduce uncontrolled relaxation while omitting correlations that become consequential under pulses, measurements, resets, or subsequent gates. This manuscript investigates the information that must survive a reduction of the noise description. It develops task-sufficient memory as an operational requirement: two process descriptions may be treated as equivalent only when they preserve the declared output expectations, acceptance probabilities, and costs for every allowed future continuation. Stochastic clocks and fractional quantum dynamics The mathematical framework connects Lévy subordinators, Bernstein functions, inverse stable clocks, renewal processes, Caputo fractional derivatives, and Mittag–Leffler relaxation with completely positive quantum dynamics. A central distinction concerns direct and inverse time changes. Direct Bochner subordination of a quantum dynamical semigroup can preserve the semigroup composition law while modifying its generator. An inverse stable clock generally produces a fractional evolution family without that composition law. Fractional powers of generators and fractional derivatives in physical time consequently represent different constructions and cannot be interpreted interchangeably. The manuscript also separates a change of time units from a physical change of the clock law. It derives an exact scaling identity within a fixed stable family and specifies the dimensions of the corresponding relaxation parameter. This identifies what scale covariance establishes and what would require additional evidence of physical control over the environment. The clock-reset problem For inverse stable relaxation, uninterrupted evolution and evolution with an independently renewed hidden clock generally yield different predictions. The paper derives a short-time expansion quantifying the difference between the coherence multiplier after uninterrupted evolution for twice a given duration and the product obtained from two independently renewed intervals. This result makes an otherwise hidden modeling assumption experimentally meaningful. A reset assumption changes the predicted observable response. Whether a real operation renews the relevant environmental variables must therefore be part of the physical model. The analysis includes closed-form calculations for the half-order Mittag–Leffler relaxation, checks of scale covariance, and verification of the deterministic-clock limit. Identical decoherence curves and different control responses An explicit Gaussian dephasing construction provides a separate identification counterexample. A continuum of noise processes produces exactly the same uncontrolled quantum channel at every time, while displaying different responses to spin echo. The entire family has zero Breuer–Laine–Piilo backflow in its uncontrolled reduced dynamics. Nevertheless, its temporal correlations determine whether an echo helps or harms once pulse imperfections are included. The construction shows why uncontrolled channel information alone can be insufficient for an intervention-dependent decision. The relevant distinction is operational: noise processes that look identical during idle evolution can require different control choices. The Gaussian construction and the inverse stable clock analysis are distinct models. Together, they expose complementary requirements on a predictive description, without identifying either construction as a universal microscopic model of a quantum device. Task-sufficient representations and mathematical guarantees The paper formulates exact equivalence of multi-time processes relative to a specified family of interventions, terminal observables, acceptance rules, and resource costs. For a finite linear family, it characterizes the corresponding task quotient and establishes its minimal dimension within linear encoders admitting exact recovery of the contract predictions. Approximate reductions are treated through explicit stability bounds. These bounds show how errors in unnormalized output moments, acceptance probabilities, and attempt costs propagate into conditional expectations and cost per accepted outcome. Low acceptance can amplify a small modeling error and erase an apparent resource advantage. A robust-selection result identifies the feasibility margins required when choosing a policy from approximate predictions. The framework thereby connects process reduction to a concrete accuracy requirement. Finite-sample certification and resource accounting The manuscript derives simultaneous finite-sample certificates for conditional task bias and expected cost per accepted outcome. The guarantees remain valid after data-dependent selection within a fixed finite candidate family, under the stated assumptions of independent reset attempts, bounded observations and costs, and an independently trusted ideal reference. The accounting includes rejected attempts and distinguishes systematic task bias from statistical sampling uncertainty. It also charges characterization, compilation, classical computation, and revalidation to the total resource objective. This distinction matters because a nominal reduction in the cost of one execution can require an unaffordable calibration campaign. A useful controller must improve the complete calculation at matched task accuracy and confidence. Reproducible numerical investigation A classical numerical study evaluates ten pulse policies across three correlation regimes and two contracted observables. The calculations include analytic population predictions, Gaussian trajectory sampling, density-matrix consistency checks, and repeated finite-shot calibration experiments. The results exhibit task-dependent protection choices: a sequence beneficial for one observable can introduce unnecessary error for another. They also distinguish the absence of a certified policy from a general claim that no feasible control exists. Conventional calibrated Hahn echo and the corresponding two-pulse sequence match the best control performance in this benchmark. The study establishes identification and certification results within its declared models; scalable compression, hardware advantage, and reductions in fault-tolerance overhead remain open research objectives. Meaning of the subordinator renormalization problem The title names an operational research problem: construct a change of temporal resolution together with a compressed memory representation and a consistent update rule that preserve all contracted predictions under the permitted controls. The challenge includes causality, complete positivity where applicable, normalization, conditional updates, approximation error, and total resource cost. A small collection of fitted moments is insufficient unless these properties can be maintained through subsequent interventions. The manuscript uses renormalization in the sense of scale change and retention of operationally relevant information. It formulates the conditions a useful reduction must satisfy rather than claiming a completed Wilsonian flow or a new universality class. Relevance and readership The work is intended for researchers in quantum computing, open quantum systems, quantum control, noise characterization, quantum error correction, stochastic processes, fractional calculus, and mathematical model reduction. Its broader engineering relevance is the connection between a model’s predictive sufficiency and the reliable computational output obtained for the resources consumed. The proposed research direction is to identify physical families in which the memory relevant to a useful task can be represented, learned, and updated more efficiently than a full process description. Manuscript contents Version 2.0 comprises 23 pages, four figures, four propositions, one corollary, a finite-sample certification theorem, mathematical appendices, a glossary of 47 terms, and 49 bibliographic references. The bibliography covers stochastic clocks and fractional analysis, quantum dynamical semigroups, environmental memory, process tensors, noise spectroscopy, control, fault tolerance, and statistical certification. About the author Dr. Marcos Eduardo Elias is a Brazilian engineer, mathematician, computer scientist, and entrepreneur based in São Paulo. He is Chairman of Instituto Ramanujan and works with Holosystems on quantum algorithms, stochastic modeling, and the connection between mathematical research and physical computation. His interests include open quantum systems, adaptive quantum–classical optimization, cryptography, and decision-making under uncertainty. Acknowledgments The author gratefully acknowledges Holosystems Quantum Computing Systems for the institutional and intellectual setting in which the
Unrefereed research candidate. When two copies of a system, one hotter and one cooler, relax in the same bath, the Markovian Mpemba effect is a crossing of their distances from equilibrium. This package gives a sufficient test that rules out such crossings at every time: if the dynamics and its time reverse preserve the cone of observables with nondecreasing arithmetic prefix means, cooling Gibbs preparations stay ordered for relative entropy (both orientations), squared Hellinger and Rényi divergences of order 0<α≤2, including for common schedules of noncommuting stages. For complete-graph bosonic population rates with common coupling, the test holds for every spectrum and bath temperature exactly when the spontaneous jump weight is concave; Ohmic baths with large enough cutoff, Drude–Lorentz and sub-Ohmic weights qualify on explicit ranges, super-Ohmic weights do not. A certified super-Ohmic example (J=d3) shows an actual relative-entropy crossing. Limits: an exact five-state cone-preserving example has a brief total-variation reversal, and for every N≥4 there are N-level systems with a slow-mode inversion although no proper induced subsystem shows one. The archive contains the 27-page manuscript (PDF and LaTeX), exact rational and interval certificates, a reproduction runner, semantic negative controls, CI and SHA-256 sums. Assurance: written proofs, exact certificates, internal AI-assisted review only (not peer review, independent reproduction or formal verification); the closest antecedent (Avitan et al. 2026) already excludes the slow-mode effect for Ohmic and sub-Ohmic spectra. Creator: Anonymous. Text and data CC0-1.0; code MIT.
Version 3 (2026-08). One correction, chair-directed after an independent text-only rebuild: the setting's conventions dictionary is regenerated from the code of record. The pointer packet is an ENERGY-basis Gaussian launched at tick zero (v1/v2 described it as a tick-space packet of tick-width sigma_n; the temporal width is in fact the inverse, NC/(4 pi sigma_n) ticks); the tick-state sign convention, the second geometry's sigma_n = 3, the twin/control definitions, and the post-selection probabilities are now printed; a standing text-only rebuild gate (fresh implementation from the setting paragraph alone, matching the exact conditioned state at 3.5e-14) guards the dictionary. Every published number stands (the independent rebuild reproduced the NC = 24 physics cold, the lane's first exterior verification, recorded in the data-and-code paragraph); the dictionary was broken. The methods law is minted program-wide: a geometry prints its dictionary, generated from the code, never transcribed. Version 2 (2026-08). Changes from v1: the clock-width profile is completed end to end: v1's spike-plus-plateau is the interior of a measured disturbance VALLEY with an optimal clock width (minimum at sigma_n* = 2.5; the broad side rises 93x by sigma_n = 24, tracked by the value law against exact evolution at ratios 0.985 and 0.995), so the least-disturbing clock is neither time-sharp nor energy-sharp; a pre-registered identification of the plateau with the sharp-clock limit was killed by a factor of 160 and is ledgered; the open problems are re-posed at the valley's optimum. When a finite quantum clock gates a register's interactions and the run is conditioned on the clock's final reading, the register's conditioned dynamics is derived at two orders and machine-verified against exact evolution. First order: the drive is the complex Aharonov-Albert-Vaidman weak value of the gating window projector (real part = Hermitian envelope, imaginary part = post-selection reweighting); a twin evolved under this envelope removes the entire first-order mismatch a mean-envelope control retains (state-metric deficits g^1.1 vs g^2.1, factor 56 at g = 0.1). Second order: the deficit is governed by the connected two-time window correlator under post-selection, resolved along the interaction picture; the resulting parameter-free value law matches measured deficits at ratios 0.92-1.05 across the clock-width grid and at a second geometry (1.03-1.07). The when/what trade-off of a participating clock is promoted from confounded excess to derived law: the disturbance is the connected fluctuation of the clock's timing answer, its clock-width profile is a predicted spike-plus-plateau (not a power law), and two earlier exponent claims are superseded with the reconciliation recorded. Two honest derivation failures (equal-time invisibility resurrected by the interaction picture; the kernel belonging inside the integral) are ledgered as the steps that located the law.
Unrefereed research candidate. When m identical copies of a quantum state of light are measured with Gaussian measurements (linear optics, Gaussian auxiliary modes, homodyne detection), measuring the copies jointly can give more Fisher information than measuring them one by one (Navarro, Morelli, Sanz and Mehboudi, arXiv:2512.20534), who left finite-copy optimality open. For every smooth family of pure single-mode Gaussian states and every m, this package proves the exact maximum of the Fisher information over all fixed (non-adaptive) Gaussian measurements, including ancilla-assisted schemes: a one-angle formula attained by concentrating the mean into one bright output and homodyne detection of every output. It also gives the exact optimum when measurement-seed squeezing is capped (in normalised coordinates), the exact shortfall from the quantum Fisher information (nondecreasing in m, at most one copy's variance information λ2/2, with an explicit limit), and a necessary and sufficient condition for strict collective advantage. The archive contains the 9-page manuscript (PDF and LaTeX), numerical checks with semantic negative controls, CI and SHA-256 sums. Assurance: written proofs; internal AI-assisted review only (not peer review, independent reproduction or formal verification); bounded prior-art search. Mixed states, multimode tangents and adaptive strategies are not covered. Creator: Anonymous. Text CC0-1.0; code MIT.
Unrefereed research candidate. Two results on complementary (mutually unbiased) measurements and the complementary quantum correlation (CQC) inequality of Schneeloch, Broadbent and Howell (2014), which proposed that the classical correlations in two complementary measurement tables never exceed the quantum mutual information. 1. Sharp qutrit discrimination. For every pair of complementary bases of a qutrit and every two orthogonal states, the triangular discrimination summed over the two bases is at most 8/3 (the trivial ceiling is 4), answering Qian, arXiv:2608.14806v2, Section 11(4). Every equality case is classified; for the computational and Fourier bases they are tied to the nine Hesse SIC rays. Consequences: choosing one of the two measurements at random recovers at most two thirds of the quantum Fisher information in a two-state estimation task, and Qian's two-ray qubit-qutrit family obeys CQC with margin at least 0.1005 nats. The proof is computer-assisted: an exact rational sum-of-squares certificate (scout_qutrit/exact_sos_certificate.json, 660,609 bytes, SHA-256 825bb8108096d38a44f63f1bc91964405d189ad57b5f568530b5d8e27d598c2f) checked by a standalone exact verifier; this deposit is the certificate's citable locator. 2. Every prescribed pair fails for a qubit and a qudit of dimension n ≥ 4. For every prescribed pair of complementary measurements on each side there is a separable state violating CQC, with a uniform certified margin below −9/20,000,000 nats (previously the every-pair statement was known only for n ≥ 164). A phase-averaging extension of the known shared-label mechanism covers every prescribed pair when both dimensions are at least three; an earlier, unchecked every-pair statement for equal dimensions by E. O'Connor is credited. Open: the full qubit-qutrit CQC question and the sharp constant in dimension 5 (numerics only). The margins are tiny and structural, not experimental. The archive contains the manuscript (PDF and LaTeX), the exact certificate and verifier, negative controls, an exact rational margin checker, numerical cross-checks, working proof notes, novelty audits, the bibliography with registry records, CI and SHA-256 sums. Assurance: computer-assisted exact rational arithmetic, not a formal proof; internal AI-assisted review only (not human peer review or independent reproduction). Creator: Anonymous. Text CC0-1.0; code MIT.