



01576nas a2200181   4500008004100000022001400041245006300055210006100118260001400179300001600193490000600209520107500215100001701290700001701307700001801324700001501342856003701357       2024                        eng d  a2475-142100aA Case for Synthesis of Recursive Quantum Unitary Programs0 aCase for Synthesis of Recursive Quantum Unitary Programs  c12/5/2023  a1759–17880 v83 a<p>Quantum programs are notoriously difficult to code and verify due to unintuitive quantum knowledge associated with quantum programming. Automated tools relieving the tedium and errors associated with low-level quantum details would hence be highly desirable. In this paper, we initiate the study of program synthesis for quantum unitary programs that recursively define a family of unitary circuits for different input sizes, which are widely used in existing quantum programming languages. Specifically, we present QSynth, the first quantum program synthesis framework, including a new inductive quantum programming language, its specification, a sound logic for reasoning, and an encoding of the reasoning procedure into SMT instances. By leveraging existing SMT solvers, QSynth successfully synthesizes ten quantum unitary programs including quantum adder circuits, quantum eigenvalue inversion circuits and Quantum Fourier Transformation, which can be readily transpiled to executable programs on major quantum platforms, e.g., Q#, IBM Qiskit, and AWS Braket.</p>1 aDeng, Haowei1 aTao, Runzhou1 aPeng, Yuxiang1 aWu, Xiaodi  uhttps://arxiv.org/abs/2311.11503