Luminary Research Archive
Luminary Research ArchiveIndependent scholarship
Luminary Portal

All Research

Research

154 papers
Browse papers
  1. Locating Quintic Obstructions in the Riemann Theta Product: A certified transition and minimum-degree theoremScott SchubrEdition 3 · 2026-10-27 Public
  2. Finite positivity and correction inertia for the Riemann theta formScott SchubrEdition 2 · 2026-10-27 Public
  3. Minimum-Degree Obstructions in the Riemann Theta Product: Classification, transition bounds and robust Gram certificatesScott SchubrEdition 3 · 2026-10-27 Public
  4. Collision and cancellation spectra for concentrated energy formsScott SchubrEdition 2 · 2026-10-27 Public
  5. Fekete convergence from balanced integer predecessors in shrinking corridorsScott SchubrEdition 2 · 2026-10-27 Public
  6. Sharp trace-degree certificates for rank-two permanent-derivative compensationScott SchubrEdition 2 · 2026-10-27 Public
  7. Residual Certificates and Empirical Sharpness for Entropic Self-Transport ScoresScott SchubrEdition 2 · 2026-10-27 Public
  8. Observation norms under double-exponential confinementScott SchubrEdition 2 · 2026-10-27 Public
  9. Residual Stopping and Pointwise Inference for Nonuniform Entropic Self-TransportScott SchubrEdition 2 · 2026-10-27 Public
  10. Finite-spectral recovery of Weyl-blind twisting modesScott SchubrEdition 2 · 2026-10-27 Public
  11. Local comparison counting for linear extensions and a bounded-range balance refinementScott SchubrEdition 2 · 2026-10-27 Public
  12. An explicit hyperbolicity threshold for xi Jensen polynomialsScott SchubrEdition 2 · 2026-10-27 Public
  13. A quantitative Chollet inequality for rank-four matrices of order sevenScott SchubrEdition 2 · 2026-10-27 Public
  14. Single-copy learning of stabilizers with correlated diagonal noiseScott SchubrEdition 2 · 2026-10-27 Public
  15. Relative finite optimization of arithmetic approximation distancesScott SchubrEdition 2 · 2026-10-27 Public
  16. Growing null subtraction and weighted Weil zero detectionScott SchubrEdition 2 · 2026-10-27 Public
  17. Frequency Localization for Weil Operator CertificatesScott SchubrEdition 3 · 2026-10-27 Public
  18. Sharp logarithmic sampling thresholds and lacunary interpolation in the Báez–Duarte step spaceScott SchubrEdition 2 · 2026-10-27 Public
  19. Joint Cutoffs and Negative-Spectrum Decay for Weighted Weil OperatorsScott SchubrEdition 3 · 2026-10-27 Public
  20. Sharp convergence of heat-kernel Sinkhorn metricsScott SchubrEdition 2 · 2026-10-27 Public
  21. Positive heat-flow observations on spherical shells: cutoffs, optimal preparation and concentrationScott SchubrEdition 2 · 2026-10-27 Public
  22. Curvature classification and certified Sinkhorn metrics for Fourier density modelsScott SchubrEdition 2 · 2026-10-27 Public
  23. Mean ergodic convergence from near-diagonal subadditivityScott SchubrEdition 2 · 2026-10-27 Public
  24. Quantitative Null-Space Compression for a Weighted Weil OperatorScott SchubrEdition 2 · 2026-10-27 Public
PublicEdition 3

Sharp noise transitions for an adaptive single-copy stabilizer-learning process

Scott Schubr ORCID

Original PDF · First-page preview

Loading original first page…

Abstract

We determine the noise-dependent behavior of the adaptive single-copy stabilizer-learning update of Bittel, Eisert, Gong, Mele and Schatzki on globally depolarized stabilizer states. For every fixed prime local dimension p, the number of diagonal stabilizers still missing follows an exact birth–death chain. Writing c for the retained pure-state weight, starting with all n diagonal stabilizers missing, the expected time to record the optimizing stabilizer is linear in n when c²>p/(p+1), quadratic at equality, and exponential when c²<p/(p+1). We obtain the exact supercritical speed, subcritical exponential prefactors, and a critical-window mean profile uniform over all initial missing ranks, with an O(n) remainder and the exact leading recording penalty. An exact regeneration identity distinguishes first exposure of the computational-basis target from its actual recording. A finite-time bound shows that below threshold the unchanged algorithm has exponentially small success probability in any polynomial round budget, even on this simple noise family. The obstruction concerns this update and candidate generation rule.

Read the full paper in the original PDF.