{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T11:20:39Z","timestamp":1764415239631,"version":"3.46.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T00:00:00Z","timestamp":1762128000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T00:00:00Z","timestamp":1762128000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China,China","doi-asserted-by":"crossref","award":["62202017"],"award-info":[{"award-number":["62202017"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-025-04968-3","type":"journal-article","created":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T05:51:43Z","timestamp":1762149103000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Construction and optimization of quantum modular exponentiation circuits based on the V gate"],"prefix":"10.1007","volume":"24","author":[{"given":"Xinglan","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaojun","family":"Rong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,3]]},"reference":[{"issue":"6","key":"4968_CR1","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF02650179","volume":"21","author":"RP Feynman","year":"1982","unstructured":"Feynman, R.P.: Simulating physics with computers. Int. J. Theor. Phys. 21(6), 467\u2013488 (1982). https:\/\/doi.org\/10.1007\/BF02650179","journal-title":"Int. J. Theor. Phys."},{"issue":"1907","key":"4968_CR2","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1098\/rspa.1992.0167","volume":"439","author":"D Deutsch","year":"1992","unstructured":"Deutsch, D., Jozsa, R.: Rapid solution of problems by quantum computation. Proc. R. Soc. Lond. A 439(1907), 553\u2013558 (1992). https:\/\/doi.org\/10.1098\/rspa.1992.0167","journal-title":"Proc. R. Soc. Lond. A"},{"key":"4968_CR3","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134 (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"key":"4968_CR4","doi-asserted-by":"publisher","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, pp. 212\u2013219 (1996). https:\/\/doi.org\/10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"issue":"15","key":"4968_CR5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.103.150502","volume":"103","author":"AW Harrow","year":"2009","unstructured":"Harrow, A.W., Hassidim, A., Lloyd, S.: Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 103(15), 150502 (2009). https:\/\/doi.org\/10.1103\/PhysRevLett.103.150502","journal-title":"Phys. Rev. Lett."},{"issue":"6","key":"4968_CR6","doi-asserted-by":"publisher","DOI":"10.7566\/JPSJ.88.061005","volume":"88","author":"M Ohzeki","year":"2019","unstructured":"Ohzeki, M.: Message-passing algorithm of quantum annealing with nonstoquastic Hamiltonian. J. Phys. Soc. Jpn. 88(6), 061005 (2019). https:\/\/doi.org\/10.7566\/JPSJ.88.061005","journal-title":"J. Phys. Soc. Jpn."},{"issue":"9","key":"4968_CR7","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1038\/nphys3029","volume":"10","author":"S Lloyd","year":"2014","unstructured":"Lloyd, S., Mohseni, M., Rebentrost, P.: Quantum principal component analysis. Nat. Phys. 10(9), 631\u2013633 (2014). https:\/\/doi.org\/10.1038\/nphys3029","journal-title":"Nat. Phys."},{"key":"4968_CR8","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/s11036-019-01410-8","volume":"26","author":"Z Guofeng","year":"2021","unstructured":"Guofeng, Z., Hamdulla, A.: Adaptive morphological contrast enhancement based on quantum genetic algorithm for point target detection. Mobile Netw. Appl. 26, 638\u2013648 (2021). https:\/\/doi.org\/10.1007\/s11036-019-01410-8","journal-title":"Mobile Netw. Appl."},{"issue":"1","key":"4968_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1103\/PhysRevA.54.147","volume":"54","author":"V Vedral","year":"1996","unstructured":"Vedral, V., Barenco, A., Ekert, A.: Quantum networks for elementary arithmetic operations. Phys. Rev. A 54(1), 147 (1996). https:\/\/doi.org\/10.1103\/PhysRevA.54.147","journal-title":"Phys. Rev. A"},{"key":"4968_CR10","doi-asserted-by":"publisher","unstructured":"Larasati, H.T., Kim, H.: Simulation of modular exponentiation circuit for shor\u2019s algorithm in qiskit. In: 2020 14th International Conference on Telecommunication Systems, Services, and Applications (TSSA), pp. 1\u20137 (2020). https:\/\/doi.org\/10.1109\/TSSA51342.2020.9310794","DOI":"10.1109\/TSSA51342.2020.9310794"},{"issue":"5","key":"4968_CR11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.71.052320","volume":"71","author":"R Van Meter","year":"2005","unstructured":"Van Meter, R., Itoh, K.M.: Fast quantum modular exponentiation. Phys. Rev. A-Atomic Mol. Opt. Phys. 71(5), 052320 (2005). https:\/\/doi.org\/10.1103\/PhysRevA.71.052320","journal-title":"Phys. Rev. A-Atomic Mol. Opt. Phys."},{"key":"4968_CR12","doi-asserted-by":"publisher","unstructured":"H\u00e4ner, T., Roetteler, M., Svore, K.M.: Factoring using 2n+ 2 qubits with toffoli based modular multiplication (2017). https:\/\/doi.org\/10.48550\/arXiv.1611.07995","DOI":"10.48550\/arXiv.1611.07995"},{"key":"4968_CR13","doi-asserted-by":"publisher","unstructured":"Markov, I.L., Saeedi, M.: Constant-optimized quantum circuits for modular multiplication and exponentiation (2012). https:\/\/doi.org\/10.48550\/arXiv.1202.6614","DOI":"10.48550\/arXiv.1202.6614"},{"key":"4968_CR14","doi-asserted-by":"publisher","unstructured":"Liu, X., Yang, H., Yang, L.: Cnot-count optimized quantum circuit of the Shor\u2019s algorithm (2021). https:\/\/doi.org\/10.48550\/arXiv.2112.11358","DOI":"10.48550\/arXiv.2112.11358"},{"key":"4968_CR15","doi-asserted-by":"publisher","unstructured":"Draper, T.G.: Addition on a quantum computer (2000). https:\/\/doi.org\/10.48550\/arXiv.quant-ph\/0008033","DOI":"10.48550\/arXiv.quant-ph\/0008033"},{"key":"4968_CR16","doi-asserted-by":"publisher","unstructured":"Beauregard, S.: Circuit for shor\u2019s algorithm using 2n+ 3 qubits (2002). https:\/\/doi.org\/10.48550\/arXiv.quant-ph\/0205095","DOI":"10.48550\/arXiv.quant-ph\/0205095"},{"issue":"1","key":"4968_CR17","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, K.-A., T\u00f6rm\u00e4, P.: Approximate quantum Fourier transform and decoherence. Phys. Rev. A 54(1), 139 (1996). https:\/\/doi.org\/10.1103\/PhysRevA.54.139","journal-title":"Phys. Rev. A"},{"issue":"2","key":"4968_CR18","doi-asserted-by":"publisher","first-page":"184","DOI":"10.26421\/QIC6.2-4","volume":"6","author":"Y Takahashi","year":"2006","unstructured":"Takahashi, Y., Kunihiro, N.: A quantum circuit for shor\u2019s factoring algorithm using 2n+ 2 qubits. Quantum Inform. Comput. 6(2), 184\u2013192 (2006). https:\/\/doi.org\/10.26421\/QIC6.2-4","journal-title":"Quantum Inform. Comput."},{"key":"4968_CR19","doi-asserted-by":"publisher","unstructured":"Pavlidis, A., Gizopoulos, D.: Fast quantum modular exponentiation architecture for shor\u2019s factorization algorithm (2012). https:\/\/doi.org\/10.48550\/arXiv.1207.0511","DOI":"10.48550\/arXiv.1207.0511"},{"issue":"11","key":"4968_CR20","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/s11128-023-04159-y","volume":"22","author":"S Xiuli","year":"2023","unstructured":"Xiuli, S., Liangsen, W.: An improved circuit for Shor\u2019s factoring algorithm using 2 n+ 2 qubits. Quantum Inf. Process. 22(11), 402 (2023). https:\/\/doi.org\/10.1007\/s11128-023-04159-y","journal-title":"Quantum Inf. Process."},{"issue":"10","key":"4968_CR21","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/acfd52","volume":"25","author":"Y Yuan","year":"2023","unstructured":"Yuan, Y., Wang, C., Wang, B., Chen, Z.-Y., Dou, M.-H., Wu, Y.-C., Guo, G.-P.: An improved Qft-based quantum comparator and extended modular arithmetic using one ancilla qubit. New J. Phys. 25(10), 103011 (2023). https:\/\/doi.org\/10.1088\/1367-2630\/acfd52","journal-title":"New J. Phys."},{"issue":"1","key":"4968_CR22","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/s10773-023-05532-4","volume":"63","author":"J Tom\u010dala","year":"2024","unstructured":"Tom\u010dala, J.: On the various ways of quantum implementation of the modular exponentiation function for Shor\u2019s factorization. Int. J. Theor. Phys. 63(1), 14 (2024). https:\/\/doi.org\/10.1007\/s10773-023-05532-4","journal-title":"Int. J. Theor. Phys."},{"key":"4968_CR23","doi-asserted-by":"publisher","unstructured":"Kahanamoku-Meyer, G.D., Yao, N.Y.: Fast quantum integer multiplication with zero ancillas (2024). https:\/\/doi.org\/10.48550\/arXiv.2403.18006","DOI":"10.48550\/arXiv.2403.18006"},{"key":"4968_CR24","doi-asserted-by":"publisher","unstructured":"Luongo, A., Narasimhachar, V., Sireesh, A.: Optimized circuits for windowed modular arithmetic with applications to quantum attacks against RSA (2025). https:\/\/doi.org\/10.48550\/arXiv.2502.17325","DOI":"10.48550\/arXiv.2502.17325"},{"key":"4968_CR25","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.: Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018). https:\/\/doi.org\/10.22331\/q-2018-08-06-79","journal-title":"Quantum"},{"issue":"4","key":"4968_CR26","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.107.042621","volume":"107","author":"F Orts","year":"2023","unstructured":"Orts, F., Filatovas, E., Ortega, G., SanJuan-Estrada, J., Garz\u00f3n, E.: Improving the number of t gates and their spread in integer multipliers on quantum computing. Phys. Rev. A 107(4), 042621 (2023). https:\/\/doi.org\/10.1103\/PhysRevA.107.042621","journal-title":"Phys. Rev. A"},{"issue":"3","key":"4968_CR27","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1109\/TCAD.2007.911334","volume":"27","author":"D Maslov","year":"2008","unstructured":"Maslov, D., Dueck, G.W., Miller, D.M., Negrevergne, C.: Quantum circuit simplification and level compaction. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(3), 436\u2013444 (2008). https:\/\/doi.org\/10.1109\/TCAD.2007.911334","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"4968_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2020.102810","volume":"170","author":"F Orts","year":"2020","unstructured":"Orts, F., Ortega, G., Combarro, E.F., Garz\u00f3n, E.M.: A review on reversible quantum adders. J. Netw. Comput. Appl. 170, 102810 (2020). https:\/\/doi.org\/10.1016\/j.jnca.2020.102810","journal-title":"J. Netw. Comput. Appl."},{"issue":"22","key":"4968_CR29","doi-asserted-by":"publisher","first-page":"5188","DOI":"10.1103\/PhysRevLett.86.5188","volume":"86","author":"R Raussendorf","year":"2001","unstructured":"Raussendorf, R., Briegel, H.J.: A one-way quantum computer. Phys. Rev. Lett. 86(22), 5188 (2001). https:\/\/doi.org\/10.1103\/PhysRevLett.86.5188","journal-title":"Phys. Rev. Lett."},{"key":"4968_CR30","doi-asserted-by":"publisher","first-page":"74","DOI":"10.22331\/q-2018-06-18-74","volume":"2","author":"C Gidney","year":"2018","unstructured":"Gidney, C.: Halving the cost of quantum addition. Quantum 2, 74 (2018). https:\/\/doi.org\/10.22331\/q-2018-06-18-74","journal-title":"Quantum"},{"issue":"4","key":"4968_CR31","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.13.041057","volume":"13","author":"M DeCross","year":"2023","unstructured":"DeCross, M., Chertkov, E., Kohagen, M., Foss-Feig, M.: Qubit-reuse compilation with mid-circuit measurement and reset. Phys. Rev. X 13(4), 041057 (2023). https:\/\/doi.org\/10.1103\/PhysRevX.13.041057","journal-title":"Phys. Rev. X"},{"issue":"2","key":"4968_CR32","doi-asserted-by":"publisher","first-page":"391","DOI":"10.22061\/jecei.2023.9374.613","volume":"11","author":"E Nikahd","year":"2023","unstructured":"Nikahd, E., Houshmand, M.: 1wqc pattern scheduling to minimize the number of physical qubits. J. Electric. Comput. Eng. Innov. (JECEI) 11(2), 391\u2013398 (2023). https:\/\/doi.org\/10.22061\/jecei.2023.9374.613","journal-title":"J. Electric. Comput. Eng. Innov. (JECEI)"},{"key":"4968_CR33","doi-asserted-by":"publisher","unstructured":"Luongo, A., Miti, A.M., Narasimhachar, V., Sireesh, A.: Measurement-based uncomputation of quantum circuits for modular arithmetic (2024). https:\/\/doi.org\/10.48550\/arXiv.2407.20167","DOI":"10.48550\/arXiv.2407.20167"},{"issue":"9","key":"4968_CR34","doi-asserted-by":"publisher","first-page":"1759","DOI":"10.1109\/TVLSI.2024.3418930","volume":"32","author":"B Gaur","year":"2024","unstructured":"Gaur, B., Thapliyal, H.: Novel optimized designs of modulo $$2^{n}+1$$ adder for quantum computing. IEEE Trans. Very Large Scale Integr. VLSI Syst. 32(9), 1759\u20131763 (2024). https:\/\/doi.org\/10.1109\/TVLSI.2024.3418930","journal-title":"IEEE Trans. Very Large Scale Integr. VLSI Syst."},{"key":"4968_CR35","doi-asserted-by":"publisher","unstructured":"Treinish, M., Gambetta, J., Thomas, S., qiskit-bot, Nation, P., Kassebaum, P., Arellano, E., Rodr\u00edguez, D.M., Puente\u00a0Gonz\u00e1lez, S., Bello, L., Lishman, J., Hu, S., Garrison, J., Huang, J., Krsulich, K., Yu, J., Gacon, J., Marques, M., McKay, D., Gomez, J., Capelluto, L., Wood, S., Travis-S-IBM, Mitchell, A., Panigrahi, A., Hartman, K., lerongil, Rahman, R.I., Itoko, T., Pozas-Kerstjens, A.: Qiskit\/qiskitmetapackage: Qiskit 0.43.2. https:\/\/doi.org\/10.5281\/zenodo.8090426","DOI":"10.5281\/zenodo.8090426"},{"key":"4968_CR36","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s11128-009-0106-0","volume":"8","author":"M Mohammadi","year":"2009","unstructured":"Mohammadi, M., Eshghi, M.: On figures of merit in reversible and quantum logic designs. Quantum Inf. Process. 8, 297\u2013318 (2009). https:\/\/doi.org\/10.1007\/s11128-009-0106-0","journal-title":"Quantum Inf. Process."},{"key":"4968_CR37","doi-asserted-by":"publisher","unstructured":"Thapliyal, H.: In: Gavrilova, M.L., Tan, C.J.K. (eds.) Mapping of Subtractor and Adder-Subtractor Circuits on Reversible Quantum Gates, pp. 10\u201334. Springer, Berlin, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-50412-3_2","DOI":"10.1007\/978-3-662-50412-3_2"},{"issue":"9","key":"4968_CR38","doi-asserted-by":"publisher","first-page":"1652","DOI":"10.1109\/TCAD.2005.858352","volume":"25","author":"WN Hung","year":"2006","unstructured":"Hung, W.N., Song, X., Yang, G., Yang, J., Perkowski, M.: Optimal synthesis of multiple output Boolean functions using a set of quantum gates by symbolic reachability analysis. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25(9), 1652\u20131663 (2006). https:\/\/doi.org\/10.1109\/TCAD.2005.858352","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"6","key":"4968_CR39","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.88.062310","volume":"88","author":"Y Nam","year":"2013","unstructured":"Nam, Y., Bl\u00fcmel, R.: Robustness and performance scaling of a quantum computer with respect to a class of static defects. Phys. Rev. A-Atomic Mol. Opt. Phys. 88(6), 062310 (2013). https:\/\/doi.org\/10.1103\/PhysRevA.88.062310","journal-title":"Phys. Rev. A-Atomic Mol. Opt. Phys."},{"issue":"3","key":"4968_CR40","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.87.032333","volume":"87","author":"Y Nam","year":"2013","unstructured":"Nam, Y., Bl\u00fcmel, R.: Scaling laws for Shor\u2019s algorithm with a banded quantum Fourier transform. Phys. Rev. A-Atomic Mol. Opt. Phys. 87(3), 032333 (2013). https:\/\/doi.org\/10.1103\/PhysRevA.87.032333","journal-title":"Phys. Rev. A-Atomic Mol. Opt. Phys."},{"issue":"9","key":"4968_CR41","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1038\/s42254-021-00348-9","volume":"3","author":"M Cerezo","year":"2021","unstructured":"Cerezo, M., Arrasmith, A., Babbush, R., Benjamin, S.C., Endo, S., Fujii, K., McClean, J.R., Mitarai, K., Yuan, X., Cincio, L., et al.: Variational quantum algorithms. Nat. Rev. Phys. 3(9), 625\u2013644 (2021). https:\/\/doi.org\/10.1038\/s42254-021-00348-9","journal-title":"Nat. Rev. Phys."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-04968-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-025-04968-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-04968-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T11:17:48Z","timestamp":1764415068000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-025-04968-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,3]]},"references-count":41,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2025,11]]}},"alternative-id":["4968"],"URL":"https:\/\/doi.org\/10.1007\/s11128-025-04968-3","relation":{},"ISSN":["1573-1332"],"issn-type":[{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2025,11,3]]},"assertion":[{"value":"13 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"357"}}