Automated Verification of Silq Quantum Programs using SMT Solvers
Abstract
We present SilVer (Silq Verification), an automated tool for verifying behaviors of quantum programs written in Silq, which is a high-level programming language for quantum computing. The goal of the verification is to ensure correctness of the Silq quantum program against user-defined specifications using SMT solvers. We introduce a programming model that is based on a quantum RAM-style computer as an interface between Silq programs and SMT proof obligations, allowing for control of quantum operations using both classical and quantum conditions. Additionally, users can employ measurement flags within the specification to easily specify conditions that measurement results require to satisfy for being a valid behavior. We provide case studies on the verification of generating entangled states and multiple oracle-based algorithms.
Keywords
Cite
@article{arxiv.2406.03119,
title = {Automated Verification of Silq Quantum Programs using SMT Solvers},
author = {Marco Lewis and Paolo Zuliani and Sadegh Soudjani},
journal= {arXiv preprint arXiv:2406.03119},
year = {2024}
}
Comments
10 pages, to appear in the proceedings of IEEE QSW 2024