Luminary Research Archive
Luminary Research ArchiveIndependent scholarship
Luminary Portal

All Research

Research

154 papers
Browse papers
  1. Critical-tail localization and growing theta correction inertiaScott SchubrEdition 2 · 2026-10-27 Public
  2. Pure-Point Dirichlet Spectrum in an Enlarging Cube TowerScott SchubrEdition 2 · 2026-10-27 Public
  3. Sharp permanent-derivative compensation on the flat equal-spectrum conjugate-disjoint Gram stratumScott SchubrEdition 2 · 2026-10-27 Public
  4. Geometric Blind Modes in the Weyl Asymptotics of Twisted TubesScott SchubrEdition 2 · 2026-10-27 Public
  5. Variance cancellation and two-direction bounds for six-row permanent derivativesScott SchubrEdition 2 · 2026-10-27 Public
  6. Heat-Trace Recovery of a Weyl-Blind Twisting ModeScott SchubrEdition 2 · 2026-10-27 Public
  7. Real-section permanent-derivative compensation and quadratic phase controlScott SchubrEdition 2 · 2026-10-27 Public
  8. Full-phase permanent-derivative compensation under real-part spectral pinchingScott SchubrEdition 2 · 2026-10-27 Public
  9. Phase-boundary reduction and low-rank compensation for permanent derivativesScott SchubrEdition 2 · 2026-10-27 Public
  10. Typical-value anchors for polynomial approximation and theta correction inertiaScott SchubrEdition 2 · 2026-10-27 Public
  11. All-depth root-Laguerre positivity with nonreal Fourier zerosScott SchubrEdition 3 · 2026-10-27 Public
  12. Polynomial synthesis and zero ideals for the Riemann xi-functionScott SchubrEdition 2 · 2026-10-27 Public
  13. Sharp degree exponents for polynomial detection of isolated negative atomsScott SchubrEdition 2 · 2026-10-27 Public
  14. A sixth-order obstruction to total positivity of an arithmetic theta trace kernelScott SchubrEdition 2 · 2026-10-27 Public
  15. Sharp collision laws and subexponential masking for polynomial certificatesScott SchubrEdition 2 · 2026-10-27 Public
  16. Collision geometry and concentration in polynomial sign recoveryScott SchubrEdition 2 · 2026-10-27 Public
  17. Left-Sector Mellin Certification of a Weyl-Blind Twisting ModeScott SchubrEdition 2 · 2026-10-27 Public
  18. Growing-Index Recovery and Tail Scales for Signed MeasuresScott SchubrEdition 2 · 2026-10-27 Public
  19. A Positive Corner Limit for Inverse Half-Powers of Vámos QuarticsScott SchubrEdition 2 · 2026-10-27 Public
  20. A counterexample and corrected translation-density criterion for correlation kernelsScott SchubrEdition 2 · 2026-10-27 Public
  21. Asymptotically optimal bounds for permanental cofactor matricesScott SchubrEdition 2 · 2026-10-27 Public
  22. Exact minimax estimation of homogeneous complex Gaussian energiesScott SchubrEdition 2 · 2026-10-27 Public
  23. An explicit global lower certificate for a weighted Weil operatorScott SchubrEdition 2 · 2026-10-27 Public
  24. Odd Weil-form bounds by positive exterior eliminationScott 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.