Luminary Research Archive
Luminary Research ArchiveIndependent scholarship
Luminary Portal

All Research

Research

154 papers
Browse papers
  1. Certified source elimination for localized odd Weil formsScott SchubrEdition 2 · 2026-10-27 Public
  2. Trace-perturbed minimizers of the mixed discriminantScott SchubrEdition 2 · 2026-10-27 Public
  3. Single-copy learning of noisy stabilizers by certified filteringScott SchubrEdition 2 · 2026-10-27 Public
  4. Exponential growth of sparse Euler products and normal graded domainsScott SchubrEdition 2 · 2026-10-27 Public
  5. Phase transitions and effective curvature bounds in Fourier density modelsScott SchubrEdition 2 · 2026-10-27 Public
  6. Sharp Stability and Geometric Classification of a Vámos Quartic DeformationScott SchubrEdition 2 · 2026-10-27 Public
  7. Strong permanent inequalities for cycles and a class of single-chord supportsScott SchubrEdition 2 · 2026-10-27 Public
  8. Sharp Quadratic Smoothing for Truncated Simplex SumsScott SchubrEdition 2 · 2026-10-27 Public
  9. Sharp limitations of two permanental cofactor comparisonsScott SchubrEdition 2 · 2026-10-27 Public
  10. Three-point positivity for weighted products of Riemann theta density powersScott SchubrEdition 2 · 2026-10-27 Public
  11. Strong permanent inequalities on three chorded seven-cycle supportsScott SchubrEdition 2 · 2026-10-27 Public
  12. Coupled permanent cofactors: sharp occupation bounds and compensation geometryScott SchubrEdition 11 · 2026-10-27 Public
  13. Strong permanent inequalities for three-row bipartite supports and triangle-free supports through order sevenScott SchubrEdition 2 · 2026-10-27 Public
  14. Strong permanent contraction on four-row bipartite supports through six columnsScott SchubrEdition 2 · 2026-10-27 Public
  15. Strong permanent contraction on four-by-seven bipartite supportsScott SchubrEdition 2 · 2026-10-27 Public
  16. Finite-order positivity and growing negative inertia for averaged Riemann theta productsScott SchubrEdition 2 · 2026-10-27 Public
  17. Row-dependent bounds for strong permanent contraction on four-by-eight supportsScott SchubrEdition 2 · 2026-10-27 Public
  18. Compact capture and protected bridges on the Koras–Russell cylinderScott SchubrEdition 2 · 2026-10-27 Public
  19. Dimension-dependent holomorphic certificate degrees on zero-sum hyperplanesScott SchubrEdition 2 · 2026-10-27 Public
  20. Admissible kernel lifts with positive endpoint forms and nonreal Fourier zerosScott SchubrEdition 2 · 2026-10-27 Public
  21. Global finite-depth stability and nonreal zeros of admissible Fourier transformsScott SchubrEdition 2 · 2026-10-27 Public
  22. A Weyl Law for Rapidly Twisted Polar-Strip TubesScott SchubrEdition 2 · 2026-10-27 Public
  23. Weighted polynomial localization and theta correction inertiaScott SchubrEdition 2 · 2026-10-27 Public
  24. Weyl Laws and Angular Stability for Rapidly Twisted TubesScott 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.