Decision Kernels for Quantum Error Mitigation: Why Accuracy Gains Need Not Improve Downstream Decisions

• URL: http://arxiv.org/abs/2607.02888v1
• Date: Fri, 03 Jul 2026 02:35:57 GMT
• Title: Decision Kernels for Quantum Error Mitigation: Why Accuracy Gains Need Not Improve Downstream Decisions
• Abstract summary: We develop a theory of finite-shot QEM for downstream decisions.<n>We prove quotient factorization, gap-law minimality, a marginal no-go theorem, a QEM pullback theorem, and a fixed-allocation shot-level converse.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum error mitigation (QEM) is usually benchmarked by expectation-value accuracy, but many near-term workflows use those values only to make downstream choices such as argmin selection, ranking, top-k filtering, optimizer-step acceptance, or phase labeling. This creates a structural mismatch: accuracy is measured in the ambient landscape space, whereas shift-invariant decisions depend only on gaps. We develop a quotient-space theory of finite-shot QEM for downstream decisions. The minimal decision-complete object is the residual gap law; in Gaussian finite-shot regimes it is summarized by effective margins and a decision kernel. The QEM-specific point is that this kernel is not free: it is the pullback of shared physical device noise through the mitigation map. We prove quotient factorization, gap-law minimality, a marginal no-go theorem, a QEM pullback theorem, Gaussian decision-risk formulas, and a fixed-allocation shot-level converse. Finite-shot Qiskit Aer simulations demonstrate the predicted divergence in the evaluated regimes. Clifford-data regression can be decision-flat while improving mean-squared error, and probabilistic error cancellation can improve accuracy while worsening decision risk through sampling overhead. Decision-aware selection modestly reduces static held-out failure relative to accuracy-based selection, often by retaining Raw, but the dynamic success target is not reached. Pre-registered stress tests under a calibrated device-noise model and on a hardware micro-cell probe robustness beyond these regimes. The operational implication in the evaluated regimes is to select QEM methods through residual gap geometry, not from expectation-value accuracy alone.

Related papers

• Finite Reliability Representations: Noise-Calibrated Belief-Space Covers for Reliable Decision-Making [0.0]
  We introduce Finite Reliability Representations (FRR), a framework for covering belief spaces by reliability cells.<n>FRR is formulated on beliefs rather than states and uses a cover rather than an equivalence quotient.<n>It applies to finite POMDPs, linear-Gaussian filters, locally linearized nonlinear filters, and particle-filter implementations.
  arXiv  Detail & Related papers  (2026-07-04T20:30:48Z)
• Error-Conditioned Neural Solvers [36.51479208528461]
  Neural surrogate models offer fast approximate mappings from PDE parameters to solutions, but they typically treat solving as a purely statistical task.<n>Recent hybrid methods promote physical correctness by targeting the PDE residual via gradient descent or Gauss-Newton steps, but inherit the compute cost and instability of the underlying classical gradients.<n>We show, theoretically and empirically, that numerically minimizing the PDE residual can be an unreliable proxy for reconstruction accuracy in ill-conditioned systems.
  arXiv  Detail & Related papers  (2026-06-25T17:56:27Z)
• When Bits Break Recourse: Counterfactual-Faithful Quantization [0.6999740786886536]
  We formalize counterfactual sensitivity under quantization through validity, cost, and direction stability.<n>We propose Counterfactual-Faithful Quantization (CFQ), which trains quantizer parameters and mixed-precision bit allocation to preserve counterfactual behavior.
  arXiv  Detail & Related papers  (2026-05-16T21:19:31Z)
• Variational Neural Belief Parameterizations for Robust Dexterous Grasping under Multimodal Uncertainty [5.4872967954342675]
  Risk-sensitive POMDPs use particle-filter beliefs that scale poorly, obstruct gradient-based optimization, and estimate Conditional Value-at-Risk.<n>We instead formulate grasp acquisition as variational inference over latent contact parameters and object pose, representing the belief with a differentiable Gaussian mixture.
  arXiv  Detail & Related papers  (2026-04-28T17:40:49Z)
• LEC: Linear Expectation Constraints for False-Discovery Control in Selective Prediction and Routing Systems [95.35293543918762]
  Large language models (LLMs) often generate unreliable answers, while uncertainty methods fail to fully distinguish correct from incorrect predictions.<n>We address this issue through the lens of false discovery rate (FDR) control, ensuring that among all accepted predictions, the proportion of errors does not exceed a target risk level.<n>We propose LEC, which reinterprets selective prediction as a constrained decision problem by enforcing a Linear Expectation Constraint.
  arXiv  Detail & Related papers  (2025-12-01T11:27:09Z)
• Uncertainty Quantification for Regression using Proper Scoring Rules [76.24649098854219]
  We introduce a unified UQ framework for regression based on proper scoring rules, such as CRPS, logarithmic, squared error, and quadratic scores.<n>We derive closed-form expressions for the uncertainty measures under practical parametric assumptions and show how to estimate them using ensembles of models.<n>Our broad evaluation on synthetic and real-world regression datasets provides guidance for selecting reliable UQ measures.
  arXiv  Detail & Related papers  (2025-09-30T17:52:12Z)
• COIN: Uncertainty-Guarding Selective Question Answering for Foundation Models with Provable Risk Guarantees [51.5976496056012]
  COIN is an uncertainty-guarding selection framework that calibrates statistically valid thresholds to filter a single generated answer per question.<n>COIN estimates the empirical error rate on a calibration set and applies confidence interval methods to establish a high-probability upper bound on the true error rate.<n>We demonstrate COIN's robustness in risk control, strong test-time power in retaining admissible answers, and predictive efficiency under limited calibration data.
  arXiv  Detail & Related papers  (2025-06-25T07:04:49Z)
• A Principled Approach to Randomized Selection under Uncertainty: Applications to Peer Review and Grant Funding [61.86327960322782]
  We propose a principled framework for randomized decision-making based on interval estimates of the quality of each item.<n>We introduce MERIT, an optimization-based method that maximizes the worst-case expected number of top candidates selected.<n>We prove that MERIT satisfies desirable axiomatic properties not guaranteed by existing approaches.
  arXiv  Detail & Related papers  (2025-06-23T19:59:30Z)
• Ask for More Than Bayes Optimal: A Theory of Indecisions for Classification [0.8283940114367678]
  We provide a complete characterization of the minimax risk in selective classification.<n>We propose a finite-sample calibration method with non-asymptotic guarantees.<n>Experiments on Gaussian mixtures and real datasets confirm that small indecision proportions yield substantial accuracy gains.
  arXiv  Detail & Related papers  (2024-12-17T11:25:51Z)
• Relaxed Quantile Regression: Prediction Intervals for Asymmetric Noise [51.87307904567702]
  Quantile regression is a leading approach for obtaining such intervals via the empirical estimation of quantiles in the distribution of outputs.<n>We propose Relaxed Quantile Regression (RQR), a direct alternative to quantile regression based interval construction that removes this arbitrary constraint.<n>We demonstrate that this added flexibility results in intervals with an improvement in desirable qualities.
  arXiv  Detail & Related papers  (2024-06-05T13:36:38Z)
• Calibrating Neural Simulation-Based Inference with Differentiable Coverage Probability [50.44439018155837]
  We propose to include a calibration term directly into the training objective of the neural model. By introducing a relaxation of the classical formulation of calibration error we enable end-to-end backpropagation. It is directly applicable to existing computational pipelines allowing reliable black-box posterior inference.
  arXiv  Detail & Related papers  (2023-10-20T10:20:45Z)

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.