Efficiently Verifying Quantum Programs with Few T Gates

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

Nengkun Yu

Mingsheng Ying

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.

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.

Mingsheng Ying, Nengkun Yu, Yuan Feng +1 more