Adaptive Conformal Prediction for Quantum Machine Learning

• URL: http://arxiv.org/abs/2511.18225v1
• Date: Sun, 23 Nov 2025 00:04:03 GMT
• Title: Adaptive Conformal Prediction for Quantum Machine Learning
• Authors: Douglas Spencer, Samual Nicholls, Michele Caprio,
• Abstract summary: We formalise how the time-varying noise inherent in quantum processors can undermine conformal guarantees.<n>We introduce Adaptive Quantum Conformal Prediction (AQCP), an algorithm which preserves average coverage guarantees under arbitrary hardware noise conditions.
• Score: 1.9116784879310027
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum machine learning seeks to leverage quantum computers to improve upon classical machine learning algorithms. Currently, robust uncertainty quantification methods remain underdeveloped in the quantum domain, despite the critical need for reliable and trustworthy predictions. Recent work has introduced quantum conformal prediction, a framework that produces prediction sets that are guaranteed to contain the true outcome with user-specified probability. In this work, we formalise how the time-varying noise inherent in quantum processors can undermine conformal guarantees, even when calibration and test data are exchangeable. To address this challenge, we draw on Adaptive Conformal Inference, a method which maintains validity over time via repeated recalibration. We introduce Adaptive Quantum Conformal Prediction (AQCP), an algorithm which preserves asymptotic average coverage guarantees under arbitrary hardware noise conditions. Empirical studies on an IBM quantum processor demonstrate that AQCP achieves target coverage levels and exhibits greater stability than quantum conformal prediction.

Related papers

• Quantum Circuit-Based Adaptation for Credit Risk Analysis [27.308408027453012]
  Noisy and Intermediate-Scale Quantum, or NISQ, processors are sensitive to noise, prone to quantum decoherence, and are not yet capable of continuous quantum error correction for fault-tolerant quantum computation.<n>We experimentally study how hardware-aware variational quantum circuits on a superconducting quantum processing unit can model distributions relevant to specific use-case applications for Credit Risk Analysis.
  arXiv  Detail & Related papers  (2026-01-11T11:17:37Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Reinforcement Learning Control of Quantum Error Correction [108.70420561323692]
  Quantum computer learns to self-improve directly from its errors and never stops computing.<n>This work enables a new paradigm: a quantum computer that learns to self-improve directly from its errors and never stops computing.
  arXiv  Detail & Related papers  (2025-11-11T17:32:25Z)
• Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
  Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
  arXiv  Detail & Related papers  (2025-05-24T02:51:34Z)
• Bayesian Quantum Amplitude Estimation [46.03321798937855]
  We present BAE, a problem-tailored and noise-aware Bayesian algorithm for quantum amplitude estimation.<n>In a fault tolerant scenario, BAE is capable of saturating the Heisenberg limit; if device noise is present, BAE can dynamically characterize it and self-adapt.<n>We propose a benchmark for amplitude estimation algorithms and use it to test BAE against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• 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)
• Quantum Vulnerability Analysis to Accurate Estimate the Quantum Algorithm Success Rate [21.46259138110464]
  Quantum computers suffer from noise during computation that is not fully understood. In this article, we propose quantum vulnerability analysis (QVA) to quantify the error impact on quantum applications.
  arXiv  Detail & Related papers  (2022-07-29T02:51:16Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• Randomized compiling for scalable quantum computing on a noisy superconducting quantum processor [0.0]
  Coherent errors limit the performance of quantum algorithms in an unpredictable manner. Average error rates measured by randomized benchmarking and related protocols are not sensitive to the full impact of coherent errors. Our results demonstrate that randomized compiling can be utilized to leverage and predict the capabilities of modern-day noisy quantum processors.
  arXiv  Detail & Related papers  (2020-10-01T06:52:45Z)
• Minimizing estimation runtime on noisy quantum computers [0.0]
  "engineered likelihood function" (ELF) is used for carrying out Bayesian inference. We show how the ELF formalism enhances the rate of information gain in sampling as the physical hardware transitions from the regime of noisy quantum computers. This technique speeds up a central component of many quantum algorithms, with applications including chemistry, materials, finance, and beyond.
  arXiv  Detail & Related papers  (2020-06-16T17:46:18Z)

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.