Work

A Practical Specification Language for Automatic Quantum Program Verification

Year: 2026

Type: conference-paper

Abstract: Hoare-style verification provides a principled foundation for reasoning about the correctness of quantum programs, but existing approaches do not allow fully automatic verification. While automata-based verification scales well when specifications are given directly as automata, prior frameworks incur exponential blow-up when translating high-level set-based assertions into automata, which severely limits practicality. We introduce an extended set-based specification language and a specification-to-automata translation algorithm whose complexity is linear in the number of qubits, enabled by controlled automaton construction and qubit reordering. The resulting compact automata enable fully automatic Hoare-style verification of fixed-qubit quantum programs at previously infeasible scales, while substantially improving expressiveness without compromising efficiency.

Source: Lecture notes in computer science

DOI: 10.1007/978-3-032-32537-2_15

Authors: Wei-Lun Tsai, Yu-Fang Chen, Ondřej Lengál

Institutions: National Taiwan University, Institute of Information Science, Academia Sinica, Academia Sinica, Brno University of Technology

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $5,392

Funders: Grantová Agentura České Republiky, Academia Sinica, National Science and Technology Council