AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Adaptive Fidelity Estimation for Quantum Programs with Graph-Guided Noise Awareness

Tingting Li, Ziming Zhao, Jianwei Yin

AAAI 2026 · Graph learning › Graph algorithms and clustering · approach: Neural combinatorial optimization on graphs · 1 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
relax fidelity bias threshold from 0.02 to 0.03 (ablation)QuFid · Ising, 10 qubitsmeasurements required: 7448 -> 6664Improved
adaptive budget vs fixed 10000 shotsQuFid · QKNN, 4 qubitsmeasurement iterations: 10000 -> 1192Improved
adaptive budget vs vanilla iteration thresholdsQuFid · QKNN, 6 and 8 qubitsmeasurement iterations: 2,550 -> 2827; 5,050 -> 5584Hurt
adaptive budget vs vanilla iteration thresholdsQuFid · QKNN, 4 qubitsmeasurement iterations: 1,550 -> 1192Improved
QuFid vs learning-based QuCT and QuEstQuFid · representative benchmarksmeasurement shots and biasImproved
QuFid on 10-qubit QAOAQuFid · QAOA 10 qubitsfidelity bias: 0.01821 after 7344 iterationsHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy