{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T12:03:46Z","timestamp":1766232226957,"version":"3.48.0"},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"1","funder":[{"name":"National Science Foundation","award":["2416606"],"award-info":[{"award-number":["2416606"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Quantum Comput."],"published-print":{"date-parts":[[2026,3,31]]},"abstract":"<jats:p>Quantum computing has the potential to revolutionize fields like quantum optimization and quantum machine learning. However, current quantum devices are hindered by noise, reducing their reliability. A key challenge in gate-based quantum computing is improving the reliability of quantum circuits, measured by process fidelity, during the transpilation process, particularly in the routing stage. In this article, we address the Fidelity Maximization in Routing Stage (FMRS) problem by introducing FIDDLE, a novel learning framework comprising two modules: a Gaussian Process-based surrogate model to estimate process fidelity with limited training samples and a reinforcement learning module to optimize routing. Our approach is the first to directly maximize process fidelity, outperforming traditional methods that rely on indirect metrics such as circuit depth or gate count. We rigorously evaluate FIDDLE by comparing it with state-of-the-art fidelity estimation techniques and routing optimization methods. The results demonstrate that our proposed surrogate model is able to provide a better estimation on the process fidelity compared to existing learning techniques, and our end-to-end framework significantly improves the process fidelity of quantum circuits across various noise models.<\/jats:p>","DOI":"10.1145\/3773909","type":"journal-article","created":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T11:20:34Z","timestamp":1761736834000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["FIDDLE: Reinforcement Learning for Quantum Fidelity Enhancement"],"prefix":"10.1145","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-9647-7011","authenticated-orcid":false,"given":"Hoang M.","family":"Ngo","sequence":"first","affiliation":[{"name":"Computer and Information Science and Engineering, University of Florida","place":["Gainesville, United States"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4403-8612","authenticated-orcid":false,"given":"Tamer","family":"Kahveci","sequence":"additional","affiliation":[{"name":"Computer and Information Sciences and Engineering, University of Florida","place":["Gainesville, United States"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0503-2012","authenticated-orcid":false,"given":"My T.","family":"Thai","sequence":"additional","affiliation":[{"name":"Computer and Information Sciences and Engineering, University of Florida","place":["Gainesville, United States"]}]}],"member":"320","published-online":{"date-parts":[[2025,12,20]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/3700885"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO50266.2020.00029"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.2562111"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3411466"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/2448\/1\/012014"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2022.3172241"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature23474"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms1147"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3489517.3530403"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","unstructured":"Edward Farhi Jeffrey Goldstone and Sam Gutmann. 2014. A quantum approximate optimization algorithm. DOI:10.48550\/ARXIV.1411.4028","DOI":"10.48550\/ARXIV.1411.4028"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.106.230501"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/QCE57702.2023.00042"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.105.150401"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.76.030305"},{"key":"e_1_3_1_16_2","article-title":"Quantum machine learning beyond kernel methods","author":"Jerbi Sofi\u00e8ne","year":"2021","unstructured":"Sofi\u00e8ne Jerbi, Lukas J. Fiderer, Hendrik Poulsen Nautrup, Jonas M. K\u00fcbler, Hans J. Briegel, and Vedran Dunjko. 2021. Quantum machine learning beyond kernel methods. Nature Communications 14, 1 (2021). Retrieved from https:\/\/api.semanticscholar.org\/CorpusID:239885740","journal-title":"Nature Communications"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3467982"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/TQE.2023.3303989"},{"key":"e_1_3_1_19_2","first-page":"18182","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","volume":"34","author":"Ostaszewski Mateusz","year":"2021","unstructured":"Mateusz Ostaszewski, Lea M. Trenkwalder, Wojciech Masarczyk, Eleanor Scerri, and Vedran Dunjko. 2021. Reinforcement learning for optimization of variational quantum circuit architectures. In Proceedings of the Advances in Neural Information Processing Systems, M. Ranzato, A. Beygelzimer, Y. Dauphin, P. S. Liang, and J. Wortman Vaughan (Eds.). Vol. 34, Curran Associates, Inc., 18182\u201318194. Retrieved from https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2021\/file\/9724412729185d53a2e3e7f889d9f057-Paper.pdf"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3520434"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2018-08-06-79"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/LCA.2020.3045628"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2023.3340608"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.122.040504"},{"key":"e_1_3_1_25_2","first-page":"1015","volume-title":"Proceedings of the 27th International Conference on International Conference on Machine Learning","author":"Srinivas Niranjan","year":"2010","unstructured":"Niranjan Srinivas, Andreas Krause, Sham Kakade, and Matthias Seeger. 2010. Gaussian process optimization in the bandit setting: No regret and experimental design. In Proceedings of the 27th International Conference on International Conference on Machine Learning (Haifa, Israel). Omnipress, Madison, WI, USA, 1015\u20131022."},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-022-33335-4"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.74.020301"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3203985"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181970"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.12328"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.127.130503"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2019.2935152"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2018.8342181"}],"container-title":["ACM Transactions on Quantum Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3773909","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T11:59:04Z","timestamp":1766231944000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3773909"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,20]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3,31]]}},"alternative-id":["10.1145\/3773909"],"URL":"https:\/\/doi.org\/10.1145\/3773909","relation":{},"ISSN":["2643-6809","2643-6817"],"issn-type":[{"type":"print","value":"2643-6809"},{"type":"electronic","value":"2643-6817"}],"subject":[],"published":{"date-parts":[[2025,12,20]]},"assertion":[{"value":"2025-03-21","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-10-15","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-12-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}