The arithmetic of sampling static quantum disorder: exact aliases, finite witnesses, and clock robustness

Strengths

• Clean, complete arithmetic trichotomy showing that generic rationally independent finite menus admit exact finite-support static aliases (Theorem 3.3), coarse infinite uniform grids admit explicit bounded-energy static aliases (Theorem 4.1), and finite odd-harmonic menus completely separate all rate matrices outside the cut cone (Theorem 5.3).
• Elegant use of disjoint Fourier supports of pairwise Poisson kernels on the torus to prescribe all integer moments of all pair differences simultaneously in Theorem 4.1.
• Ingenious circular cut representation (Lemma 5.1) combined with an explicit O(1/K) Fourier-tail bound to yield solver-free, finite-shot statistical witnesses against arbitrary non-population-preserving static Hermitian ensembles.
• Sharp analysis of clock calibration fragility (Corollary 7.1, Corollary 7.4) paired with two constructive remedies: a Lipschitz budget under a spectral-width prior (Theorem 7.2) and a fresh uniform time-dither protocol using total-variation smoothing that requires no energy bound (Theorem 7.3).
• Exemplary scientific hygiene, including exact rational arithmetic certification of the 40,500-shot and 53,000-shot qutrit designs and forthright attribution of prior convex-analytic and operator-algebraic literature.

Weaknesses

• Theorem 3.3 is non-constructive regarding the energy scale of the finite-support alias; while Corollary 7.4 provides a 1/eta lower bound near a separating menu, no upper bound via quantitative Diophantine approximation is derived (acknowledged as an open question in Section 8).
• The sufficient coarse-grid spacing bound in Theorem 4.1 scales as log(d(d-1)-1)/gamma_min, which is conservative for large dimension d.
• The finite-shot guarantees (Propositions 6.1, Corollaries 6.2 and Theorem 7.3) use importance sampling and Hoeffding's inequality; variance-aware concentration (e.g., Empirical Bernstein) or deterministic shot allocation across harmonics could substantially reduce the shot budget.

Potential errors

• In Section 7.1 (p. 9), the brief remark that a verified total-variation bound on each implemented time law can replace the additive-error assumption in Theorem 7.3 leaves implicit two details: (i) the time-law perturbation must remain conditionally independent of the hidden Hamiltonian H and preparation/readout phase (or the TV bound must hold conditionally), and (ii) under the reference semigroup, replacing the bounded additive shift |E|<=eta by a pure TV bound replaces the Lipschitz shift AG*eta with an L_infinity/TV shift 2*sum |a_{ijn}|*tau_{ijn}.
• In Corollary 7.4 (p. 9), the lower bound B >= g/(A*eta) - G invokes Theorem 7.2 and therefore implicitly requires that the perturbed menu times remain nonnegative (e.g., eta <= min_l t_l, oreta <= Delta for the odd-harmonic menu).

Strong novelty candidates

• Theorem 3.3 and Corollary 7.1: Exact finite-support static diagonal aliasing of any strictly positive real dephasing semigroup on arbitrary rationally independent finite time menus, and the resulting breakdown of uniform testability under unrestricted independent clock jitter.
• Theorem 4.1: Explicit simultaneous torus density construction using sums of pairwise Poisson kernels to alias dephasing semigroups on coarse infinite uniform grids with bounded spectral width.
• Theorem 5.3 and Theorem 7.3: Complete finite odd-harmonic cut-cone separation certificates for arbitrary static Hermitian ensembles and their spectral-prior-free stabilization against additive clock error via fresh uniform base-time dithering.

Unresolved material objections

None reported.

Strengths

• Theorem 3.3 correctly distinguishes dense approximation from exact realization. Lemma 3.2 places positive-rate semigroup data inside the full phase-correlation body even without strict conditional negative definiteness; convex interior containment then permits actual finite energy atoms. The real dimension kd(d−1) gives the stated support bound.
• Theorem 4.1 constructs one positive joint phase law, not separate incompatible pair marginals. Its additive Poisson kernels have disjoint Fourier supports, giving every integer moment of every pair difference simultaneously. The positivity criterion and spectral-width bound 2π/Δ follow directly.
• Lemma 2.1 legitimately extends the witnesses to arbitrary Hermitian ensembles: conditional spectral sampling reproduces all off-diagonal transfer entries with one joint energy law. Neither population preservation nor finite energy moments is silently required.
• The circular cut representation, small-spacing asymptotic and uniform Fourier tail establish the completeness claim in Theorem 5.3. Choosing Δ first and then K avoids an unjustified interchange of limits. The converse is supported by an explicit Cauchy construction, so the private predecessor is not an unproved dependency.
• The four-phase measurement cancels unwanted transfer terms even for population-mixing channels. The coefficient sampling and Hoeffding normalization give exp[−Ng²/(8A²)]. The supplied rational verifier uses valid Machin and Taylor/geometric-tail bounds for both numerical designs; numerical LP interpolation is not presented as an exact certificate.
• The clock results are mutually consistent. Corollary 7.1 concerns fixed uncertain menu entries; Theorem 7.3 changes the resource to fresh continuous time sampling. Its translation-TV estimate is frequency-independent, and Corollary 7.4 correctly derives the inverse-timing-error lower bound on alias spectral width.

