Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Efficiently Verifying Quantum Programs with Few T Gates

Youngchan Cho, Robert Rand

Published Jan 1, 2026• 1 citation
Publisher
DOI
10.1007/978-3-032-15700-3_3

Related papers

Quantum gate verification and its application in property testing

Pei Zeng, You Zhou, Zhenhuan Liu

This paper establishes a general framework of verifying a unitary gate based on few rounds of state preparation and measurements. The authors study the efficiency and optimality of the verification strategies in both non-adversarial and adversarial scenario. Furthermore, they provide examples for the commonly-used quantum gates and show the application in channel property testing

arXiv:1911.06855•Physical Review Research•Jun 9, 2020•23 citations

Towards Efficient Reasoning of Quantum Programs

Nengkun Yu

Lecture notes in computer science•Jan 1, 2022•1 citation

Parameterized Verification of Quantum Circuits

Parosh Aziz Abdulla, Yu-Fang Chen, Michal Hečko +4 more

We present the first fully automatic framework for verifying relational properties of parameterized quantum programs , i.e., a program that, given an input size, generates a corresponding quantum circuit. We focus on verifying input-output correctness as well as equivalence. At the core of our approach is a new automata model, synchronized weighted tree automata (SWTAs), which compactly and precisely captures the infinite families of quantum states produced by parameterized programs. We introduce a class of transducers to model quantum gate semantics and develop composition algorithms for constructing transducers of parameterized circuits. Verification is reduced to functional inclusion or equivalence checking between SWTAs, for which we provide decision procedures. Our implementation demonstrates both the expressiveness and practical efficiency of the framework by verifying a diverse set of representative parameterized quantum programs with verification times ranging from milliseconds to seconds.

arXiv:2511.19897•Proceedings of the ACM on Programming Languages•Jan 8, 2026•14 citations

Verification of quantum programs

Mingsheng Ying, Nengkun Yu, Yuan Feng +1 more

arXiv:1106.4063•Science of Computer Programming•Apr 16, 2013•57 citations

Verification of quantum programs

Mingsheng Ying

Elsevier eBooks•Jan 1, 2024•0 citations

A Superconducting Quantum Chip Architecture Design Method for Quantum Programs

Liang Chen, Zhenyu Li, Mengfan Zhang +1 more

In the field of superconducting quantum computing, chip architecture design is an important research direction. Currently, most chips are designed for general-purpose architectures, and the fixed connection structure is difficult to ensure the flexibility of mapping, adding extra gate operations and affecting the execution efficiency of different quantum programs. To this end, this paper proposes a superconducting quantum chip architecture design method for quantum programs. The method aims at reducing the number of gates after mapping, and generates a chip architecture with higher fitness by combining the two-qubit gate information of quantum programs through an improved genetic algorithm. The experimental results show that the chip architecture generated by this method outperforms two 2 * 8 scale square lattice generic architectures in 33 test samples, with an average reduction of 35.3 % and 17.9%in the total number of gates optimized, respectively, which verifies the effectiveness of this method.

International Symposium on Computer Technology and Information Science (ISCTIS)•Jul 7, 2023•3 citations
We present the first fully automatic framework for verifying relational properties of parameterized quantum programs , i.e., a program that, given an input size, generates a corresponding quantum circuit. We focus on verifying input-output correctness as well as equivalence. At the core of our approach is a new automata model, synchronized weighted tree automata (SWTAs), which compactly and precisely captures the infinite families of quantum states produced by parameterized programs. We introduce a class of transducers to model quantum gate semantics and develop composition algorithms for constructing transducers of parameterized circuits. Verification is reduced to functional inclusion or equivalence checking between SWTAs, for which we provide decision procedures. Our implementation demonstrates both the expressiveness and practical efficiency of the framework by verifying a diverse set of representative parameterized quantum programs with verification times ranging from milliseconds to seconds.
In the field of superconducting quantum computing, chip architecture design is an important research direction. Currently, most chips are designed for general-purpose architectures, and the fixed connection structure is difficult to ensure the flexibility of mapping, adding extra gate operations and affecting the execution efficiency of different quantum programs. To this end, this paper proposes a superconducting quantum chip architecture design method for quantum programs. The method aims at reducing the number of gates after mapping, and generates a chip architecture with higher fitness by combining the two-qubit gate information of quantum programs through an improved genetic algorithm. The experimental results show that the chip architecture generated by this method outperforms two 2 * 8 scale square lattice generic architectures in 33 test samples, with an average reduction of 35.3 % and 17.9%in the total number of gates optimized, respectively, which verifies the effectiveness of this method.