Statistical Symmetry Release for Equivariant Quantum Learning

• URL: http://arxiv.org/abs/2609.11470v1
• Date: Thu, 10 Sep 2026 12:38:27 GMT
• Title: Statistical Symmetry Release for Equivariant Quantum Learning
• Abstract summary: Hard symmetry constraints reduce model complexity, but can also erase label information.<n> Statistical symmetry release determines when finite data and quantum measurements justify relaxing such a constraint.
• Score: 12.042012916861829
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Hard symmetry constraints reduce model complexity, but can also erase label information. Statistical symmetry release determines when finite data and quantum measurements justify relaxing such a constraint, which directions to open, and how far to move. We connect global signal detection to local, loss-dependent improvement. A two-copy twirl--swap gate estimates task information in the symmetry-breaking complement with a dimension-independent copy count under paired-state and group-unitary access; reweighting the same records resolves representation sectors. An exact duality distinguishes this Hilbert--Schmidt signal from the larger signal accessible to bounded-outcome readouts. Local improvement is governed by the release gradient and a loss-corrected double-commutator matrix. Simultaneous confidence bounds convert empirical direction selection into certified descent, using either shared Pauli measurements or scalar probes with state-independent truncation bounds. Gaussian testing lower bounds quantify the cost of searching over unknown directions in the calibrated local experiment. Independent validation controls adaptively generated models, and a fast squared-loss bound preserves the approximation--estimation rate of a nested release path. On an eight-qubit Ising model, shared measurements certify release with 6300 times fewer shots than the specified scalar estimator on the tested budget grids. Quotient quantum natural gradient then controls parameter redundancy during training. Together, these results turn symmetry relaxation into a statistically justified model-selection decision.

Related papers

• Marginal Coordinate Test for Fréchet Regression with Random Objects [15.929485404318557]
  We develop a test for regression with Euclidean predictors and a random-object response in a separable metric space.<n>We establish a weighted centered chi-square null limit, wild bootstrap validity, and consistency against fixed detectable alternatives.<n>For simultaneous inference, truncated p-to-e calibration combined with e-BH provides false discovery rate control under general dependence.
  arXiv  Detail & Related papers  (2026-08-31T11:48:12Z)
• Feature Priming in Online Linear Regression: Sparse-Regret Lower Bounds and a Tight Univariate Rate [47.36630149538994]
  In high-dimensional online prediction, the best predictor may depend on only a few features, so regret should scale with sparsity rather than the ambient dimension.<n>Warmuth and Amid asked at COLT 2023 whether any of three such rules admits a competitive online regret guarantee.<n>Our analysis identifies a common obstruction: cheap nuisance causes the refit to underweight the truly predictive coordinate.
  arXiv  Detail & Related papers  (2026-08-18T09:32:03Z)
• What Accuracy and Gradient Cosine Miss: Evaluating Feedback Alignment via Scale Stability, Reference Validity, and Depth Utility [48.10132234701036]
  We propose a diagnostic evaluation protocol based on three checks -- scale stability, reference validity, and depth utility -- together with per-layer rather than aggregate cosine reporting.<n>Across multiple architectures and methods, our protocol identifies all failures with wide calibration margins.
  arXiv  Detail & Related papers  (2026-06-19T06:04:17Z)
• ARC: Adaptive Robust Joint State and Covariance Estimation [42.045109659898465]
  Sensor measurements are frequently corrupted by outliers and non-Gaussian noise.<n>These imperfections in the sensor data can cause classical state estimators to generate biased and unreliable state and uncertainty estimates.<n>This paper proposes a unified Block-Coordinate Descent framework that combines a norm-aware adaptive robust loss, and an Iteratively Reweighted Least-Squares state update.
  arXiv  Detail & Related papers  (2026-06-18T16:09:50Z)
• Blind Symmetry Matching in Quantum States with Application to Shot-Count Reduction [1.3537117504260623]
  A basis adapted to a symmetry it carries reduces the repeated measurements needed to read a statistical answer.<n>Two conditions are treated, both detected by the same score with a different projection.<n>Blind symmetry matching is a practical primitive for the common case where the matched basis cannot be written down in advance.
  arXiv  Detail & Related papers  (2026-06-17T15:36:12Z)
• Fast Nonparametric Conditional Independence Testing via Two-Stage Regression [1.8275108630751837]
  We introduce BLITZ (Broad-to-Local Independence Testing via residualiZation), a nonparametric conditional independence test designed to run well under a second.<n>BLITZ removes broad smooth dependence on the conditioning set using low-order regression, then applies a small nonlinear feature map and residualizes those features with shallow tree regressions.<n>We show theoretically that the two-stage design reduces the effective complexity faced by the tree residualizers, allowing shallow trees to control residual conditional-mean bias while avoiding excessive overfitting.
  arXiv  Detail & Related papers  (2026-06-16T14:55:00Z)
• Data-Driven, Geometry-Aware Optimal-Transport Calibration of Flavor Tagger [0.0]
  Flavor-tagging calibrations are often provided either as scale factors measured at a finite set of working points or as binned corrections to a chosen one-dimensional discriminant.<n>This approach falls short of providing continuous, event-level calibration across the full multicomponent outputs of modern taggers.<n>We propose a geometry-aware framework that formulates flavor-tagger calibration as an optimal transport problem on the probability simplex.
  arXiv  Detail & Related papers  (2026-05-02T10:16:13Z)
• Neural quantum states for entanglement depth certification from randomized Pauli measurements [0.0]
  Entanglement depth quantifies how many qubits share genuine multipartite entanglement.<n> certification typically relies on tailored witnesses or full tomography.<n>We recast entanglement-depth and non-$k$-separability certification as likelihood-based model selection.
  arXiv  Detail & Related papers  (2025-12-15T09:20:15Z)
• Verifying Closed-Loop Contractivity of Learning-Based Controllers via Partitioning [52.23804865017831]
  We address the problem of verifying closed-loop contraction in nonlinear control systems whose controller and contraction metric are both parameterized by neural networks.<n>We derive a tractable and scalable sufficient condition for closed-loop contractivity that reduces to checking that the dominant eigenvalue of a symmetric Metzler matrix is nonpositive.
  arXiv  Detail & Related papers  (2025-12-01T23:06:56Z)
• Unsupervised Conformal Inference: Bootstrapping and Alignment to Control LLM Uncertainty [49.19257648205146]
  We propose an unsupervised conformal inference framework for generation.<n>Our gates achieve close-to-nominal coverage and provide tighter, more stable thresholds than split UCP.<n>The result is a label-free, API-compatible gate for test-time filtering.
  arXiv  Detail & Related papers  (2025-09-26T23:40:47Z)
• Rao-Blackwell Gradient Estimators for Equivariant Denoising Diffusion [55.95767828747407]
  In domains such as molecular and protein generation, physical systems exhibit inherent symmetries that are critical to model.<n>We present a framework that reduces training variance and provides a provably lower-variance gradient estimator.<n>We also present a practical implementation of this estimator incorporating the loss and sampling procedure through a method we call Orbit Diffusion.
  arXiv  Detail & Related papers  (2025-02-14T03:26:57Z)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)
• Distribution-free binary classification: prediction sets, confidence intervals and calibration [106.50279469344937]
  We study three notions of uncertainty quantification -- calibration, confidence intervals and prediction sets -- for binary classification in the distribution-free setting. We derive confidence intervals for binned probabilities for both fixed-width and uniform-mass binning. As a consequence of our 'tripod' theorems, these confidence intervals for binned probabilities lead to distribution-free calibration.
  arXiv  Detail & Related papers  (2020-06-18T14:17:29Z)

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.