Weaknesses

• The finite-menu theorem is an existence result rather than an efficient synthesis method. Its support bound provides no energy upper bound or conditioning guarantee. The inverse-error lower bound is useful but does not determine optimal bandwidth or construction complexity.
• The energy-prior-free repair requires a genuinely continuous, calibrated time law independent of the hidden Hamiltonian and measurement phases. A finitely supported clock distribution has TV distance one from the ideal uniform law; bounded rounding error alone therefore cannot justify the repair. The manuscript acknowledges this substantial implementation limitation.
• The coarse-grid positivity condition, harmonic design and shot counts are sufficient rather than optimal. General dimension-dependent experimental costs and comparisons with sharper estimators are not developed.
• The experimental guarantees assume ideal preparations, readout observables and setting probabilities, with a specified reference rate matrix. State-preparation/readout errors and uncertainty in the rates receive no quantitative budget. Together with the fresh single-use restriction, this limits immediate laboratory applicability without invalidating the stated model.

Potential errors

• Section 7.1's final total-variation generalization is underspecified if read as requiring only marginal time-law calibration. Independence from the hidden Hamiltonian and preparation/readout settings must remain, or an appropriate conditional/joint-law TV bound is needed. The supplied clarification states this, but the canonical PDF should contain it. The formal Theorem 7.3 already has sufficient assumptions.
• The abstract says the randomized qutrit design 'needs 53,000 shots,' whereas the proof establishes sufficiency, not necessity. Replace this with '53,000 shots suffice.' The body explicitly disclaims optimality, so this is a wording correction rather than a failure of the statistical result.

Strong novelty candidates

• Exact finite-support static aliases for all interior phase-correlation tuples at rationally independent times, with the positive-rate real semigroup application and consequent indistinguishability under adaptive channel queries.
• An explicit bounded-energy joint ensemble matching all pair coherences on an entire sufficiently coarse uniform grid, through the additive Poisson-kernel construction.
• Complete finite odd-harmonic certificates for every physical real rate matrix outside the cut cone, valid against arbitrary static Hermitian ensembles and implementable with bounded single-shot observations.
• The combined clock-resource picture: dense exact-alias fragility, spectral-width timing budgets, a bounded-time randomized repair without an energy prior, and a quantitative inverse-error energy cost for nearby aliases.

Unresolved material objections

None reported.

Strengths

• La interioridad gaussiana, incluso sin independencia afín de los vectores euclídeos, convierte la densidad de Kronecker en alias exactos de soporte finito; el teorema distingue correctamente frontera e interior.
• La densidad de núcleos de Poisson prescribe simultáneamente todos los momentos de parejas en una rejilla suficientemente gruesa; los testigos de armónicos impares separan cualquier tasa fuera del cono de cortes.
• El sustituto espectral y el estimador físico de cuatro fases extienden la garantía nula a Hamiltonianos hermitianos arbitrarios en experimentos de un uso.
• El teorema 7.3 evita una cota espectral mediante control de la ley temporal en TV y presenta hipótesis y exclusiones explícitas. El corolario 7.4 cuantifica el coste de energía de alias cercanos.
• La omisión de Dykema–Juschenko y Kribs et al. está resuelta y los cálculos exactos acompañan las dos garantías de tamaño muestral.

Weaknesses

• La reparación sin cota energética exige una distribución continua conocida y condiciones de independencia. No cubre el redondeo a una malla finita: puede haber sesgo de orden uno con desplazamientos temporales arbitrariamente pequeños.
• La cota de 53.000 disparos y la condición de positividad de la rejilla son suficientes y conservadoras; no se determina el coste mínimo de energía, una cota superior ni la optimalidad de 1/eta.
• Conviene añadir contexto de muestreo aleatorio clásico. Shapiro–Silverman y Beutler sólo pudieron comprobarse mediante registros primarios y resúmenes, sin auditoría de sus textos completos; ello no demuestra duplicación ni prioridad del teorema concreto.
• La frase generalizadora sobre TV debería reiterar independencia frente a H y fases, o controlar leyes condicionales/conjuntas; una marginal temporal por sí sola no justifica retirar esas hipótesis.
• Alcance limitado a canales de un uso: excluir desorden estático no certifica un entorno cuántico. La revisión es de modelo, con participación previa declarada y contexto compartido.

Potential errors

None reported.

Strong novelty candidates

• Teorema 3.3: alias exacto común de soporte <=1+kd(d-1) para datos interiores en todo menú positivo racionalmente independiente, con el lema gaussiano 3.2.
• Teorema 4.1: construcción aditiva explícita y simultánea de un alias de energía acotada para toda una rejilla gruesa.
• Teorema 5.3: completitud de certificados finitos de armónicos impares para tasas fuera del cono de cortes, junto con la discontinuidad de detectabilidad ante perturbaciones independientes de menús.
• Teorema 7.3: combinación de esos certificados con tiempo base uniforme fresco y error aditivo independiente, con garantía estadística finita sin cota espectral. La novedad candidata es esta combinación, no TV ni la idea general de muestreo aleatorio.

Unresolved material objections

None reported.