Readout Orientation Controls Measurement-Accessible Quantum Tangent Geometry

• URL: http://arxiv.org/abs/2608.17085v1
• Date: Mon, 17 Aug 2026 19:45:48 GMT
• Title: Readout Orientation Controls Measurement-Accessible Quantum Tangent Geometry
• Abstract summary: A fixed quantum measurement can expose substantially more tangent information than a restricted observable readout retains.<n>We quantify retained tangent mass by $R=mathrmTr(PC)$.<n>The results isolate readout orientation as a degree of freedom invisible to rank alone.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A fixed quantum measurement can expose substantially more tangent information than a restricted observable readout retains. We study this second restriction. For a normalized covariance $C \succeq 0$, $\mathrm{Tr} C = 1$, of measurement-induced tangent scores in an $N$-dimensional centered score space, and a rank-$r$ readout projector $P$, we quantify retained tangent mass by $R=\mathrm{Tr}(PC)$. The ratio $ρ=R/(r/N)$ separates the actual retained mass from a rank-only random-orientation reference. Standard Grassmann averaging gives $\mathbb{E}ρ=1$ and $\mathrm{Var}(ρ) \le 2/(r d_{\mathrm{eff}})$, where $d_{\mathrm{eff}}=1/\mathrm{Tr}(C^2)$. We use this identity as a null model rather than as a new random-projection theorem. Numerically, family-balanced one- and two-body readouts remain close to the rank reference through $n=16$ even as the tangent covariance becomes strongly anisotropic. The decisive equal-rank comparison holds the circuit, measurement record, readout rank, and evaluation shot budget fixed. For Haar-$U(4)$ at $n=12$, cross-fitted alignment increases the mean directional gradient-energy proxy by a factor 9.584 and the finite-shot signal-to-noise ratio by a factor 3.111 relative to the physical one-body readout, while a random rank-matched subspace remains near the rank baseline. A half-filled $U(1)$-conserving family provides a structured counterexample to generic orientation: physical low-weight $Z$ readouts are already strongly aligned with leading tangent directions over the tested finite-size range. We treat this symmetry result as a case study, not as a claim that $U(1)$ symmetry generically prevents barren plateaus or that hydrodynamics is the established mechanism. The results isolate readout orientation as a degree of freedom invisible to rank alone that directly controls how much measured tangent information remains usable after readout restriction.

Related papers

• Matched Queries for Curvature and Density at Branching Junctions [5.081899241065076]
  First-order quantities do not determine how individual branches bend or how their densities change away from the center.<n>We address this inverse problem using matched score queries at$5$ and $$.<n>With strong first-order error, matched responses reduce median parameter error by a factor of 49.4 relative to naive tangent subtraction.
  arXiv  Detail & Related papers  (2026-09-01T14:38:59Z)
• Recovering Weighted Tangent Geometry from a Single-Scale Score Field [5.081899241065076]
  We show that a score field at one noise level determines a weighted tangent geometry when the branch center and homogeneity degree $d$ are unknown.<n>We also prove that for finite planar $C1,$ branches with positive $C0,$ densities, we prove $O()$ convergence from the finite-noise score to its tangent model.
  arXiv  Detail & Related papers  (2026-08-23T10:07:12Z)
• From Approachability Residuals to Anytime-Valid Evidence: The Online Convex Geometry of Testing by Betting [0.1624454100511275]
  Gambling-based sequential tests and Blackwell approachability are linked by a rate-explicit reduction through support-functions.<n>We prove the exact pathwise identity $$ dist(bar r_T,S) =frac1Tsum_t=1Tq_t+fracReg_TT.
  arXiv  Detail & Related papers  (2026-08-10T11:23:30Z)
• Readout-Rank Laws for Isotropic Quantum Tangents [0.0]
  Deep parameterized quantum circuits may remain sensitive to a parameter change while the observables retained by a learning model barely respond.<n>We show that even the joint span of all computational-basis Pauli strings through any fixed weight $k$ retain only $O(nk2-n)$ of the full-record information.
  arXiv  Detail & Related papers  (2026-08-07T11:09:51Z)
• Demixing Sparse Signals from Nonlinear Observations using Generalized Non-convex Regularization [0.0]
  We consider the recovery of a pair of sparse vectors from a limited number of nonlinear observations of their superposition.<n>We propose a regularization-based framework combining a Huberized data fidelity with generalized folded-concave penalties.<n>We derive estimation error bounds of order $sqrtslog(n)/m$ that hold at emphevery localized stationary point.
  arXiv  Detail & Related papers  (2026-07-12T07:29:39Z)
