{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T13:11:20Z","timestamp":1774703480068,"version":"3.50.1"},"reference-count":69,"publisher":"Association for Computing Machinery (ACM)","issue":"FSE","funder":[{"name":"National Natural Science Foundation of China","award":["62472374"],"award-info":[{"award-number":["62472374"]}]},{"name":"National Key Research and Development Program of China","award":["2023YFF0905200"],"award-info":[{"award-number":["2023YFF0905200"]}]},{"name":"Zhejiang Pioneer (Jianbing) Project","award":["2023C01036"],"award-info":[{"award-number":["2023C01036"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Softw. Eng."],"published-print":{"date-parts":[[2025,6,19]]},"abstract":"<jats:p>Quantum programs provide exponential speedups compared to classical programs in certain areas, but they also inevitably encounter logical faults. Automatically repairing quantum programs is much more challenging than repairing classical programs due to the non-replicability of data, the vast search space of program inputs, and the new programming paradigm. Existing works based on semantic-based or learning-based program repair techniques are fundamentally limited in repairing efficiency and effectiveness. In this work, we propose HornBro, an efficient framework for automated quantum program repair. The key insight of HornBro lies in the homotopy-like method, which iteratively switches between the classical and quantum parts. This approach allows the repair tasks to be efficiently offloaded to the most suitable platforms, enabling a progressive convergence toward the correct program. We start by designing an implication assertion pragma to enable rigorous specifications of quantum program behavior, which helps to generate a quantum test suite automatically. This suite leverages the orthonormal bases of quantum programs to accommodate different encoding schemes. Given a fixed number of test cases, it allows the maximum input coverage of potential counter-example candidates. Then, we develop a Clifford approximation method with an SMT-based search to transform the patch localization program into a symbolic reasoning problem. Finally, we offload the computationally intensive repair of gate parameters to quantum hardware by leveraging the differentiability of quantum gates. Experiments suggest that HornBro increases the repair success rate by more than 62.5% compared to the existing repair techniques, supporting more types of quantum bugs. It also achieves 35.7\u00d7 speedup in the repair and 99.9% gate reduction of the patch.<\/jats:p>","DOI":"10.1145\/3715751","type":"journal-article","created":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T15:15:34Z","timestamp":1750346134000},"page":"734-756","source":"Crossref","is-referenced-by-count":1,"title":["HornBro: Homotopy-Like Method for Automated Quantum Program Repair"],"prefix":"10.1145","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0634-8089","authenticated-orcid":false,"given":"Siwei","family":"Tan","sequence":"first","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3801-6847","authenticated-orcid":false,"given":"Liqiang","family":"Lu","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-5333-6955","authenticated-orcid":false,"given":"Debin","family":"Xiang","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-0378-8502","authenticated-orcid":false,"given":"Tianyao","family":"Chu","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-8028-9727","authenticated-orcid":false,"given":"Congliang","family":"Lang","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-8045-6119","authenticated-orcid":false,"given":"Jintao","family":"Chen","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0093-3292","authenticated-orcid":false,"given":"Xing","family":"Hu","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1441-1412","authenticated-orcid":false,"given":"Jianwei","family":"Yin","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]}],"member":"320","published-online":{"date-parts":[[2025,6,19]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.2562111"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63390-9_1"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3290605.3300486"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2022.3172241"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1811.04968"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Carsten Blank Daniel K Park and Francesco Petruccione. 2021. Quantum-enhanced analysis of discrete stochastic processes. npj Quantum Information 7 1 126.","DOI":"10.1038\/s41534-021-00459-2"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","unstructured":"Gilles Brassard Peter H\u00f8yer Michele Mosca and Alain Tapp. 2002. Quantum amplitude amplification and estimation. https:\/\/doi.org\/10.1090\/conm\/305\/05215 10.1090\/conm\/305\/05215","DOI":"10.1090\/conm"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3081415"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","unstructured":"Michael Broughton Guillaume Verdon Trevor McCourt Antonio J. Martinez Jae Hyeon Yoo Sergei V. Isakov Philip Massey Ramin Halavati Murphy Yuezhen Niu Alexander Zlokapa Evan Peters Owen Lockwood Andrea Skolik Sofiene Jerbi Vedran Dunjko Martin Leib Michael Streif David Von Dollen Hongxiang Chen Shuxiang Cao Roeland Wiersema Hsin-Yuan Huang Jarrod R. McClean Ryan Babbush Sergio Boixo Dave Bacon Alan K. Ho Hartmut Neven and Masoud Mohseni. 2021. TensorFlow Quantum: A Software Framework for Quantum Machine Learning. https:\/\/doi.org\/10.48550\/arXiv.2003.02989 arxiv:2003.02989. 10.48550\/arXiv.2003.02989","DOI":"10.48550\/arXiv.2003.02989"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/Q-SE52541.2021.00013"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","unstructured":"Yudong Cao Jonathan Romero Jonathan P Olson Matthias Degroote Peter D Johnson M\u00e1ria Kieferov\u00e1 Ian D Kivlichan Tim Menke Borja Peropadre and Nicolas PD Sawaya. 2019. Quantum chemistry in the age of quantum computing. Chemical reviews 119 19 10856\u201310915. https:\/\/doi.org\/10.1021\/acs.chemrev.8b00803 10.1021\/acs.chemrev.8b00803","DOI":"10.1021\/acs.chemrev.8b00803"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-017-1600-4"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3591270"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","unstructured":"D. Coppersmith. 2002. An approximate Fourier transform useful in quantum factoring. https:\/\/doi.org\/10.48550\/arXiv.quant-ph\/0201067 arxiv:quant-ph\/0201067. 10.48550\/arXiv.quant-ph\/0201067","DOI":"10.48550\/arXiv.quant-ph"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583131.3590477"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","unstructured":"Siwei Tan Debin Xiang. 2024. HornBro: Homotopy-like Method for Automated Quantum Program Repair. https:\/\/doi.org\/10.5281\/zenodo.14288140 10.5281\/zenodo.14288140","DOI":"10.5281\/zenodo.14288140"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.68.042318"},{"key":"e_1_2_1_19_1","series-title":"Series A: Mathematical and Physical Sciences, 439","volume-title":"Rapid solution of problems by quantum computation. Proceedings of the Royal Society of London","author":"Deutsch David","unstructured":"David Deutsch and Richard Jozsa. 1992. Rapid solution of problems by quantum computation. Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 439."},{"key":"e_1_2_1_20_1","unstructured":"IBM Quantum Devices. 2024. ibmq quito. https:\/\/quantum-computing.ibm.com\/services\/resources"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3611643.3616243"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3643667.3648223"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3387940.3391459"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377811.3380323"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3660773"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","unstructured":"Cupjin Huang Fang Zhang Michael Newman Junjie Cai Xun Gao Zhengxiong Tian Junyin Wu Haihong Xu Huanjun Yu and Bo Yuan. 2020. Classical simulation of quantum supremacy circuits. arXiv preprint arXiv:2005.06787 https:\/\/doi.org\/10.48550\/arXiv.2005.06787 10.48550\/arXiv.2005.06787","DOI":"10.48550\/arXiv.2005.06787"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3307650.3322213"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3213846.3213871"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2013.6606626"},{"key":"e_1_2_1_32_1","unstructured":"A. Yu. Kitaev. 1995. Quantum measurements and the Abelian Stabilizer Problem. arxiv:quant-ph\/9511026. arxiv:quant-ph\/9511026"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90039-6"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236024.3236079"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3428218"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3597503.3623334"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","unstructured":"Yuechen Li Hanyu Pei Linzhi Huang Beibei Yin and Kai-Yuan Cai. 2024. Automatic Repair of Quantum Programs via Unitary Operation. ACM Transactions on Software Engineering and Methodology (TOSEM) https:\/\/doi.org\/10.1145\/3664604 10.1145\/3664604","DOI":"10.1145\/3664604"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA51647.2021.00025"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/SANER53432.2022.00147"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3597503.3623332"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE48619.2023.00127"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02199356"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE48619.2023.00109"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196321.3196358"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00057"},{"key":"e_1_2_1_46_1","volume-title":"Chuang","author":"Nielsen Michael A.","year":"2011","unstructured":"Michael A. Nielsen and Isaac L. Chuang. 2011. Quantum Computation and Quantum Information: 10th Anniversary Edition (10th ed.). Cambridge University Press, USA. isbn:1107002176"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","unstructured":"Tianyi Peng Aram W Harrow Maris Ozols and Xiaodi Wu. 2020. Simulating large quantum circuits on a small quantum computer. Physical review letters 125 15 150504. https:\/\/doi.org\/10.1103\/PhysRevLett.125.150504 10.1103\/PhysRevLett.125.150504","DOI":"10.1103\/PhysRevLett.125.150504"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519939.3523713"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms5213"},{"key":"e_1_2_1_50_1","volume-title":"International Conference on Computer Aided Verification (CAV). Springer, 275\u2013293","author":"Robere Robert","year":"2018","unstructured":"Robert Robere, Antonina Kolokolova, and Vijay Ganesh. 2018. The proof complexity of SMT solvers. In International Conference on Computer Aided Verification (CAV). Springer, 275\u2013293."},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.855930"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3611643.3616341"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3643737"},{"key":"e_1_2_1_54_1","unstructured":"Stack Exchange Inc. 2023. Stack Overflow - Where Developers Learn Share & Build Careers. https:\/\/stackoverflow.com\/"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183895.3183901"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3620666.3651360"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519939.3523431"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.105.032440"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE51524.2021.9678798"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/3520304.3534067"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3510454.3516839"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2022-03-30-677"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3597503.3623337"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049706.2049708"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2003.04462"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/Q-SE52541.2021.00011"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE51524.2021.9678908"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.10.021067"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314584"}],"container-title":["Proceedings of the ACM on Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3715751","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T15:24:48Z","timestamp":1750346688000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3715751"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,19]]},"references-count":69,"journal-issue":{"issue":"FSE","published-print":{"date-parts":[[2025,6,19]]}},"alternative-id":["10.1145\/3715751"],"URL":"https:\/\/doi.org\/10.1145\/3715751","relation":{},"ISSN":["2994-970X"],"issn-type":[{"value":"2994-970X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,19]]}}}