{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T04:16:37Z","timestamp":1776312997499,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"15","license":[{"start":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T00:00:00Z","timestamp":1760486400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T00:00:00Z","timestamp":1760486400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"U.S. Department of Energy, United States","award":["DE-SC0023495"],"award-info":[{"award-number":["DE-SC0023495"]}]},{"name":"U.S. Department of Energy, United States","award":["DE-SC0023495"],"award-info":[{"award-number":["DE-SC0023495"]}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-SC0023707"],"award-info":[{"award-number":["DE-SC0023707"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-SC0023707"],"award-info":[{"award-number":["DE-SC0023707"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-025-07819-1","type":"journal-article","created":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T03:52:49Z","timestamp":1760500369000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Performance evaluations of signed and unsigned noisy approximate quantum Fourier arithmetic"],"prefix":"10.1007","volume":"81","author":[{"given":"Robert A. M.","family":"Basili","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenyang","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiplu","family":"Sarker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuo","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Austin","family":"Castellino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mary","family":"Eshaghian-Wilner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashfaq","family":"Khokhar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Glenn","family":"Luecke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James P.","family":"Vary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,15]]},"reference":[{"key":"7819_CR1","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/s0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor PW (1997) Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J Comput 26:1484\u20131509. https:\/\/doi.org\/10.1137\/s0097539795293172","journal-title":"SIAM J Comput"},{"key":"7819_CR2","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill J (2018) Quantum computing in the NISQ era and beyond. Quantum 2:79. https:\/\/doi.org\/10.22331\/q-2018-08-06-79","journal-title":"Quantum"},{"key":"7819_CR3","unstructured":"Kopczyk D (2018) Quantum machine learning for data scientists, http:\/\/arxiv.org\/abs\/1804.10068 [arXiv:quant-ph\/1804.10068]"},{"key":"7819_CR4","doi-asserted-by":"publisher","unstructured":"Chakrabarti A, Sur-Kolay S (2008) Designing quantum adder circuits and evaluating their error performance. In: Proceedings of the 2008 International Conference on Electronic Design, 1\u20136. https:\/\/doi.org\/10.1109\/ICED.2008.4786689","DOI":"10.1109\/ICED.2008.4786689"},{"key":"7819_CR5","doi-asserted-by":"publisher","unstructured":"Methachawalit W, Chongstitvatana P (2020) Adder Circuit on IBM Universal Quantum Computers. In: Proceedings of the 2020 17th International Conference on Electrical Engineering\/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON), 92\u201395. https:\/\/doi.org\/10.1109\/ECTI-CON49241.2020.9158064","DOI":"10.1109\/ECTI-CON49241.2020.9158064"},{"key":"7819_CR6","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/abae7d","volume":"5","author":"F Leymann","year":"2020","unstructured":"Leymann F, Barzen J (2020) The bitter truth about gate-based quantum algorithms in the NISQ era. Quantum Sci Technol 5:044007. https:\/\/doi.org\/10.1088\/2058-9565\/abae7d","journal-title":"Quantum Sci Technol"},{"key":"7819_CR7","doi-asserted-by":"publisher","unstructured":"Basili R, Qian W, Tang S, Castellino A, Eshaghian-Wilner M, Khokhar A, Luecke G, Vary JP (2022) Performance evaluations of noisy approximate quantum fourier arithmetic. In: Proceedings of the 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), 435\u2013444. https:\/\/doi.org\/10.1109\/IPDPSW55747.2022.00081","DOI":"10.1109\/IPDPSW55747.2022.00081"},{"key":"7819_CR8","unstructured":"Draper TG (2000) Addition on a quantum computer. arXiv preprint quant-ph\/0008033"},{"key":"7819_CR9","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/128\/1\/012013","volume":"128","author":"JJ \u00c1lvarez-S\u00e1nchez","year":"2008","unstructured":"\u00c1lvarez-S\u00e1nchez JJ, \u00c1lvarez-Bravo JV, Nieto LM (2008) A quantum architecture for multiplying signed integers. J Phys Conf Series 128:012013. https:\/\/doi.org\/10.1088\/1742-6596\/128\/1\/012013","journal-title":"J Phys Conf Series"},{"key":"7819_CR10","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/s11128-017-1603-1","volume":"16","author":"L Ruiz-Perez","year":"2017","unstructured":"Ruiz-Perez L, Garcia-Escartin JC (2017) Quantum arithmetic with the quantum Fourier transform. Quantum Inf Process 16:152","journal-title":"Quantum Inf Process"},{"key":"7819_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-016-1455-0","volume":"16","author":"HMH Babu","year":"2017","unstructured":"Babu HMH (2017) Cost-efficient design of a quantum multiplier-accumulator unit. Quantum Inf Process 16:1\u201338","journal-title":"Quantum Inf Process"},{"key":"7819_CR12","doi-asserted-by":"publisher","unstructured":"\u015fahin, E (2020) Quantum arithmetic operations based on quantum Fourier transform on signed integers. Int J Quantum Inf 18, 2050035. https:\/\/doi.org\/10.1142\/s0219749920500355","DOI":"10.1142\/s0219749920500355"},{"key":"7819_CR13","unstructured":"Kurt M, Kaltehei A, Kuzu A, Gencen A, Cakmak S (2023) QFT based quantum arithmetic logic unit on IBM quantum computer. http:\/\/arxiv.org\/abs\/2306.09560 [arXiv:quant-ph\/2306.09560]"},{"key":"7819_CR14","unstructured":"Kurt M, Kaltehei A, Gen\u00e7ten A, \u00c7akmak S (2024) Scalable quantum circuit design for QFT-based arithmetic. http:\/\/arxiv.org\/abs\/2411.00260 [arXiv:quant-ph\/2411.00260]"},{"key":"7819_CR15","doi-asserted-by":"crossref","unstructured":"Yuan Y, Wang C, Wang B, Chen ZY, Dou MH, Wu YC, Guo GP (2023) An improved QFT-based quantum comparator and extended modular arithmetic using one ancilla qubit. http:\/\/arxiv.org\/abs\/2305.09106 [arXiv:quant-ph\/2305.09106]","DOI":"10.1088\/1367-2630\/acfd52"},{"key":"7819_CR16","unstructured":"Crimmins AL (2023) Efficient quantum integer multiplication in the quantum Fourier transform domain. Master\u2019s thesis, Wright State University"},{"key":"7819_CR17","doi-asserted-by":"publisher","unstructured":"Ramezani M, Nikaeen M, Farman F, Ashrafi SM, Bahrampour A (2023) Quantum multiplication algorithm based on the convolution theorem. Phys Rev A, 108, 052405, http:\/\/arxiv.org\/abs\/2306.08473 [arXiv:quant-ph\/2306.08473]. https:\/\/doi.org\/10.1103\/PhysRevA.108.052405","DOI":"10.1103\/PhysRevA.108.052405"},{"key":"7819_CR18","unstructured":"Wang S, Li X, Lee WJB, Deb S, Lim E, Chattopadhyay A (2024) A comprehensive study of quantum arithmetic circuits. http:\/\/arxiv.org\/abs\/2406.03867 [arXiv:quant-ph\/2406.03867]"},{"key":"7819_CR19","unstructured":"Chen ZY, Song CQ, Zhou YC, Wen JM (2024) Quantum arithmetic based on quantum signal processing. http:\/\/arxiv.org\/abs\/2403.18761 [arXiv:quant-ph\/2403.18761]"},{"key":"7819_CR20","doi-asserted-by":"crossref","unstructured":"Joshi A, Chandarana P, Katragadda C, Tejeswini VP, Vallam RD, Manjrekar M (2023) Quantum circuit optimization of arithmetic circuits using ZX calculus. http:\/\/arxiv.org\/abs\/2306.02264 [arXiv:cs.ET\/2306.02264]","DOI":"10.21203\/rs.3.rs-3052769\/v1"},{"key":"7819_CR21","unstructured":"Wang S, Deb S, Mondal A, Chattopadhyay A (2024) Optimal toffoli-depth quantum adder. http:\/\/arxiv.org\/abs\/2405.02523 [arXiv:quant-ph\/2405.02523]"},{"key":"7819_CR22","doi-asserted-by":"publisher","first-page":"12372","DOI":"10.1038\/s41598-022-16179-w","volume":"12","author":"HTA Babu","year":"2022","unstructured":"Babu HTA, Kumar RS (2022) A higher radix architecture for quantum carry-lookahead adder. Sci Rep 12:12372. https:\/\/doi.org\/10.1038\/s41598-022-16179-w","journal-title":"Sci Rep"},{"key":"7819_CR23","doi-asserted-by":"publisher","unstructured":"Gidney C (2018) Halving the cost of quantum addition. Quantum 2: 74. http:\/\/arxiv.org\/abs\/1709.06648 [arXiv:quant-ph\/1709.06648]. https:\/\/doi.org\/10.22331\/q-2018-06-18-74","DOI":"10.22331\/q-2018-06-18-74"},{"key":"7819_CR24","doi-asserted-by":"publisher","unstructured":"Wang S, Lim E, Chattopadhyay A (2024) Boosting the efficiency of quantum divider through effective design space exploration. In: Proceedings of the 2024 IEEE International Symposium on Circuits and Systems (ISCAS). IEEE, 1\u20135, http:\/\/arxiv.org\/abs\/2403.01206 [arXiv:quant-ph\/2403.01206]. https:\/\/doi.org\/10.1109\/ISCAS57851.2024.10590686","DOI":"10.1109\/ISCAS57851.2024.10590686"},{"key":"7819_CR25","unstructured":"Gidney C (2024) Fast quantum integer multiplication with zero ancillas, http:\/\/arxiv.org\/abs\/2403.18006 [arXiv:quant-ph\/2403.18006]"},{"key":"7819_CR26","unstructured":"Zhan J (2023) Quantum multiplier based on exponent adder. http:\/\/arxiv.org\/abs\/2309.10204 [arXiv:quant-ph\/2309.10204]"},{"key":"7819_CR27","doi-asserted-by":"publisher","DOI":"10.1002\/que2.16","volume":"1","author":"GC Cao","year":"2019","unstructured":"Cao GC, Liu BZ, Zhang WW, Zhang JY, Zhang R (2019) Designs of the divider and special multiplier optimizing t and CNOT gates. Quantum Eng 1:e16. https:\/\/doi.org\/10.1002\/que2.16","journal-title":"Quantum Eng"},{"key":"7819_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/s11433-021-1838-8","volume":"65","author":"ZX Yang","year":"2022","unstructured":"Yang ZX, Zhou R, Wang ZP, Xu K, Sun XH (2022) The circuit design and optimization of quantum multiplier and divider. Sci China Phys Mech Astronomy 65:260311. https:\/\/doi.org\/10.1007\/s11433-021-1838-8","journal-title":"Sci China Phys Mech Astronomy"},{"key":"7819_CR29","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.102.042417","volume":"102","author":"\u00c9 Gouzien","year":"2020","unstructured":"Gouzien \u00c9, Saeedi M (2020) Improving the number of t gates and their spread in integer multipliers on quantum computing. Phys Rev A 102:042417. https:\/\/doi.org\/10.1103\/PhysRevA.102.042417","journal-title":"Phys Rev A"},{"key":"7819_CR30","unstructured":"Luongo A, Narasimhachar V, Sireesh A (2025) Optimized circuits for windowed modular arithmetic with applications to quantum attacks against RSA. http:\/\/arxiv.org\/abs\/2502.17325 [arXiv:quant-ph\/2502.17325]"},{"key":"7819_CR31","first-page":"2250211","volume":"38","author":"SY Ao","year":"2023","unstructured":"Ao SY, Yang MZ, Wang HL (2023) The implementation of the enhanced quantum floating-point adder. Mod Phys Lett A 38:2250211","journal-title":"Mod Phys Lett A"},{"key":"7819_CR32","doi-asserted-by":"publisher","unstructured":"H\u00e4ner T, Roetteler M, Svore KM (2018) Quantum circuits for floating-point arithmetic. In: Proceedings of the Reversible Computation: 10th International Conference, RC 2018, Leicester, UK, September 13-14, 2018, Proceedings 10. Springer, 33\u201347. http:\/\/arxiv.org\/abs\/1807.02023 [arXiv:quant-ph\/1807.02023]. https:\/\/doi.org\/10.1007\/978-3-319-99498-7_3","DOI":"10.1007\/978-3-319-99498-7_3"},{"key":"7819_CR33","unstructured":"Li J (2024) A feasible design of elementary quantum arithmetic logic units for near-term quantum computers. http:\/\/arxiv.org\/abs\/2408.06561 [arXiv:quant-ph\/2408.06561]"},{"key":"7819_CR34","unstructured":"Fillinger M (2013) Data structures in classical and quantum computing. http:\/\/arxiv.org\/abs\/1308.0833 [arXiv:quant-ph\/1308.0833]"},{"key":"7819_CR35","unstructured":"Cross A (2018) The ibm q experience and qiskit open-source quantum computing software. In: Proceedings of the APS march meeting abstracts 2018:L58"},{"key":"7819_CR36","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1103\/physreva.54.139","volume":"54","author":"A Barenco","year":"1996","unstructured":"Barenco A, Ekert A, Suominen KA, T\u00f6rm\u00e4 P (1996) Approximate quantum Fourier transform and decoherence. Phys Rev A 54:139\u2013146. https:\/\/doi.org\/10.1103\/physreva.54.139","journal-title":"Phys Rev A"},{"key":"7819_CR37","doi-asserted-by":"crossref","unstructured":"Murali P, Linke NM, Martonosi M, Abhari AJ, Nguyen NH, Alderete CH (2019) Full-stack real-system quantum computer studies: Architectural comparisons and design insights. In: Proceedings of the 2019 ACM\/IEEE 46th Annual International Symposium on Computer Architecture (ISCA). IEEE, 527\u2013540","DOI":"10.1145\/3307650.3322273"},{"key":"7819_CR38","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.1109\/tcad.2005.855930","volume":"25","author":"V Shende","year":"2006","unstructured":"Shende V, Bullock S, Markov I (2006) Synthesis of quantum-logic circuits. IEEE Trans Comput Aided Des Integr Circuits Syst 25:1000. https:\/\/doi.org\/10.1109\/tcad.2005.855930","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"key":"7819_CR39","doi-asserted-by":"publisher","first-page":"2315","DOI":"10.1080\/09500349414552171","volume":"41","author":"R Jozsa","year":"1994","unstructured":"Jozsa R (1994) Fidelity for mixed quantum states. J Mod Opt 41:2315\u20132323","journal-title":"J Mod Opt"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07819-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-07819-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07819-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T06:52:47Z","timestamp":1762152767000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-07819-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,15]]},"references-count":39,"journal-issue":{"issue":"15","published-online":{"date-parts":[[2025,10]]}},"alternative-id":["7819"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-07819-1","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,15]]},"assertion":[{"value":"28 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2025","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The following funding-information was missing in the funding section of the published article \u2018NSF Grant No. 2435255 (NQVL-QSTD: Q-BLUE)\u2019. The original article has been corrected.","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Author Robert Basili is a guest editor on this special issue. The Editor in Chief managed the peer review of the paper. Author Robert Basili was not involved in the journal\u2019s review of, or decisions related to, this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"1465"}}