{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:27:31Z","timestamp":1740137251671,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T00:00:00Z","timestamp":1671408000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T00:00:00Z","timestamp":1671408000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["PID2021-123461NB-C22","PID2021-123278OB-I00","PID2020-119082RB-C22","MTM-2017-83506-C2-2-P"],"award-info":[{"award-number":["PID2021-123461NB-C22","PID2021-123278OB-I00","PID2020-119082RB-C22","MTM-2017-83506-C2-2-P"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002878","name":"Consejer\u00eda de Econom\u00eda, Innovaci\u00f3n, Ciencia y Empleo, Junta de Andaluc\u00eda","doi-asserted-by":"publisher","award":["P20_00748","ICDRUGS-P18-RT-1193","UAL2020-TIC-A2101","UAL18-TIC-A020-B"],"award-info":[{"award-number":["P20_00748","ICDRUGS-P18-RT-1193","UAL2020-TIC-A2101","UAL18-TIC-A020-B"]}],"id":[{"id":"10.13039\/501100002878","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011941","name":"Gobierno del Principado de Asturias","doi-asserted-by":"publisher","award":["AYUD\/2021\/50994"],"award-info":[{"award-number":["AYUD\/2021\/50994"]}],"id":[{"id":"10.13039\/100011941","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100008530","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-03784-3","type":"journal-article","created":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T14:03:39Z","timestamp":1671458619000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimized quantum leading zero detector circuits"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4312-3671","authenticated-orcid":false,"given":"Francisco","family":"Orts","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gloria","family":"Ortega","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"El\u00edas F.","family":"Combarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ignacio F.","family":"R\u00faa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ester M.","family":"Garz\u00f3n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,19]]},"reference":[{"key":"3784_CR1","doi-asserted-by":"publisher","first-page":"226","DOI":"10.22331\/q-2020-02-06-226","volume":"4","author":"A P\u00e9rez-Salinas","year":"2020","unstructured":"P\u00e9rez-Salinas, A., Cervera-Lierta, A., Gil-Fuster, E., Latorre, J.: Data re-uploading for a universal quantum classifier. Quantum 4, 226 (2020)","journal-title":"Quantum"},{"key":"3784_CR2","doi-asserted-by":"publisher","first-page":"8433","DOI":"10.1007\/s11227-020-03576-5","volume":"77","author":"F Orts","year":"2021","unstructured":"Orts, F., Ortega, G., Cucura, A., Filatovas, E., Garz\u00f3n, E.: Optimal fault-tolerant quantum comparators for image binarization. J. Supercomput. 77, 8433\u20138444 (2021)","journal-title":"J. Supercomput."},{"issue":"1","key":"3784_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-019-47174-9","volume":"9","author":"T Jones","year":"2019","unstructured":"Jones, T., Brown, A., Bush, I., Benjamin, S.: Quest and high performance simulation of quantum computers. Sci. Rep. 9(1), 1\u201311 (2019)","journal-title":"Sci. Rep."},{"key":"3784_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.22331\/q-2018-01-31-49","volume":"2","author":"D Steiger","year":"2018","unstructured":"Steiger, D., H\u00e4ner, T., Troyer, M.: Projectq: an open source software framework for quantum computing. Quantum 2, 49 (2018)","journal-title":"Quantum"},{"key":"3784_CR5","volume-title":"Quantum Computation and Quantum Information","author":"M Nielsen","year":"2002","unstructured":"Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2002)"},{"key":"3784_CR6","doi-asserted-by":"crossref","unstructured":"Grover, L.: 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)","DOI":"10.1145\/237814.237866"},{"issue":"2","key":"3784_CR7","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","volume":"79","author":"L Grover","year":"1997","unstructured":"Grover, L.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79(2), 325 (1997)","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"3784_CR8","doi-asserted-by":"publisher","DOI":"10.1002\/cmm4.1009","volume":"1","author":"E Combarro","year":"2019","unstructured":"Combarro, E., Ranilla, J., R\u00faa, I.: Experiments testing the commutativity of finite-dimensional algebras with a quantum adiabatic algorithm. Comput. Math. Methods 1(1), e1009 (2019)","journal-title":"Comput. Math. Methods"},{"key":"3784_CR9","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/11860.001.0001","volume-title":"Quantum Computing for Everyone","author":"C Bernhardt","year":"2019","unstructured":"Bernhardt, C.: Quantum Computing for Everyone. MIT Press, Cambridge (2019)"},{"issue":"2","key":"3784_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2629525","volume":"11","author":"T Nguyen","year":"2014","unstructured":"Nguyen, T., Van Meter, R.: A resource-efficient design for a reversible floating point adder in quantum computing. ACM J. Emerg. Technol. Comput. Syst. (JETC) 11(2), 1\u201318 (2014)","journal-title":"ACM J. Emerg. Technol. Comput. Syst. (JETC)"},{"issue":"10","key":"3784_CR11","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)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"3784_CR12","volume":"29","author":"H Thapliyal","year":"2021","unstructured":"Thapliyal, H., Mu\u00f1oz-Coreas, E., Khalus, V.: Quantum circuit designs of carry lookahead adder optimized for T-count, T-depth, and qubits. Sustain. Comput. Inf. Syst. 29, 100457 (2021)","journal-title":"Sustain. Comput. Inf. Syst."},{"issue":"9\u201310","key":"3784_CR13","first-page":"747","volume":"20","author":"F Orts","year":"2020","unstructured":"Orts, F., Ortega, G., Garz\u00f3n, E.: Efficient reversible quantum design of sign-magnitude to two\u2019s complement converters. Quantum Inf. Comput. 20(9\u201310), 747\u2013765 (2020)","journal-title":"Quantum Inf. Comput."},{"issue":"1","key":"3784_CR14","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/92.273153","volume":"2","author":"V Oklobdzija","year":"1994","unstructured":"Oklobdzija, V.: An algorithmic and novel design of a leading zero detector circuit: comparison with logic synthesis. IEEE Trans. Very Large Scale Integr. VLSI Syst. 2(1), 124\u2013128 (1994)","journal-title":"IEEE Trans. Very Large Scale Integr. VLSI Syst."},{"issue":"1","key":"3784_CR15","first-page":"2","volume":"4","author":"A AnanthaLakshmi","year":"2015","unstructured":"AnanthaLakshmi, A., Sudha, G.: Design of an efficient reversible single precision floating point adder. Int. J. Comput. Intell. Stud. 4(1), 2\u201330 (2015)","journal-title":"Int. J. Comput. Intell. Stud."},{"issue":"6","key":"3784_CR16","doi-asserted-by":"publisher","first-page":"703","DOI":"10.3390\/electronics10060703","volume":"10","author":"S Gayathri","year":"2021","unstructured":"Gayathri, S., Kumar, R., Dhanalakshmi, S., Dooly, G., Duraibabu, D.: T-count optimized quantum circuit designs for single-precision floating-point division. Electronics 10(6), 703 (2021)","journal-title":"Electronics"},{"key":"3784_CR17","doi-asserted-by":"publisher","DOI":"10.1145\/2629525","author":"T Nguyen","year":"2013","unstructured":"Nguyen, T., Van Meter, R.: A space-efficient design for reversible floating point adder in quantum computing. ACM J. Emerg. Technol. Comput. Syst. (2013). https:\/\/doi.org\/10.1145\/2629525","journal-title":"ACM J. Emerg. Technol. Comput. Syst."},{"issue":"8","key":"3784_CR18","first-page":"40","volume":"173","author":"D Nandan","year":"2017","unstructured":"Nandan, D., Kanungo, J., Mahajan, A.: Implementation of leading one detector based on reversible logic for logarithmic arithmetic. Int. J. Comput. Appl. 173(8), 40\u201345 (2017)","journal-title":"Int. J. Comput. Appl."},{"issue":"8","key":"3784_CR19","doi-asserted-by":"publisher","first-page":"8467","DOI":"10.1109\/TCYB.2021.3049509","volume":"52","author":"H-S Li","year":"2022","unstructured":"Li, H.-S., Fan, P., Peng, H., Song, S., Long, G.-L.: Multilevel 2-d quantum wavelet transforms. IEEE Trans. Cybern. 52(8), 8467\u2013848 (2022)","journal-title":"IEEE Trans. Cybern."},{"key":"3784_CR20","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., Garz\u00f3n, E.: A review on reversible quantum adders. J. Netw. Comput. Appl. 170, 102810 (2020)","journal-title":"J. Netw. Comput. Appl."},{"issue":"2","key":"3784_CR21","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"P Shor","year":"1999","unstructured":"Shor, P.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303\u2013332 (1999)","journal-title":"SIAM Rev."},{"issue":"4","key":"3784_CR22","volume":"8","author":"R Babbush","year":"2018","unstructured":"Babbush, R., Gidney, C., Berry, D., Wiebe, N., McClean, J., Paler, A., Fowler, A., Neven, H.: Encoding electronic spectra in quantum circuits with linear t complexity. Phys. Rev. X 8(4), 041015 (2018)","journal-title":"Phys. Rev. X"},{"key":"3784_CR23","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":"3784_CR24","doi-asserted-by":"crossref","unstructured":"Bernstein, D., Lange, T., Martindale, C., Panny, L.: Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 409\u2013441. Springer, Berlin (2019)","DOI":"10.1007\/978-3-030-17656-3_15"},{"issue":"11","key":"3784_CR25","doi-asserted-by":"publisher","first-page":"1579","DOI":"10.1088\/0256-307X\/19\/11\/303","volume":"19","author":"Z Sheng-Xing","year":"2002","unstructured":"Sheng-Xing, Z., Gui-Lu, L., Xiao-Shu, L.: A remote quantum adding machine. Chin. Phys. Lett. 19(11), 1579 (2002)","journal-title":"Chin. Phys. Lett."},{"key":"3784_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11433-020-1582-8","volume":"63","author":"H Li","year":"2020","unstructured":"Li, H., Fan, P., Xia, H., Peng, H., Long, G.: Efficient quantum arithmetic operation circuits for quantum image processing. Sci. China Phys. Mech. Astron. 63, 1\u201313 (2020)","journal-title":"Sci. China Phys. Mech. Astron."},{"issue":"1","key":"3784_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-016-0028-x","volume":"7","author":"R Zhou","year":"2017","unstructured":"Zhou, R., Hu, W., Fan, P., Ian, H.: Quantum realization of the bilinear interpolation method for NEQR. Sci. Rep. 7(1), 1\u201317 (2017)","journal-title":"Sci. Rep."},{"issue":"9","key":"3784_CR28","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevD.101.094015","volume":"101","author":"A Wei","year":"2020","unstructured":"Wei, A., Naik, P., Harrow, A., Thaler, J.: Quantum algorithms for jet clustering. Phys. Rev. D 101(9), 094015 (2020)","journal-title":"Phys. Rev. D"},{"issue":"7","key":"3784_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-019-2326-2","volume":"18","author":"L Gyongyosi","year":"2019","unstructured":"Gyongyosi, L., Imre, S.: Quantum circuit design for objective function maximization in gate-model quantum computers. Quantum Inf. Process. 18(7), 1\u201333 (2019)","journal-title":"Quantum Inf. Process."},{"issue":"4","key":"3784_CR30","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(4), 297\u2013318 (2009)","journal-title":"Quantum Inf. Process."},{"issue":"3","key":"3784_CR31","doi-asserted-by":"publisher","first-page":"2206","DOI":"10.1007\/s11227-019-03074-3","volume":"76","author":"M Noorallahzadeh","year":"2020","unstructured":"Noorallahzadeh, M., Mosleh, M.: Parity-preserving reversible flip-flops with low quantum cost in nanoscale. J. Supercomput. 76(3), 2206\u20132238 (2020)","journal-title":"J. Supercomput."},{"issue":"6","key":"3784_CR32","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1049\/iet-cds.2018.5240","volume":"13","author":"M Noorallahzadeh","year":"2019","unstructured":"Noorallahzadeh, M., Mosleh, M.: Efficient designs of reversible latches with low quantum cost. IET Circuits Devices Syst. 13(6), 806\u2013815 (2019)","journal-title":"IET Circuits Devices Syst."},{"key":"3784_CR33","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1016\/j.procs.2017.12.103","volume":"125","author":"H Gaur","year":"2018","unstructured":"Gaur, H., Singh, A., Ghanekar, U.: In-depth comparative analysis of reversible gates for designing logic circuits. Procedia Comput. Sci. 125, 810\u2013817 (2018)","journal-title":"Procedia Comput. Sci."},{"issue":"11","key":"3784_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-019-2447-7","volume":"18","author":"F Orts","year":"2019","unstructured":"Orts, F., Ortega, G., Garz\u00f3n, E.: An optimized quantum circuit for converting from sign-magnitude to two\u2019s complement. Quantum Inf. Process. 18(11), 1\u201314 (2019)","journal-title":"Quantum Inf. Process."},{"key":"3784_CR35","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)","journal-title":"Quantum"},{"issue":"6","key":"3784_CR36","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/TCAD.2013.2244643","volume":"32","author":"M Amy","year":"2013","unstructured":"Amy, M., Maslov, D., Mosca, M., Roetteler, M.: A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 32(6), 818\u2013830 (2013)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"2","key":"3784_CR37","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.87.022328","volume":"87","author":"C Jones","year":"2013","unstructured":"Jones, C.: Low-overhead constructions for the fault-tolerant Toffoli gate. Phys. Rev. A 87(2), 022328 (2013)","journal-title":"Phys. Rev. A"},{"issue":"4","key":"3784_CR38","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 87(4), 042302 (2013)","journal-title":"Phys. Rev. A"},{"issue":"5","key":"3784_CR39","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., Cleve, R., DiVincenzo, D., Margolus, N., Shor, P., Sleator, T., Smolin, J.A., Weinfurter, H.: Elementary gates for quantum computation. Phys. Rev. A 52(5), 3457 (1995)","journal-title":"Phys. Rev. A"},{"issue":"03","key":"3784_CR40","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1142\/S0219749908003621","volume":"6","author":"Y Liu","year":"2008","unstructured":"Liu, Y., Long, G.L., Sun, Y.: Analytic one-bit and CNOT gate constructions of general n-qubit controlled gates. Int. J. Quantum Inf. 6(03), 447\u2013462 (2008)","journal-title":"Int. J. Quantum Inf."},{"key":"3784_CR41","unstructured":"Amy, M., Ross, N.: The phase\/state duality in reversible circuit design, arXiv preprint arXiv:2105.13410"},{"key":"3784_CR42","doi-asserted-by":"crossref","unstructured":"Gro\u00dfe, D., Wille, R., Dueck, G., Drechsler, R.: Exact synthesis of elementary quantum gate circuits for reversible functions with don\u2019t cares. In: 38th International Symposium on Multiple Valued Logic (ISMVL 2008), IEEE, pp. 214\u2013219 (2008)","DOI":"10.1109\/ISMVL.2008.42"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-022-03784-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-022-03784-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-022-03784-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T21:44:51Z","timestamp":1676497491000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-022-03784-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,19]]},"references-count":42,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,1]]}},"alternative-id":["3784"],"URL":"https:\/\/doi.org\/10.1007\/s11128-022-03784-3","relation":{},"ISSN":["1573-1332"],"issn-type":[{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2022,12,19]]},"assertion":[{"value":"1 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"28"}}