A Graph-Based Forensic Framework for Inferring Hardware Noise of Cloud Quantum Backend

• URL: http://arxiv.org/abs/2512.14541v1
• Date: Tue, 16 Dec 2025 16:17:04 GMT
• Title: A Graph-Based Forensic Framework for Inferring Hardware Noise of Cloud Quantum Backend
• Abstract summary: Cloud quantum platforms give users access to many backends with different qubit technologies, coupling layouts, and noise levels.<n>Execution of a circuit depends on internal allocation and routing policies that are not observable to the user.<n>We introduce a Graph Neural Network (GNN)-based forensic framework that predicts per-qubit and per-qubit link error rates of an unseen backend.
• Score: 0.5352699766206807
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Cloud quantum platforms give users access to many backends with different qubit technologies, coupling layouts, and noise levels. The execution of a circuit, however, depends on internal allocation and routing policies that are not observable to the user. A provider may redirect jobs to more error-prone regions to conserve resources, balance load or for other opaque reasons, causing degradation in fidelity while still presenting stale or averaged calibration data. This lack of transparency creates a security gap: users cannot verify whether their circuits were executed on the hardware for which they were charged. Forensic methods that infer backend behavior from user-visible artifacts are therefore becoming essential. In this work, we introduce a Graph Neural Network (GNN)-based forensic framework that predicts per-qubit and per-qubit link error rates of an unseen backend using only topology information and aggregated features extracted from transpiled circuits. We construct a dataset from several IBM 27-qubit devices, merge static calibration features with dynamic transpilation features and train separate GNN regressors for one- and two-qubit errors. At inference time, the model operates without access to calibration data from the target backend and reconstructs a complete error map from the features available to the user. Our results on the target backend show accurate recovery of backend error rate, with an average mismatch of approximately 22% for single-qubit errors and 18% for qubit-link errors. The model also exhibits strong ranking agreement, with the ordering induced by predicted error values closely matching that of the actual calibration errors, as reflected by high Spearman correlation. The framework consistently identifies weak links and high-noise qubits and remains robust under realistic temporal noise drift.

Related papers

• Exact learning of quantum noise with tensor networks [0.0]
  We present a variational framework that learns the noise model directly from quantum-error-correction syndrome and logical-observable data.<n>We prove that this objective is principled rather than ad hoc: a sufficiently expressive noise ansatz attains the information-theoretic minimum logical error rate.
  arXiv  Detail & Related papers  (2026-08-31T18:01:16Z)
• Tensor network characterization and mitigation of readout errors [16.364682124857485]
  Readout errors are a major bottleneck to extracting reliable information from near-term quantum processors.<n>We present a unified tensor-network framework that models the readout process as a matrix product operator (MPO)<n>Experiments on a superconducting processor and numerical simulations up to 20 qubits show that the MPO model captures correlated readout errors that uncorrelated models miss.
  arXiv  Detail & Related papers  (2026-06-24T15:45:47Z)
• Scalable Quantum Error Mitigation with Physically Informed Graph Neural Networks [15.406494854444583]
  Quantum error mitigation (QEM) provides a practical route for estimating reliable observables on noisy quantum devices.<n>We construct a graph-enhanced mitigation (GEM) framework, which incorporates physical information into the model representation.<n>We show that GEM provides a level of accuracy comparable to CDR at small scales, while yielding lower mean absolute error and improved stability in zero-shot transfer to larger systems.
  arXiv  Detail & Related papers  (2026-04-18T04:04:54Z)
• Generalizing GNNs with Tokenized Mixture of Experts [75.8310720413187]
  We show that improving stability requires reducing reliance on shift-sensitive features, leaving an irreducible worst-case generalization floor.<n>We propose STEM-GNN, a pretrain-then-finetune framework with a mixture-of-experts encoder for diverse computation paths.<n>Across nine node, link, and graph benchmarks, STEM-GNN achieves a stronger three-way balance, improving robustness to degree/homophily shifts and to feature/edge corruptions while remaining competitive on clean graphs.
  arXiv  Detail & Related papers  (2026-02-09T22:48:30Z)
