Partial Stabilizer Learning under Fixed Commuting Constraints and the Absence of a Copy-Rate Discount

• URL: http://arxiv.org/abs/2609.13923v1
• Date: Sat, 12 Sep 2026 13:10:02 GMT
• Title: Partial Stabilizer Learning under Fixed Commuting Constraints and the Absence of a Copy-Rate Discount
• Abstract summary: We consider an unknown pure stabilizer state of (n) qudits with a fixed prime local dimension (p)<n>We compare the number (k) of copies available to the learner with the number (n) of qudits and refer to their ratio (k/n) as the copy rate.
• Score: 38.8383517726785
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider an unknown pure stabilizer state of \(n\) qudits with a fixed prime local dimension \(p\), together with prescribed commuting Pauli observables. Rather than learning the whole state, the learner must recover only complementary stabilizers that commute with the prescribed observables, together with their eigenvalues. Once the prescribed measurement is performed, this information and the observed outcome determine the corresponding conditional stabilizer state. We compare the number \(k\) of copies available to the learner with the number \(n\) of qudits and refer to their ratio \(k/n\) as the copy rate. Suppose that the dimension \(m\) of the requested complementary stabilizer subspace satisfies \(m=βn+o(n)\) for a fixed \(0<β\leq1\). If the copy rate converges to a value below one, the optimal exact recovery probabilities and verification scores converge to zero, both in the worst case and under the uniform prior. Conversely, if the number \(k\) of copies minus the number \(n\) of qudits tends to positive infinity, the entire stabilizer state can be identified with probability tending to one, and the requested complementary information can then be extracted. Thus, restricting the learning target to the stabilizer information needed after the prescribed measurement yields no copy-rate discount.

Related papers

• Equilibrium bias and convergence in augmented primal--dual dynamics with sampled constraints [8.980346173234201]
  We study the stability and convergence of augmented primal-dual dynamics when constraint values are estimated from samples.<n>Unbiased constraint observations can produce a biased augmented multiplier signal, shifting the equilibria of the mean dynamics.
  arXiv  Detail & Related papers  (2026-09-12T13:14:10Z)
• Robust CHSH Self-Testing with Finite-Energy GKP States [42.71287663143178]
  We present a full-oscillator analysis of a finite-energy GKP CHSH test.<n>The observed score yields robust Bell-pair self-testing.
  arXiv  Detail & Related papers  (2026-08-11T16:33:28Z)
• Fitted Occupancy-Ratio Evaluation without Bellman Completeness [40.322273308230606]
  Occupancy ratios correct distribution shift in offline reinforcement learning.<n>We propose fitted occupancy-ratio evaluation (FORE), a fitted fixed-point method that characterizes the discounted occupancy ratio.<n>For the empirical recursion, we establish finite-sample regret bounds that yield convergence in KL up to log-ratio approximation error.
  arXiv  Detail & Related papers  (2026-07-06T17:53:32Z)
• General detectability measure [45.85698554568285]
  Distinguishing resource states from resource-free states is a fundamental task in quantum information.<n>We derived the optimal exponential decay rate of the failure probability for detecting a given $n$-tensor product state.
  arXiv  Detail & Related papers  (2025-01-16T05:39:22Z)
• Single-copy stabilizer testing [0.0]
  We consider the problem of testing whether an unknown $n$-qubit quantum state $|psirangle$ is a stabilizer state. We give an algorithm solving this problem using $O(n)$ copies, and conversely prove that $Omega(sqrtn)$ copies are required for any algorithm.
  arXiv  Detail & Related papers  (2024-10-10T14:39:47Z)
• Quantum Subspace Correction for Constraints [3.977810072874835]
  We show that it is possible to construct operators that stabilize the constraint-satisfying subspaces of computational problems in their Ising representations. We also look at a potential use of quantum subspace correction for fault-tolerant depth-reduction.
  arXiv  Detail & Related papers  (2023-10-31T05:23:50Z)
• Spectral stabilizability [0.0]
  We develop conditions for stabilizability based on the target state's eigendecomposition. We use the spectral approach to derive upper bounds on stabilizability for a number of exemplary open system scenarios.
  arXiv  Detail & Related papers  (2022-12-23T10:38:31Z)
• Stabilizer R\'enyi entropy [0.0]
  We introduce a novel measure for the quantum property of nonstabilizerness - commonly known as "magic" We show that this is a good measure of nonstabilizerness from the point of view of resource theory and show bounds with other known measures. We show that the nonstabilizerness is intimately connected to out-of-time-order correlation functions and that maximal levels of nonstabilizerness are necessary for quantum chaos.
  arXiv  Detail & Related papers  (2021-06-23T18:00:02Z)
• Toward Better Generalization Bounds with Locally Elastic Stability [41.7030651617752]
  We argue that locally elastic stability implies tighter generalization bounds than those derived based on uniform stability. We revisit the examples of bounded support vector machines, regularized least square regressions, and gradient descent.
  arXiv  Detail & Related papers  (2020-10-27T02:04:53Z)
• 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.