Beyond Rules: LLM-Powered Linting for Quantum Programs
Pietro Cassieri, Giuseppe Scanniello, Seung Yeob Shin, Fabrizio Pastore, Domenico Bianculli

TL;DR
This paper introduces LLM-powered approaches for quantum program linting, outperforming traditional rule-based tools in detecting quantum programming issues with higher accuracy and adaptability.
Contribution
It presents novel LLM-based methods, using Chain-of-Thought prompting and RAG, to improve quantum program analysis over existing rule-based linters.
Findings
LLM-based approaches outperform LintQ in detection accuracy (F1-score 0.70 vs. 0.41)
RAG-enhanced method achieves higher precision, reducing false positives
LLMs offer a scalable, adaptive foundation for future quantum software linters.
Abstract
As quantum computing transitions from theoretical experimentation to its practical application, the reliability of quantum software has become a critical bottleneck. Traditional static analysis techniques for quantum programs, primarily rule-based linters, are increasingly inadequate; they struggle to keep pace with rapidly evolving APIs and fail to capture complex, context-dependent quantum programming problems. This results in high maintenance overhead and limited detection capabilities. In this paper, we introduce LintQ-LLM+CoT and LintQ-LLM+RAG, novel approaches that redefine the detection of quantum programming problems by employing Large Language Models (LLMs) specialized, respectively, via Chain-of-Thought (CoT) prompting and a Retrieval-Augmented Generation (RAG) system that grounds the model's reasoning in a curated knowledge base of verified quantum programming problems and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
