Enabling the Verification and Formalization of Hybrid Quantum-Classical Computing with OpenQASM 3.0 compatible QASM-TS 2.0
Sean Kim, Marcus Edwards

TL;DR
This paper introduces a TypeScript-based parser for OpenQASM 3.0, facilitating verification, validation, and formalization of hybrid quantum-classical programs to advance quantum computing reliability.
Contribution
It provides the first open-source QASM 3.0 parser in TypeScript, enabling verification and formalization tools for hybrid quantum-classical computing.
Findings
Successfully implemented and tested the QASM 3.0 parser
Supports development of verification and validation software
Facilitates formalization of hybrid quantum-classical logic
Abstract
The unique features of the hybrid quantum-classical computing model implied by the specification of OpenQASM 3.0 motivate new approaches to quantum program verification. We implement and thoroughly test a QASM 3.0 parser in TypeScript to enable implementations of verification and validation software, compilers, and more. We aim to help the community to formalize the logic of hybrid quantum-classical computing by providing tools that may help with such efforts.
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.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture
