arXiv AI By A. Bar{\i}\c{s} \"Ozg\"uler

Securing quantum error correction against misleading advice from AI agents

Read the original on arXiv AI →

The paper investigates how an attacker could manipulate an AI adviser to issue harmful quantum error‑correction updates. It identifies an ambiguity in passive syndrome records that can mislead recovery selection and demonstrates that additional calibration measurements can provide the missing sign information needed for safe updates. By introducing a separate evaluator that only accepts updates when calibration uncertainty and drift bounds certify improvement, the authors show through simulations and surface‑code experiments that harmful proposals are rejected while beneficial ones are retained.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv Machine Learning
Aug 7

Provably Efficient Self-Calibrating Quantum Fault Tolerance

arXiv:2608. 05686v1 Announce Type: cross Abstract: Quantum error correction protects logical information only when every physical operation remains below the fault-tolerance threshold, a condition that must be maintained continuously rather than only at the initial calibration.

By Weiyuan Gong, Hong-Ye Hu
arXiv Machine Learning
Sep 17

QEMScore: How Much Does the Measurement Add to Learned Quantum Error Mitigation?

The paper introduces QEMScore, a metric that compares learned quantum error mitigators to capacity‑matched controls that do not use measurement data. Using simulated circuits with exact ideal answers, the study finds that many mitigators gain little from measurement inputs, with a plain polynomial model often outperforming them. On real hardware data, however, measurement inputs can provide predictive benefits, highlighting that performance depends on representation and protocol specifics.

By Yue Zhao, Huayue Gu, Yushun Dong, Xiyang Hu
arXiv Machine Learning
Sep 24

Repairability of Inexact Solvers in Recursive State Estimation with Machine Learning

The paper investigates how approximate numerical solvers used in recursive state estimation can be repaired using bounded corrections, characterizing when such corrections meet local admissibility tolerances and how they influence finite‑horizon covariance. It derives error identities that separate solve error from gain drift, revealing quartic and sixth‑order contributions to the covariance response. The framework is applied to a power‑grid tolerance study, showing that learned corrections reduce the required conjugate‑gradient iterations, and it demonstrates a unified interface for classical, quantum, and hybrid solvers.

By Yanjun Ji, Dennis Willsch, Orkun \c{S}ensebat, Priyanka Arkalgud Ganeshamurthy, Zhi Pei, M. Sahnawaz Alam, Ivelina Stoyanova, Frank K. Wilhelm, Bo Zhao, Chao Wang, Kristel Michielsen