.png){kind=icon}
.png){kind=icon}
Return
Challenges in Quantum Programs Analysis
.png){kind=icon}
PRE
AI
DOI：10.1007/s10009-026-00845-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The rapid progress of quantum technologies, fostered by the efforts of both academia and industry, has stimulated the design of quantum programming languages and the development of methods to support their verification and optimization. As in the classical setting, static analysis plays a fundamental role in such an endeavour. In this paper, we provide a survey on static analysis approaches for quantum programs, which have been proposed in the literature, distinguishing between dataflow-oriented approaches, which are based on a graph representation of the program information flow, and domain-oriented approaches, which essentially consist of the definition of some appropriate abstract domains representing the program property to be analysed. To illustrate these two perspectives concretely, we also present in detail two specific analyses: a dataflow analysis for managing quantum variables and uncomputation, and a static analysis based on abstract interpretation for detecting state entanglement.
Keywords:
Quantum Programming Languages
Survey
Abstract Interpretation
Static Analysis
Formal Verification
Journal
I
IF:
1.4
Papers:
37
Citations:
842