{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T11:47:02Z","timestamp":1770464822119,"version":"3.49.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2022,11,22]],"date-time":"2022-11-22T00:00:00Z","timestamp":1669075200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,22]],"date-time":"2022-11-22T00:00:00Z","timestamp":1669075200000},"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","doi-asserted-by":"publisher","award":["60836001"],"award-info":[{"award-number":["60836001"]}],"id":[{"id":"10.13039\/501100001809","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-022-03736-x","type":"journal-article","created":{"date-parts":[[2022,11,23]],"date-time":"2022-11-23T08:03:49Z","timestamp":1669190629000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Quantum modular multiplier via binary-exponent-based recombination"],"prefix":"10.1007","volume":"21","author":[{"given":"Yongcheng","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changhao","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Genting","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaiyong","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao","family":"Geng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianshe","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,22]]},"reference":[{"key":"3736_CR1","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1038\/d41586-022-00339-5","volume":"602","author":"D Castelvecchi","year":"2022","unstructured":"Castelvecchi, D.: Preparing for qday. Nature 602, 198\u2013201 (2022)","journal-title":"Nature"},{"key":"3736_CR2","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). IEEE"},{"key":"3736_CR3","doi-asserted-by":"crossref","unstructured":"Nam, Y., Ross, N.J., Su, Y., Childs, A.M., Maslov, D.: Automated optimization of large quantum circuits with continuous parameters. npj Quantum Inf. 4(1), 1\u2013 12 (2018)","DOI":"10.1038\/s41534-018-0072-4"},{"key":"3736_CR4","doi-asserted-by":"crossref","unstructured":"Dumitrescu, E.: Tree tensor network approach to simulating Shor\u2019s algorithm. Phys. Rev. A 96(6), 062322 (2017)","DOI":"10.1103\/PhysRevA.96.062322"},{"issue":"1","key":"3736_CR5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.87.012310","volume":"87","author":"IL Markov","year":"2013","unstructured":"Markov, I.L., Saeedi, M.: Faster quantum number factoring via circuit synthesis. Phys. Rev. A 87(1), 012310 (2013)","journal-title":"Phys. Rev. A"},{"key":"3736_CR6","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.127.140503","volume":"127","author":"E Gouzien","year":"2021","unstructured":"Gouzien, E., Sangouard, N.: Factoring 2048-bit rsa integers in 177 days with 13,436 qubits and a multimode memory. Phys. Rev. Lett. 127, 140503 (2021). https:\/\/doi.org\/10.1103\/PhysRevLett.127.140503","journal-title":"Phys. Rev. Lett."},{"key":"3736_CR7","doi-asserted-by":"publisher","first-page":"433","DOI":"10.22331\/q-2021-04-15-433","volume":"5","author":"C Gidney","year":"2021","unstructured":"Gidney, C., Eker\u00e5, M.: How to factor 2048 bit rsa integers in 8 hours using 20 million noisy qubits. Quantum 5, 433 (2021)","journal-title":"Quantum"},{"key":"3736_CR8","doi-asserted-by":"crossref","unstructured":"Lucero, E., Barends, R., Chen, Y., Kelly, J., Mariantoni, M., Megrant, A., O\u2019Malley, P., Sank, D., Vainsencher, A., Wenner, J., et al.: Computing prime factors with a Josephson phase qubit quantum processor. Nat. Phys. 8(10), 719\u2013723 (2012)","DOI":"10.1038\/nphys2385"},{"key":"3736_CR9","doi-asserted-by":"crossref","unstructured":"Martin-Lopez, E., Laing, A., Lawson, T., Alvarez, R., Zhou, X.-Q., O\u2019brien, J.L.: Experimental realization of Shor\u2019s quantum factoring algorithm using qubit recycling. Nat. Photonics 6( 11), 773\u2013 776 ( 2012)","DOI":"10.1038\/nphoton.2012.259"},{"issue":"6277","key":"3736_CR10","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)","journal-title":"Science"},{"key":"3736_CR11","unstructured":"Rines, R., Chuang, I.: High performance quantum modular multipliers. arXiv preprint arXiv:1801.01081 (2018)"},{"issue":"22","key":"3736_CR12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.101.220405","volume":"101","author":"X Peng","year":"2008","unstructured":"Peng, X., Liao, Z., Xu, N., Qin, G., Zhou, X., Suter, D., Du, J.: Quantum adiabatic algorithm for factorization and its experimental implementation. Phys. Rev. Lett. 101(22), 220405 (2008)","journal-title":"Phys. Rev. Lett."},{"key":"3736_CR13","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge ( 2000)"},{"key":"3736_CR14","doi-asserted-by":"crossref","unstructured":"Eker\u00e5, M., H\u00e5stad, J.: Quantum algorithms for computing short discrete logarithms and factoring rsa integers. In: International Workshop on Post-Quantum Cryptography, pp. 347\u2013 363 (2017). Springer","DOI":"10.1007\/978-3-319-59879-6_20"},{"issue":"1","key":"3736_CR15","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)","journal-title":"Phys. Rev. A"},{"key":"3736_CR16","unstructured":"Zalka, C.: Fast versions of Shor\u2019s quantum factoring algorithm. arXiv preprint arXiv:quant-ph\/9806084 (1998)"},{"issue":"5","key":"3736_CR17","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 71(5), 052320 (2005)","journal-title":"Phys. Rev. A"},{"key":"3736_CR18","doi-asserted-by":"crossref","unstructured":"Pavlidis, A., Gizopoulos, D.: Fast quantum modular exponentiation architecture for Shor\u2019s factorization algorithm. Quantum Inf. Comput. 14(7 and 8), 649\u2013 682 (2014)","DOI":"10.26421\/QIC14.7-8-8"},{"key":"3736_CR19","doi-asserted-by":"crossref","unstructured":"Pham, P., Svore, K.M.: A 2D nearest-neighbor quantum architecture for factoring in polylogarithmic depth. Quantum Inf Comput 13(11 and 12), 0937\u2013 0962 (2013)","DOI":"10.26421\/QIC13.11-12-3"},{"issue":"4","key":"3736_CR20","first-page":"351","volume":"6","author":"TG Draper","year":"2006","unstructured":"Draper, T.G., Kutin, S.A., Rains, E.M., Svore, K.M.: A logarithmic-depth quantum carry-lookahead adder. Quantum Inf. Comput. 6(4), 351\u2013369 (2006)","journal-title":"Quantum Inf. Comput."},{"key":"3736_CR21","doi-asserted-by":"crossref","unstructured":"Beauregard, S.: Circuit for Shor\u2019s algorithm using 2n+ 3 qubits. Quantum Inf. Comput. 3, 175\u2013185 (2003)","DOI":"10.26421\/QIC3.2-8"},{"key":"3736_CR22","unstructured":"Gidney, C.: Factoring with $$n+ 2$$ clean qubits and $$n-1$$ dirty qubits. arXiv preprint arXiv:1706.07884 (2017)"},{"key":"3736_CR23","doi-asserted-by":"crossref","unstructured":"Davies, J., Rickerd, C.J., Grimes, M.A., Guney, D.O.: An n-bit general implementation of Shor\u2019s quantum period-finding algorithm. arXiv preprint arXiv:1612.07424 (2016)","DOI":"10.26421\/QIC16.7-8-6"},{"issue":"2","key":"3736_CR24","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1103\/PhysRevA.54.1034","volume":"54","author":"D Beckman","year":"1996","unstructured":"Beckman, D., Chari, A.N., Devabhaktuni, S., Preskill, J.: Efficient networks for quantum factoring. Phys. Rev. A 54(2), 1034 (1996)","journal-title":"Phys. Rev. A"},{"key":"3736_CR25","unstructured":"Cuccaro, S.A., Draper, T.G., Kutin, S.A., Moulton, D.P.: A new quantum ripple-carry addition circuit. arXiv preprint arXiv:quant-ph\/0410184 (2004)"},{"issue":"6","key":"3736_CR26","first-page":"440","volume":"5","author":"Y Takahashi","year":"2005","unstructured":"Takahashi, Y., Kunihiro, N.: A linear-size quantum circuit for addition with no ancillary qubits. Quantum Inf. Comput. 5(6), 440\u2013448 (2005)","journal-title":"Quantum Inf. Comput."},{"key":"3736_CR27","unstructured":"Gossett, P.: Quantum carry-save arithmetic. arXiv preprint arXiv: quant-ph\/9808061 (1998)"},{"key":"3736_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TQE.2021.3136195","volume":"3","author":"K Oonishi","year":"2021","unstructured":"Oonishi, K., Tanaka, T., Uno, S., Satoh, T., Van Meter, R., Kunihiro, N.: Efficient construction of a control modular adder on a carry-lookahead adder using relative-phase Toffoli gates. IEEE Trans. Quantum Eng. 3, 1\u201318 (2021)","journal-title":"IEEE Trans. Quantum Eng."},{"key":"3736_CR29","unstructured":"Draper, T.G.: Addition on a quantum computer. arXiv preprint arXiv:quant-ph\/0008033 (2000)"},{"key":"3736_CR30","doi-asserted-by":"crossref","unstructured":"Fowler, A.G., Devitt, S.J., Hollenberg, L.C.: Implementation of Shor\u2019s algorithm on a linear nearest neighbour qubit array. Quantum Inf. Comput. 4(4), 237\u2013251 (2004)","DOI":"10.26421\/QIC4.4-1"},{"key":"3736_CR31","unstructured":"Zalka, C.: Shor\u2019s algorithm with fewer (pure) qubits. arXiv preprint arXiv:quant-ph\/0601097 (2006)"},{"key":"3736_CR32","unstructured":"Gidney, C.: Approximate encoded permutations and piecewise quantum adders. arXiv preprint arXiv:1905.08488 (2019)"},{"key":"3736_CR33","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.103.032417","volume":"103","author":"A Pavlidis","year":"2021","unstructured":"Pavlidis, A., Floratos, E.: Quantum-Fourier-transform-based quantum arithmetic with qudits. Phys. Rev. A 103, 032417 (2021)","journal-title":"Phys. Rev. A"},{"key":"3736_CR34","unstructured":"Kutin, S.A.: Shor\u2019s algorithm on a nearest-neighbor machine. arXiv preprint arXiv:quant-ph\/0609001 (2006)"},{"key":"3736_CR35","unstructured":"Gidney, C.: Windowed quantum arithmetic. arXiv preprint arXiv:1905.07682 (2019)"},{"key":"3736_CR36","doi-asserted-by":"crossref","unstructured":"Nam, Y.S., Bl\u00fcmel, R.: Scaling laws for Shor\u2019s algorithm with a banded quantum Fourier transform. Phys. Rev. A 87(3), 032333 (2013)","DOI":"10.1103\/PhysRevA.87.032333"},{"key":"3736_CR37","unstructured":"IBM: https:\/\/www.qiskit.org\/"},{"issue":"11\u201312","key":"3736_CR38","first-page":"937","volume":"13","author":"P Pham","year":"2013","unstructured":"Pham, P., Svore, K.M.: A 2D nearest-neighbor quantum architecture for factoring in polylogarithmic depth. Quantum Inf. Comput. 13(11\u201312), 937\u2013962 (2013)","journal-title":"Quantum Inf. Comput."},{"issue":"14","key":"3736_CR39","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 (2000)","journal-title":"Phys. Rev. Lett."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-022-03736-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-022-03736-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-022-03736-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T14:44:26Z","timestamp":1670424266000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-022-03736-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,22]]},"references-count":39,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2022,12]]}},"alternative-id":["3736"],"URL":"https:\/\/doi.org\/10.1007\/s11128-022-03736-x","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,22]]},"assertion":[{"value":"12 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The codes that implement the truth table of BER algorithm when the constant  and the modulo  using Qiskit are available from the authors on reasonable request.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}],"article-number":"391"}}