{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T15:55:34Z","timestamp":1764431734584,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T00:00:00Z","timestamp":1699228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T00:00:00Z","timestamp":1699228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100015218","name":"Henan Key Laboratory of Non-ferrous Metal Materials Science and Processing Technology","doi-asserted-by":"publisher","award":["LNCT2022-A15"],"award-info":[{"award-number":["LNCT2022-A15"]}],"id":[{"id":"10.13039\/501100015218","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-023-04159-y","type":"journal-article","created":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T08:01:53Z","timestamp":1699257713000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An improved circuit for Shor\u2019s factoring algorithm using $$2n+2$$ qubits"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2387-2074","authenticated-orcid":false,"given":"Song","family":"Xiuli","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0004-6494-9968","authenticated-orcid":false,"given":"Wen","family":"Liangsen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,6]]},"reference":[{"issue":"7 &8","key":"4159_CR1","doi-asserted-by":"publisher","first-page":"673","DOI":"10.26421\/QIC17.7-8-7","volume":"17","author":"T Haner","year":"2017","unstructured":"Haner, T., Roetteler, M., Svore, K.M.: Factoring using 2n+2 qubits with Toffoli based modular multiplication. Quantum Inf. Comput. 17(7 &8), 673\u2013684 (2017). https:\/\/doi.org\/10.26421\/QIC17.7-8-7","journal-title":"Quantum Inf. Comput."},{"issue":"6","key":"4159_CR2","doi-asserted-by":"publisher","first-page":"440","DOI":"10.26421\/QIC5.6-2","volume":"5","author":"Y Takahashi","year":"2005","unstructured":"Takahashi, Y., Kunihiro, N.: A quantum circuit for Shors factoring algorithm using 2n+2 qubits. Quantum Inf. Comput. 5(6), 440\u2013448 (2005). https:\/\/doi.org\/10.26421\/QIC5.6-2","journal-title":"Quantum Inf. Comput."},{"key":"4159_CR3","doi-asserted-by":"publisher","DOI":"10.11896\/jsjkx.210600149","author":"J Liu","year":"2022","unstructured":"Liu, J., Wang, H., Ma, Z.: Optimization for Shors integer factorization algorithm circuit. Comput. Sci. (2022). https:\/\/doi.org\/10.11896\/jsjkx.210600149","journal-title":"Comput. Sci."},{"key":"4159_CR4","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.quant-ph\/0410184","author":"SA Cuccaro","year":"2004","unstructured":"Cuccaro, S.A., Draper, T.G., Moulton, D.P., Kutin, S.A.: A new quantum ripple-carry addition circuit. Quantum Phys. (2004). https:\/\/doi.org\/10.48550\/arXiv.quant-ph\/0410184","journal-title":"Quantum Phys."},{"issue":"2","key":"4159_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.26421\/QIC3.2-9","volume":"3","author":"S Beauregard","year":"2003","unstructured":"Beauregard, S.: Circuit for Shors algorithm using 2n+3 qubits. Quantum Inf. Comput. 3(2), 175\u2013185 (2003). https:\/\/doi.org\/10.26421\/QIC3.2-9","journal-title":"Quantum Inf. Comput."},{"key":"4159_CR6","unstructured":"Draper, T.G.: Addition on a quantum computer. arXiv:quant-ph\/0008033 (2000). Accessed 21 June 2023"},{"issue":"14","key":"4159_CR7","doi-asserted-by":"publisher","first-page":"3049","DOI":"10.1103\/PhysRevLett.85.3049","volume":"85","author":"S Parker","year":"2000","unstructured":"Parker, S., Plenio, M.B.: Efficient factorization with a single pure qubit and $$log$$N mixed qubits. Phys. Rev. Lett. 85(14), 3049\u20133052 (2000). https:\/\/doi.org\/10.1103\/PhysRevLett.85.3049. arXiv:quant-ph\/0001066","journal-title":"Phys. Rev. Lett."},{"issue":"32","key":"4159_CR8","doi-asserted-by":"publisher","first-page":"3648","DOI":"10.1007\/s11434-010-3039-1","volume":"55","author":"X Fu","year":"2010","unstructured":"Fu, X., Bao, W., Zhou, C.: Speeding up implementation for Shors factorization quantum algorithm. Chin. Sci. Bull 55(32), 3648\u20133653 (2010). https:\/\/doi.org\/10.1007\/s11434-010-3039-1","journal-title":"Chin. Sci. Bull"},{"issue":"6277","key":"4159_CR9","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1126\/science.aad9480","volume":"351","author":"T Monz","year":"2016","unstructured":"Monz, T., Nigg, D., Martinez, E.A., Brandl, M.F., Schindler, P., Rines, R., Wang, S.X., Chuang, I.L., Blatt, R.: Realization of a scalable Shor algorithm. Science 351(6277), 1068\u20131070 (2016). https:\/\/doi.org\/10.1126\/science.aad9480","journal-title":"Science"},{"key":"4159_CR10","unstructured":"Kitaev, A.Y.: Quantum measurements and the Abelian stabilizer problem. arXiv:quant-ph\/9511026 (1995). Accessed 01 June 2023"},{"key":"4159_CR11","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information, 10th anniversary, ed Cambridge University Press, Cambridge; New York (2010)"},{"key":"4159_CR12","unstructured":"Cheung, D.: Improved bounds for the approximate QFT. arXiv:quant-ph\/0403071 (2004). Accessed 20 April 2023"},{"key":"4159_CR13","unstructured":"Coppersmith, D.: An approximate Fourier transform useful in quantum factoring. arXiv:quant-ph\/0201067 (2002). Accessed 20 June 2023"},{"issue":"1","key":"4159_CR14","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., Trm, P.: Approximate quantum Fourier transform and decoherence. Phys. Rev. A 54(1), 139\u2013146 (1996). https:\/\/doi.org\/10.1103\/PhysRevA.54.139","journal-title":"Phys. Rev. A"},{"issue":"3","key":"4159_CR15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.70.032329","volume":"70","author":"AG Fowler","year":"2004","unstructured":"Fowler, A.G., Hollenberg, L.C.L.: Scalability of Shors algorithm with a limited set of rotation gates. Phys. Rev. A 70(3), 032329 (2004). https:\/\/doi.org\/10.1103\/PhysRevA.70.032329","journal-title":"Phys. Rev. A"},{"issue":"6","key":"4159_CR16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.88.062310","volume":"88","author":"YS Nam","year":"2013","unstructured":"Nam, Y.S., Bl\u00fcmel, R.: Robustness and performance scaling of a quantum computer with respect to a class of static defects. Phys. Rev. A 88(6), 062310 (2013). https:\/\/doi.org\/10.1103\/PhysRevA.88.062310","journal-title":"Phys. Rev. A"},{"issue":"4","key":"4159_CR17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.92.042301","volume":"92","author":"YS Nam","year":"2015","unstructured":"Nam, Y.S., Bl\u00fcmel, R.: Analytical formulas for the performance scaling of quantum processors with a large number of defective gates. Phys. Rev. A 92(4), 042301 (2015). https:\/\/doi.org\/10.1103\/PhysRevA.92.042301","journal-title":"Phys. Rev. A"},{"issue":"5","key":"4159_CR18","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.76.052310","volume":"76","author":"D Maslov","year":"2007","unstructured":"Maslov, D.: Linear depth stabilizer and quantum Fourier transformation circuits with no auxiliary qubits in finite neighbor quantum architectures. Phys. Rev. A 76(5), 052310 (2007). https:\/\/doi.org\/10.1103\/PhysRevA.76.052310. arXiv:quant-ph\/0703211","journal-title":"Phys. Rev. A"},{"issue":"4","key":"4159_CR19","doi-asserted-by":"publisher","first-page":"383","DOI":"10.26421\/QIC7.4-7","volume":"7","author":"Y Takahashi","year":"2007","unstructured":"Takahashi, Y., Kunihiro, N., Ohta, K.: The quantum Fourier transform on a linear nearest neighbor architecture. Quantum Inf. Comput. 7(4), 383\u2013391 (2007). https:\/\/doi.org\/10.26421\/QIC7.4-7","journal-title":"Quantum Inf. Comput."},{"issue":"3","key":"4159_CR20","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/aaa398","volume":"20","author":"D Maslov","year":"2018","unstructured":"Maslov, D., Nam, Y.: Use of global interactions in efficient quantum circuit constructions. New J. Phys 20(3), 033018 (2018). https:\/\/doi.org\/10.1088\/1367-2630\/aaa398","journal-title":"New J. Phys"},{"issue":"1","key":"4159_CR21","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1038\/s41534-020-0257-5","volume":"6","author":"Y Nam","year":"2020","unstructured":"Nam, Y., Su, Y., Maslov, D.: Approximate quantum Fourier transform with O(n log(n)) T gates. NPJ Quantum Inf 6(1), 26 (2020). https:\/\/doi.org\/10.1038\/s41534-020-0257-5","journal-title":"NPJ Quantum Inf"},{"key":"4159_CR22","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.87.032333","volume":"87","author":"YS Nam","year":"2013","unstructured":"Nam, Y.S., Bl\u00fcmel, R.: Scaling laws for shor\u2019s algorithm with a banded quantum Fourier transform. Phys. Rev. A 87, 032333 (2013). https:\/\/doi.org\/10.1103\/PhysRevA.87.032333","journal-title":"Phys. Rev. A"},{"issue":"6","key":"4159_CR23","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, J.C.: Quantum arithmetic with the Quantum Fourier Transform. Quantum Information Processing 16(6), 152 (2017). https:\/\/doi.org\/10.1007\/s11128-017-1603-1. arXiv:1411.5949 [quant-ph]","journal-title":"Quantum Information Processing"},{"issue":"3","key":"4159_CR24","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.76.030306","volume":"76","author":"M Dobsicek","year":"2007","unstructured":"Dobsicek, M., Johansson, G., Shumeiko, V.S., Wendin, G.: Arbitrary accuracy iterative phase estimation algorithm as a two qubit benchmark. Phys. Rev. A 76(3), 030306 (2007). https:\/\/doi.org\/10.1103\/PhysRevA.76.030306. arXiv:quant-ph\/0610214","journal-title":"Phys. Rev. A"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-023-04159-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-023-04159-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-023-04159-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,29]],"date-time":"2023-11-29T23:04:22Z","timestamp":1701299062000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-023-04159-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,6]]},"references-count":24,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2023,11]]}},"alternative-id":["4159"],"URL":"https:\/\/doi.org\/10.1007\/s11128-023-04159-y","relation":{},"ISSN":["1573-1332"],"issn-type":[{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2023,11,6]]},"assertion":[{"value":"1 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"402"}}