Conditional validity of quantum event classifiers under collider systematics and quantum estimation uncertainty

• URL: http://arxiv.org/abs/2609.02781v1
• Date: Wed, 02 Sep 2026 16:14:58 GMT
• Title: Conditional validity of quantum event classifiers under collider systematics and quantum estimation uncertainty
• Abstract summary: Claims about a quantum machine-learning classifier can fail when target data shift or when finite-shot quantum evaluation randomizes the model itself.<n>We develop an information-conditional, fail-closed auditing framework that returns supported, refuted or unresolved verdicts.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Claims about a deployed quantum machine-learning classifier can fail when target data shift or when finite-shot quantum evaluation randomizes the model itself. We develop an information-conditional, fail-closed auditing framework that returns supported, refuted or unresolved verdicts with anytime-valid per-claim error control under a declared sampling protocol. On a Higgs-to-tau-tau collider benchmark, stable classifier metrics do not guarantee valid signal-strength inference: at the studied finite-template statistics, the fixed-template profile can lose coverage, even in shift-free controls, when its templates are estimated independently and template-statistical uncertainty is not modeled explicitly. Across 30 frozen finite-shot quantum-kernel deployments, every realized Gram matrix is propagated through refitting, calibration and threshold selection; in the primary raw pipeline these perturbations leave ranking nearly unchanged yet move thresholded target metrics by about 0.02, flipping ideal-anchored claims, and the diagonal-loading sensitivity decomposes differently. Matched classical controls remove apparent quantum-specific nominal-performance and sensing effects. We claim no quantum advantage.

Related papers

• Certifying Adversarial Robustness of Quantum Classifiers under Known-Readout Query Access [6.902322288643561]
  A quantum classifier assigns labels by evolving an input quantum state and measuring the output, so repeated executions reveal only a distribution over labels.<n>We give a measurement-only framework that returns two complementary guarantees for each input.<n>From 40 executions of two 8-qubit quantum neural networks, our method estimates both bounds, with the expected lower-upper ordering on every tested input.
  arXiv  Detail & Related papers  (2026-09-10T14:45:21Z)
• TARA Test-by-Adaptive-Ranks for Quantum Anomaly Detection with Conformal Prediction Guarantees [0.0]
  Quantum key distribution (QKD) security relies on the ability to distinguish genuine quantum correlations from classical eavesdropper simulations.<n>We introduce TARA, a novel framework combining conformal prediction with sequential martingale testing for quantum anomaly detection.
  arXiv  Detail & Related papers  (2025-12-03T17:53:38Z)
• 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)
• 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)
• Error-quantified Conformal Inference for Time Series [55.11926160774831]
  Uncertainty quantification in time series prediction is challenging due to the temporal dependence and distribution shift on sequential data.<n>We propose itError-quantified Conformal Inference (ECI) by smoothing the quantile loss function.<n>ECI can achieve valid miscoverage control and output tighter prediction sets than other baselines.
  arXiv  Detail & Related papers  (2025-02-02T15:02:36Z)
• When Quantum Nonlocality Does Not Play Dice [3.722125357019147]
  Bell inequality violations are often taken as evidence that quantum nonlocality guarantees intrinsic randomness.<n>We show that there exist nontrivial Bell inequalities that are maximally violated by quantum correlations yet fail to certify randomness for any fixed input pair.<n>We construct maximally nonlocal quantum correlations that are deterministic for every fixed input pair.
  arXiv  Detail & Related papers  (2024-08-07T10:07:39Z)
• Quantum Conformal Prediction for Reliable Uncertainty Quantification in Quantum Machine Learning [47.991114317813555]
  Quantum models implement implicit probabilistic predictors that produce multiple random decisions for each input through measurement shots. This paper proposes to leverage such randomness to define prediction sets for both classification and regression that provably capture the uncertainty of the model.
  arXiv  Detail & Related papers  (2023-04-06T22:05:21Z)
• Certified Robustness of Quantum Classifiers against Adversarial Examples through Quantum Noise [68.1992787416233]
  We show that adding quantum random rotation noise can improve robustness in quantum classifiers against adversarial attacks. We derive a certified robustness bound to enable quantum classifiers to defend against adversarial examples.
  arXiv  Detail & Related papers  (2022-11-02T05:17:04Z)
• Shot-frugal and Robust quantum kernel classifiers [12.146571029233435]
  Quantum kernel methods are a candidate for quantum speed-ups in machine learning. We show that for classification tasks, the aim is reliable classification and not precise kernel evaluation. We motivate a new metric that characterizes the reliability of classification.
  arXiv  Detail & Related papers  (2022-10-13T12:48:23Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35: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.