aiqbench analysis
QUFIG leverages Graph Neural Networks to prioritize gate-level fault injection attacks in quantum circuits, significantly reducing the inspection overhead required to identify high-impact vulnerabilities. By mapping circuit dependencies into a graph structure, this method outperforms random sampling and depth-based heuristics in locating critical failure points under strict fidelity budgets. This approach directly addresses the scalability challenges of securing cloud-based quantum computing platforms against run-time attacks.
QUFIG: GNN-Based Prediction of Quantum Fault Injection Vulnerabilities with Gate-Level Precision
arXiv:2610.01777v1 Announce Type: new Abstract: The growing scale and accessibility of quantum hardware exposed new reliability and security challenges in the quantum computing workflow, such as the run-time fault injection attacks in cloud-based quantum computing platforms. However, existing works fail to identify vulnerabilities with gate-level precision or adapt to run-time environments. In this work, we formulate gate-level fault analysis as a learning-guided prioritization problem under restricted fidelity budgets. The framework uses a circuit-DAG-based GNN backbone to predict the vulnerability score of each gate to each type of injected fault, defined as the impact of the gate-fault pair on circuit fidelity. The gate-fault pairs are then ranked by their vulnerability score. Experiments on QASMbench and HamLib MaxCut show that QUFIG recovers high-impact vulnerable gate-fault pairs with fewer inspections than random and depth-based heuristics. Our results show that QUFIG can reduce the number of gates requiring inspection by 2.9--19.8% while maintaining effective fault identification, allowing quantum circuit designers to identify vulnerabilities and apply targeted defenses more efficiently.
Abstract:The growing scale and accessibility of quantum hardware exposed new reliability and security challenges in the quantum computing workflow, such as the run-time fault injection attacks in cloud-based quantum computing platforms. However, existing works fail to identify vulnerabilities with gate-level precision or adapt to run-time environments. In this work, we formulate gate-level fault analysis as a learning-guided prioritization problem under restricted fidelity budgets. The framework uses a circuit-DAG-based GNN backbone to predict the vulnerability score of each gate to each type of injected fault, defined as the impact of the gate-fault pair on circuit fidelity. The gate-fault pairs are then ranked by their vulnerability score. Experiments on QASMbench and HamLib MaxCut show that QUFIG recovers high-impact vulnerable gate-fault pairs with fewer inspections than random and depth-based heuristics. Our results show that QUFIG can reduce the number of gates requiring inspection by 2.9--19.8% while maintaining effective fault identification, allowing quantum circuit designers to identify vulnerabilities and apply targeted defenses more efficiently.
Quantum Physics (quant-ph); Cryptography and Security (cs.CR)
arXiv:2610.01777 [quant-ph]
(or arXiv:2610.01777v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2610.01777 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 258 words
Related coverage

Researchers Cut Quantum Circuit Checks by Nearly Twenty Percent
Quantum Zeitgeist · Oct 2, 2026

News
Quantum Computing Report · Jul 25, 2026
News Archive 2026
Quantum Computing Report · Jul 25, 2026

HSM designs upgrade entropy sources with quantum randomness
Quantum Zeitgeist · Oct 4, 2026