Luminary Research Archive
Luminary Research ArchiveIndependent scholarship
Luminary Portal

All Research

Research

154 papers
Browse papers
  1. Self-concordance and allocation for spatial power sumsScott SchubrEdition 3 · 2026-11-01 Public
  2. Sharp all-times heat-content comparison and concentration on compact metric graphsScott SchubrEdition 3 · 2026-11-01 Public
  3. Energy-Filtered Dynamical Localization in Constructive Dirichlet TowersScott SchubrEdition 3 · 2026-11-01 Public
  4. Degree-dependent minimax laws for Gaussian factorial momentsScott SchubrEdition 2 · 2026-11-01 Public
  5. A sharp lower bound for adjacent-edge correlations in random subtreesScott SchubrEdition 4 · 2026-11-01 Public
  6. Sharp transport identification with unknown Gaussian covarianceScott SchubrEdition 3 · 2026-11-01 Public
  7. Statistical inference for empirical heat-kernel Sinkhorn metricsScott SchubrEdition 5 · 2026-11-01 Public
  8. First-Hit Stopping and Bias-Corrected Score Inference in Dimension ThreeScott SchubrEdition 5 · 2026-11-01 Public
  9. Sharp Wasserstein Stability for Gaussian Deconvolution of Log-Concave LawsScott SchubrEdition 4 · 2026-11-01 Public
  10. Exact low-brightness minimax risk for quartic Gaussian energyScott SchubrEdition 1 · 2026-11-01 Public
  11. Sharp estimation costs for thermal Gaussian energies with known backgroundScott SchubrEdition 1 · 2026-11-01 Public
  12. Sharp calibration costs for high-order thermal Gaussian energiesScott SchubrEdition 1 · 2026-11-01 Public
  13. A sharp flatness transition for critical heat traces in twisted tubesScott SchubrEdition 1 · 2026-11-01 Public
  14. Prescribed-Gradient Coefficient Stability for Lorentzian PolynomialsScott SchubrEdition 1 · 2026-11-01 Public
  15. Closure correlations in paving and low-corank matroidsScott SchubrEdition 1 · 2026-11-01 Public
  16. Polynomial Recovery and Masking under Weak Exponential TailsScott SchubrEdition 4 · 2026-11-01 Public
  17. Polynomial inertia of signed measures with negative intervalsScott SchubrEdition 3 · 2026-11-01 Public
  18. Holomorphic certification on real subspacesScott SchubrEdition 3 · 2026-11-01 Public
  19. Arithmetic cutoff bounds and sharp tail capacity for local Nyman–Beurling certificatesScott SchubrEdition 5 · 2026-11-01 Public
  20. Optimal unbiased Gaussian quantum estimation and the cost of unknown squeezingScott SchubrEdition 1 · 2026-11-01 Public
  21. Optimal unbiased estimation of polynomial energies in thermal Gaussian statesScott SchubrEdition 3 · 2026-10-31 Public
  22. Unrestricted Half-Power Obstruction and Polynomial Certificates for the Vámos QuarticScott SchubrEdition 5 · 2026-10-31 Public
  23. Dimension thresholds for log-concavity of normalized mixed momentsScott SchubrEdition 3 · 2026-10-31 Public
  24. Uniform Resolvent Asymptotics for Growing Theta-Null Source FamiliesScott SchubrEdition 2 · 2026-10-31 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.