• An Information-Geometric Justification for Composite Coherence in Event-Based Narrative Extraction [0.27074235008521247]
  We study the composite metric $C=sqrtAcdot T$, where $A$ is the angular similarity of document embeddings and $T=1-d_mathrmJS$.<n>Experiments on four corpora, three embedding families, and three topic models are consistent with the framework.
  arXiv  Detail & Related papers  (2026-06-28T00:05:15Z)
• Optimal Unconstrained Self-Distillation in Ridge Regression: Strict Improvements, Precise Asymptotics, and One-Shot Tuning [61.07540493350384]
  Self-distillation (SD) is the process of retraining a student on a mixture of ground-truth and the teacher's own predictions.<n>We show that for any prediction risk, the optimally mixed student improves upon the ridge teacher for every regularization level.<n>We propose a consistent one-shot tuning method to estimate $star$ without grid search, sample splitting, or refitting.
  arXiv  Detail & Related papers  (2026-02-19T17:21:15Z)
• Convergence of TD(0) under Polynomial Mixing with Nonlinear Function Approximation [49.1574468325115]
  Temporal Difference Learning (TD(0)) is fundamental in reinforcement learning.<n>We provide the first high-probability, finite-sample analysis of vanilla TD(0) on mixing Markov data.
  arXiv  Detail & Related papers  (2025-02-08T22:01:02Z)
• Dimension-free Private Mean Estimation for Anisotropic Distributions [55.86374912608193]
  Previous private estimators on distributions over $mathRd suffer from a curse of dimensionality. We present an algorithm whose sample complexity has improved dependence on dimension.
  arXiv  Detail & Related papers  (2024-11-01T17:59:53Z)
• On the $O(\frac{\sqrt{d}}{T^{1/4}})$ Convergence Rate of RMSProp and Its Momentum Extension Measured by $\ell_1$ Norm [54.28350823319057]
  This paper considers the RMSProp and its momentum extension and establishes the convergence rate of $frac1Tsum_k=1T.<n>Our convergence rate matches the lower bound with respect to all the coefficients except the dimension $d$.<n>Our convergence rate can be considered to be analogous to the $frac1Tsum_k=1T.
  arXiv  Detail & Related papers  (2024-02-01T07:21:32Z)
• Semidefinite programming relaxations and debiasing for MAXCUT-based clustering [1.9761774213809036]
  We consider the problem of partitioning a small data sample of size $n$ drawn from a mixture of 2 sub-gaussian distributions in $mathbbRp$.<n>We use semidefinite programming relaxations of an integer quadratic program that is formulated as finding the maximum cut on a graph.
  arXiv  Detail & Related papers  (2024-01-16T03:14:24Z)
• How Over-Parameterization Slows Down Gradient Descent in Matrix Sensing: The Curses of Symmetry and Initialization [46.55524654398093]
  We show how over- parameterization changes the convergence behaviors of descent. The goal is to recover an unknown low-rank ground-rank ground-truth matrix from near-isotropic linear measurements. We propose a novel method that only modifies one step of GD and obtains a convergence rate independent of $alpha$.
  arXiv  Detail & Related papers  (2023-10-03T03:34:22Z)
• A Unified Framework for Uniform Signal Recovery in Nonlinear Generative Compressed Sensing [68.80803866919123]
  Under nonlinear measurements, most prior results are non-uniform, i.e., they hold with high probability for a fixed $mathbfx*$ rather than for all $mathbfx*$ simultaneously. Our framework accommodates GCS with 1-bit/uniformly quantized observations and single index models as canonical examples. We also develop a concentration inequality that produces tighter bounds for product processes whose index sets have low metric entropy.
  arXiv  Detail & Related papers  (2023-09-25T17:54:19Z)
• Measurement-induced phase transition for free fermions above one dimension [46.176861415532095]
  Theory of the measurement-induced entanglement phase transition for free-fermion models in $d>1$ dimensions is developed. Critical point separates a gapless phase with $elld-1 ln ell$ scaling of the second cumulant of the particle number and of the entanglement entropy.
  arXiv  Detail & Related papers  (2023-09-21T18:11:04Z)
• Sparse sketches with small inversion bias [79.77110958547695]
  Inversion bias arises when averaging estimates of quantities that depend on the inverse covariance. We develop a framework for analyzing inversion bias, based on our proposed concept of an $(epsilon,delta)$-unbiased estimator for random matrices. We show that when the sketching matrix $S$ is dense and has i.i.d. sub-gaussian entries, the estimator $(epsilon,delta)$-unbiased for $(Atop A)-1$ with a sketch of size $m=O(d+sqrt d/
  arXiv  Detail & Related papers  (2020-11-21T01:33:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.