{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T11:07:26Z","timestamp":1784286446555,"version":"3.55.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T00:00:00Z","timestamp":1779667200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T00:00:00Z","timestamp":1779667200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Institute of Information & Communications Technology Planning & Evaluatio","award":["RS-2019-II190033"],"award-info":[{"award-number":["RS-2019-II190033"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-026-05211-3","type":"journal-article","created":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T04:39:51Z","timestamp":1779683991000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Construction and depth optimization of quantum controlled adder"],"prefix":"10.1007","volume":"25","author":[{"given":"Chanho","family":"Jeon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Donghoe","family":"Heo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hyojun","family":"Shin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Seokhie","family":"Hong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,25]]},"reference":[{"issue":"2","key":"5211_CR1","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"PW Shor","year":"1999","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303\u2013332 (1999). https:\/\/doi.org\/10.1137\/S0036144598347011","journal-title":"SIAM Rev."},{"key":"5211_CR2","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, 212\u2013219. (1996). https:\/\/doi.org\/10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"issue":"5","key":"5211_CR3","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1109\/TC.2018.2882774","volume":"68","author":"E Mu\u00f1oz-Coreas","year":"2018","unstructured":"Mu\u00f1oz-Coreas, E., Thapliyal, H.: Quantum circuit design of a t-count optimized integer multiplier. IEEE Trans. Comput. 68(5), 729\u2013739 (2018). https:\/\/doi.org\/10.1109\/TC.2018.2882774","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"5211_CR4","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1109\/TETC.2019.2910870","volume":"9","author":"H Thapliyal","year":"2019","unstructured":"Thapliyal, H., Munoz-Coreas, E., Varun, T.S.S., Humble, T.S.: Quantum circuit designs of integer division optimizing t-count and t-depth. IEEE Trans. Emerg. Top. Comput. 9(2), 1045\u20131056 (2019). https:\/\/doi.org\/10.1109\/TETC.2019.2910870","journal-title":"IEEE Trans. Emerg. Top. Comput."},{"key":"5211_CR5","doi-asserted-by":"publisher","unstructured":"Rines, R., Chuang, I.: High performance quantum modular multipliers. arXiv (2018) https:\/\/doi.org\/10.48550\/arXiv.1801.01081","DOI":"10.48550\/arXiv.1801.01081"},{"key":"5211_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-021-03296-6","author":"SS Gayathri","year":"2021","unstructured":"Gayathri, S.S., Kumar, R., Dhanalakshmi, S., Kaushik, B.K.: T-count optimized quantum circuit for floating point addition and multiplication. Quantum Inf. Process. (2021). https:\/\/doi.org\/10.1007\/s11128-021-03296-6","journal-title":"Quantum Inf. Process."},{"key":"5211_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-024-04536-1","author":"S Kim","year":"2024","unstructured":"Kim, S., Kim, I., Kim, S., Hong, S.: Toffoli gate count optimized space-efficient quantum circuit for binary field multiplication. Quantum Inf. Process. (2024). https:\/\/doi.org\/10.1007\/s11128-024-04536-1","journal-title":"Quantum Inf. Process."},{"key":"5211_CR8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.54.147","author":"V Vedral","year":"1996","unstructured":"Vedral, V., Barenco, A., Ekert, A.: Quantum networks for elementary arithmetic operations. Phys. Rev. A (1996). https:\/\/doi.org\/10.1103\/PhysRevA.54.147","journal-title":"Phys. Rev. A"},{"key":"5211_CR9","doi-asserted-by":"publisher","unstructured":"Draper, T.G.: Addition on a quantum computer. arXiv (2000) https:\/\/doi.org\/10.48550\/arXiv.quant-ph\/0008033","DOI":"10.48550\/arXiv.quant-ph\/0008033"},{"key":"5211_CR10","doi-asserted-by":"publisher","unstructured":"Cuccaro, S.A., Draper, T.G., Kutin, S.A., Moulton, D.P.: A new quantum ripple-carry addition circuit. arXiv, (2004). https:\/\/doi.org\/10.48550\/arXiv.quant-ph\/0410184","DOI":"10.48550\/arXiv.quant-ph\/0410184"},{"key":"5211_CR11","doi-asserted-by":"crossref","unstructured":"Draper, T.G., Kutin, S.A., Rains, E.M., Svore, K.M.: A logarithmic-depth quantum carry-lookahead adder. Quantum Information and Computation 6(4&5), 351\u2013369 (2006) https:\/\/doi.org\/10.26421\/QIC6.4-5-4","DOI":"10.26421\/QIC6.4-5-4"},{"key":"5211_CR12","doi-asserted-by":"crossref","unstructured":"Takahashi, Y., Tani, S., Kunihiro, N.: Quantum addition circuits and unbounded fan-out. Quantum Information and Computation 10(9&10), 872\u2013890 (2010) https:\/\/doi.org\/10.26421\/QIC10.9-10-12","DOI":"10.26421\/QIC10.9-10-12"},{"issue":"3","key":"5211_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2491682","volume":"9","author":"H Thapliyal","year":"2013","unstructured":"Thapliyal, H., Ranganathan, N.: Design of efficient reversible logic-based binary and bcd adder circuits. ACM J. Emerg. Technol. Comput. Syst. 9(3), 1\u201331 (2013). https:\/\/doi.org\/10.1145\/2491682","journal-title":"ACM J. Emerg. Technol. Comput. Syst."},{"issue":"3","key":"5211_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3743691","volume":"6","author":"S Wang","year":"2025","unstructured":"Wang, S., Mondal, A., Chattopadhyay, A.: Optimal toffoli-depth quantum adder. ACM Trans. Quantum Comput. 6(3), 1\u201316 (2025). https:\/\/doi.org\/10.1145\/3743691","journal-title":"ACM Trans. Quantum Comput."},{"issue":"10","key":"5211_CR15","doi-asserted-by":"publisher","first-page":"1476","DOI":"10.1109\/TCAD.2014.2341953","volume":"33","author":"M Amy","year":"2014","unstructured":"Amy, M., Maslov, D., Mosca, M.: Polynomial-time t-depth optimization of clifford+ t circuits via matroid partitioning. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 33(10), 1476\u20131489 (2014). https:\/\/doi.org\/10.1109\/TCAD.2014.2341953","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"4","key":"5211_CR16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.87.042302","volume":"87","author":"P Selinger","year":"2013","unstructured":"Selinger, P.: Quantum circuits of t-depth one. Phys. Rev. A-At. Mol. Opt. Phys. 87(4), 042302 (2013). https:\/\/doi.org\/10.1103\/PhysRevA.87.042302","journal-title":"Phys. Rev. A-At. Mol. Opt. Phys."},{"key":"5211_CR17","doi-asserted-by":"publisher","unstructured":"Markov, I.L., Saeedi, M.: Constant-optimized quantum circuits for modular multiplication and exponentiation. Quantum Information and Computation 12(5&6), 361\u2013394 (2012) https:\/\/doi.org\/10.26421\/QIC12.5-6-1","DOI":"10.26421\/QIC12.5-6-1"},{"key":"5211_CR18","doi-asserted-by":"publisher","unstructured":"Davies, J.T., Rickerd, C.J., Grimes, M.A., Guney, D.O.: An n-bit general implementation of shor\u2019s quantum period-finding algorithm. Quantum Information and Computation 16(7&8), 700\u2013718 (2016) https:\/\/doi.org\/10.26421\/QIC16.7-8-6","DOI":"10.26421\/QIC16.7-8-6"},{"issue":"4","key":"5211_CR19","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aacf0b","volume":"3","author":"GG Guerreschi","year":"2018","unstructured":"Guerreschi, G.G., Park, J.: Two-step approach to scheduling quantum circuits. Quantum Sci. Technol. 3(4), 045003 (2018). https:\/\/doi.org\/10.1088\/2058-9565\/aacf0b","journal-title":"Quantum Sci. Technol."},{"key":"5211_CR20","doi-asserted-by":"publisher","unstructured":"Bera, D., Fenner, S., Green, F., Homer, S.: Efficient universal quantum circuits. In: Computing and Combinatorics (COCOON 2009). Lecture Notes in Computer Science, 5609, 418\u2013428. Springer, (2009). https:\/\/doi.org\/10.1007\/978-3-642-02882-3_42","DOI":"10.1007\/978-3-642-02882-3_42"},{"issue":"6412","key":"5211_CR21","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1126\/science.aar3106","volume":"362","author":"S Bravyi","year":"2018","unstructured":"Bravyi, S., Gosset, D., K\u00f6nig, R.: Quantum advantage with shallow circuits. Science 362(6412), 308\u2013311 (2018). https:\/\/doi.org\/10.1126\/science.aar3106","journal-title":"Science"},{"issue":"5","key":"5211_CR22","doi-asserted-by":"publisher","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","volume":"52","author":"A Barenco","year":"1995","unstructured":"Barenco, A., Bennett, C.H., Cleve, R., DiVincenzo, D.P., Margolus, N., Shor, P., Sleator, T., Smolin, J.A., Weinfurter, H.: Elementary gates for quantum computation. Phys. Rev. A 52(5), 3457 (1995). https:\/\/doi.org\/10.1103\/PhysRevA.52.3457","journal-title":"Phys. Rev. A"},{"key":"5211_CR23","unstructured":"Controlled Adder and Multiplier Circuits in Qiskit. https:\/\/github.com\/ggano\/ControlledAdder. Accessed: 2025-09-01 (2025)"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-026-05211-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-026-05211-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-026-05211-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T10:50:17Z","timestamp":1784285417000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-026-05211-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,25]]},"references-count":23,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2026,6]]}},"alternative-id":["5211"],"URL":"https:\/\/doi.org\/10.1007\/s11128-026-05211-3","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,25]]},"assertion":[{"value":"17 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no conflict of interest.","order":1,"name":"Ethics","label":"Conflict of interest","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"191"}}