Rule-based hardware-configurable static analysis for quantum programs
Abstract
The rapid evolution of quantum hardware necessitates an adaptable static analysis framework for validating quantum programs. In this work, we introduce SHARP, a rule-based static analysis framework designed for OpenQASM that decouples hardware-specific constraints from the validation engine. By employing a rule-based approach, SHARP allows quantum computing services to validate programs against evolving instruction set architectures (ISAs) without having to modify the core analysis engine. SHARP achieves this by ingesting ISA descriptions as standalone data, making the validation engine resilient to hardware updates. Furthermore, the framework employs an analysis-driven validation mechanism that enables multi-stage validation, simplifying rule construction and enhancing extensibility. We demonstrate how SHARP supports hardware-specific validation tasks and discuss its impact on quantum software development, including language decoupling, program-level constraint validation, and feature access control. Our findings suggest that SHARP provides a path toward a scalable and maintainable programming interface for quantum computing.
Versions
Related
- Encrypted cloning of qubits is able to serve as a quantum primitive, already on non-error-corrected quantum hardware
- Hardware-Efficient Error Mitigation and Shot-Efficient Sampling on IBM Quantum Hardware
- Two-Dimensional Materials toward CMOS-Compatible Scalable Quantum Hardware
- Scalable Simulation of Quantum Dynamics on Topological Quantum Hardware
- Multicopy teleportation and quantum program retrieval on superconducting quantum hardware
BibTeX
@misc{chen2026rulebased,
title = {{Rule-based hardware-configurable static analysis for quantum programs}},
author = {Yi-Ting Chen and Lauren Capelluto and Ryan Shaffer and Jeffrey Heckey},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.01995},
eprint = {2611.01995},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.01995},
}
RIS
TY - UNPB
TI - Rule-based hardware-configurable static analysis for quantum programs
AU - Yi-Ting Chen
AU - Lauren Capelluto
AU - Ryan Shaffer
AU - Jeffrey Heckey
PY - 2026
DA - 2026/11/01
PB - arXiv
DO - 10.48550/arxiv.2611.01995
UR - https://arxiv.org/abs/2611.01995
AB - The rapid evolution of quantum hardware necessitates an adaptable static analysis framework for validating quantum programs. In this work, we introduce SHARP, a rule-based static analysis framework designed for OpenQASM that decouples hardware-specific constraints from the validation engine. By employing a rule-based approach, SHARP allows quantum computing services to validate programs against evolving instruction set architectures (ISAs) without having to modify the core analysis engine. SHARP achieves this by ingesting ISA descriptions as standalone data, making the validation engine resilient to hardware updates. Furthermore, the framework employs an analysis-driven validation mechanism that enables multi-stage validation, simplifying rule construction and enhancing extensibility. We demonstrate how SHARP supports hardware-specific validation tasks and discuss its impact on quantum software development, including language decoupling, program-level constraint validation, and feature access control. Our findings suggest that SHARP provides a path toward a scalable and maintainable programming interface for quantum computing.
ER -