• Reinforcement Learning with Verifiable yet Noisy Rewards under Imperfect Verifiers [90.50039419576807]
  Reinforcement Learning with Verifiable Rewards (RLVR) trains policies against automated verifiers to avoid costly human labeling.<n>To reduce vulnerability to verifier hacking, many RLVR systems collapse rewards to binary $0,1$ during training.<n>This choice carries a cost: it introduces textitfalse negatives (rejecting correct answers, FNs) and textitfalse positives (accepting incorrect ones, FPs)
  arXiv  Detail & Related papers  (2025-10-01T13:56:44Z)
• Revisiting Multivariate Time Series Forecasting with Missing Values [65.30332997607141]
  Missing values are common in real-world time series.<n>Current approaches have developed an imputation-then-prediction framework that uses imputation modules to fill in missing values, followed by forecasting on the imputed data.<n>This framework overlooks a critical issue: there is no ground truth for the missing values, making the imputation process susceptible to errors that can degrade prediction accuracy.<n>We introduce Consistency-Regularized Information Bottleneck (CRIB), a novel framework built on the Information Bottleneck principle.
  arXiv  Detail & Related papers  (2025-09-27T20:57:48Z)
• Distributed Training under Packet Loss [8.613477072763404]
  Leveraging unreliable connections will reduce latency but may sacrifice model accuracy and convergence once packets are dropped.<n>We introduce a principled, end-to-end solution that preserves accuracy and convergence guarantees under genuine packet loss.<n>This work bridges the gap between communication-efficient protocols and the accuracy and guarantees demanded by modern large-model training.
  arXiv  Detail & Related papers  (2025-07-02T11:07:20Z)
• Forensics of Error Rates of Quantum Hardware [2.348041867134616]
  We estimate the error rate of the backend from the original and transpiled circuit.<n>For the forensics, we exploit the fact that qubit mapping and routing steps of the transpilation process select qubits and qubit pairs with less single qubit and two-qubit gate errors.
  arXiv  Detail & Related papers  (2025-05-16T21:25:12Z)
• 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)
• Fault-tolerant quantum computation using large spin cat-codes [0.8640652806228457]
  We construct a fault-tolerant quantum error-correcting protocol based on a qubit encoded in a large spin qudit using a spin-cat code. We show how to generate a universal gate set, including the rank-preserving CNOT gate, using quantum control and the Rydberg blockade. These findings pave the way for encoding a qubit in a large spin with the potential to achieve fault tolerance, high threshold, and reduced resource overhead in quantum information processing.
  arXiv  Detail & Related papers  (2024-01-08T22:56:05Z)
• DGR: Tackling Drifted and Correlated Noise in Quantum Error Correction via Decoding Graph Re-weighting [14.817445452647588]
  We propose an efficient decoding graph edge re-weighting strategy with no quantum overhead. DGR reduces the logical error rate by 3.6x on average-case noise mismatch with exceeding 5000x improvement under worst-case mismatch.
  arXiv  Detail & Related papers  (2023-11-27T18:26:16Z)
• Bridging Precision and Confidence: A Train-Time Loss for Calibrating Object Detection [58.789823426981044]
  We propose a novel auxiliary loss formulation that aims to align the class confidence of bounding boxes with the accurateness of predictions. Our results reveal that our train-time loss surpasses strong calibration baselines in reducing calibration error for both in and out-domain scenarios.
  arXiv  Detail & Related papers  (2023-03-25T08:56:21Z)
• Witnessing entanglement in trapped-ion quantum error correction under realistic noise [41.94295877935867]
  Quantum Error Correction (QEC) exploits redundancy by encoding logical information into multiple physical qubits. We present a detailed microscopic error model to estimate the average gate infidelity of two-qubit light-shift gates used in trapped-ion platforms. We then apply this realistic error model to quantify the multipartite entanglement generated by circuits that act as QEC building blocks.
  arXiv  Detail & Related papers  (2022-12-14T20:00:36Z)
• 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)

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.