{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T17:04:23Z","timestamp":1749575063170,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:00:00Z","timestamp":1647388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:00:00Z","timestamp":1647388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100014440","name":"Ministerio de Ciencia, Innovaci\u00f3n y Universidades","doi-asserted-by":"publisher","award":["RTI2018-095993-B-I00"],"award-info":[{"award-number":["RTI2018-095993-B-I00"]}],"id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011011","name":"Junta de Andaluc\u00eda","doi-asserted-by":"publisher","award":["P20 00748","UAL2020-TIC-A2101"],"award-info":[{"award-number":["P20 00748","UAL2020-TIC-A2101"]}],"id":[{"id":"10.13039\/501100011011","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011011","name":"Junta de Andaluc\u00eda","doi-asserted-by":"publisher","award":["UAL18-TIC-A020-B"],"award-info":[{"award-number":["UAL18-TIC-A020-B"]}],"id":[{"id":"10.13039\/501100011011","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"}]},{"DOI":"10.13039\/501100021713","name":"Universidad de Almer\u00eda","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100021713","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Adders are one of the most interesting circuits in quantum computing due to their use in major algorithms that benefit from the special characteristics of this type of computation. Among these algorithms, Shor\u2019s algorithm stands out, which allows decomposing numbers in a time exponentially lower than the time needed to do it with classical computation. In this work, we propose three fault-tolerant carry lookahead adders that improve the cost in terms of quantum gates and qubits with respect to the rest of quantum circuits available in the literature. Their optimal implementation in a real quantum computer is also presented. Finally, the work ends with a rigorous comparison where the advantages and disadvantages of the proposed circuits against the rest of the circuits of the state of the art are exposed. Moreover, the information obtained from such a comparison is summarized in tables that allow a quick consultation to interested researchers.<\/jats:p>","DOI":"10.1007\/s11227-022-04401-x","type":"journal-article","created":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T04:43:35Z","timestamp":1647405815000},"page":"13323-13341","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Implementation of three efficient 4-digit fault-tolerant quantum carry lookahead adders"],"prefix":"10.1007","volume":"78","author":[{"given":"Francisco","family":"Orts","sequence":"first","affiliation":[]},{"given":"Gloria","family":"Ortega","sequence":"additional","affiliation":[]},{"given":"Ernestas","family":"Filatovas","sequence":"additional","affiliation":[]},{"given":"Ester","family":"M. Garz\u00f3n","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,16]]},"reference":[{"key":"4401_CR1","volume-title":"Quantum computation and quantum information","author":"MA Nielsen","year":"2002","unstructured":"Nielsen MA, Chuang IL (2002) Quantum computation and quantum information. Cambridge University Press, New York"},{"issue":"2","key":"4401_CR2","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1080\/00107514.2014.964942","volume":"56","author":"M Schuld","year":"2015","unstructured":"Schuld M, Sinayskiy I, Petruccione F (2015) An introduction to quantum machine learning. Contemp Phys 56(2):172\u2013185","journal-title":"Contemp Phys"},{"key":"4401_CR3","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 JI (2020) Data re-uploading for a universal quantum classifier. Quantum 4:226","journal-title":"Quantum"},{"key":"4401_CR4","doi-asserted-by":"crossref","unstructured":"Grover LK (1996) A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, pp. 212\u2013219","DOI":"10.1145\/237814.237866"},{"key":"4401_CR5","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 (2019) Quantum computing for everyone. MIT Press, Cambridge"},{"key":"4401_CR6","series-title":"Inventive computation and information technologies","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-16-6723-7_25","volume-title":"Experimental evaluation of adder circuits on ibm qx hardware","author":"D Singh","year":"2022","unstructured":"Singh D, Jakhodia S, Jajodia B (2022) Experimental evaluation of adder circuits on ibm qx hardware. Inventive computation and information technologies. Springer, New York"},{"issue":"7\u20138","key":"4401_CR7","first-page":"649","volume":"14","author":"A Pavlidis","year":"2014","unstructured":"Pavlidis A, Gizopoulos D (2014) Fast quantum modular exponentiation architecture for shor\u2019s factoring algorithm. Quantum Inf Comput 14(7\u20138):649\u2013682","journal-title":"Quantum Inf Comput"},{"key":"4401_CR8","unstructured":"Shor PW (1994) Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134 . Ieee"},{"issue":"6","key":"4401_CR9","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 DB (2021) T-count optimized quantum circuit designs for single-precision floating-point division. Electronics 10(6):703","journal-title":"Electronics"},{"issue":"4","key":"4401_CR10","doi-asserted-by":"publisher","first-page":"1753","DOI":"10.1007\/s00034-017-0631-5","volume":"37","author":"A Nagamani","year":"2018","unstructured":"Nagamani A, Ramesh C, Agrawal VK (2018) Design of optimized reversible squaring and sum-of-squares units. Circuits, Syst, Signal Process 37(4):1753\u20131776","journal-title":"Circuits, Syst, Signal Process"},{"key":"4401_CR11","unstructured":"Liu X, Yang H, Yang L (2021) Cnot-count optimized quantum circuit of the shor\u2019s algorithm. arXiv preprint arXiv:2112.11358"},{"issue":"2","key":"4401_CR12","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest RL, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120\u2013126","journal-title":"Commun ACM"},{"key":"4401_CR13","doi-asserted-by":"publisher","first-page":"102810","DOI":"10.1016\/j.jnca.2020.102810","volume":"170","author":"F Orts","year":"2020","unstructured":"Orts F, Ortega G, Combarro E, Garz\u00f3n E (2020) A review on reversible quantum adders. J Netw Comput Appl 170:102810","journal-title":"J Netw Comput Appl"},{"issue":"11","key":"4401_CR14","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/s11128-019-2447-7","volume":"18","author":"F Orts","year":"2019","unstructured":"Orts F, Ortega G, Garz\u00f3n E (2019) An optimized quantum circuit for converting from sign-magnitude to two\u2019s complement. Quantum Inf Process 18(11):332","journal-title":"Quantum Inf Process"},{"key":"4401_CR15","doi-asserted-by":"publisher","first-page":"1","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 (2021) Optimal fault-tolerant quantum comparators for image binarization. J Supercomput 77:1\u201312","journal-title":"J Supercomput"},{"key":"4401_CR16","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.neucom.2021.02.102","volume":"470","author":"JD Mart\u00edn-Guerrero","year":"2022","unstructured":"Mart\u00edn-Guerrero JD, Lamata L (2022) Quantum machine learning: a tutorial. Neurocomputing 470:457\u2013461","journal-title":"Neurocomputing"},{"issue":"6866","key":"4401_CR17","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1038\/414883a","volume":"414","author":"LM Vandersypen","year":"2001","unstructured":"Vandersypen LM, Steffen M, Breyta G, Yannoni CS, Sherwood MH, Chuang IL (2001) Experimental realization of shor\u2019s quantum factoring algorithm using nuclear magnetic resonance. Nature 414(6866):883\u2013887","journal-title":"Nature"},{"key":"4401_CR18","volume-title":"Digital design and computer architecture, ARM","author":"SL Harris","year":"2015","unstructured":"Harris SL, Harris D (2015) Digital design and computer architecture, ARM. Morgan Kaufmann, Burlington"},{"key":"4401_CR19","volume-title":"Digital fundamentals","author":"TL Floyd","year":"2014","unstructured":"Floyd TL (2014) Digital fundamentals, 11th edn. Prentice Hall, Saddle River","edition":"11"},{"key":"4401_CR20","volume-title":"Computer architecture: a quantitative approach","author":"JL Hennessy","year":"2011","unstructured":"Hennessy JL, Patterson DA (2011) Computer architecture: a quantitative approach. Elsevier, Amsterdam"},{"key":"4401_CR21","unstructured":"Cheng K-W, Tseng C-C (2002) Quantum plain and carry look-ahead adders. arXiv preprint quant-ph\/0206028"},{"key":"4401_CR22","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 (2018) Quantum computing in the NISQ era and beyond. Quantum 2:79","journal-title":"Quantum"},{"key":"4401_CR23","doi-asserted-by":"crossref","unstructured":"Miller DM, Soeken M, Drechsler R (2014) Mapping NCV circuits to optimized Clifford+T circuits. In: International Conference on Reversible Computation, pp. 163\u2013175 . Springer","DOI":"10.1007\/978-3-319-08494-7_13"},{"issue":"6","key":"4401_CR24","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 (2013) 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","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"issue":"10","key":"4401_CR25","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 (2014) Polynomial-time t-depth optimization of clifford+ T circuits via matroid partitioning. IEEE Trans Comput Aided Des Integr Circuits Syst 33(10):1476\u20131489","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"key":"4401_CR26","doi-asserted-by":"crossref","unstructured":"Paler A, Oumarou O, Basmadjian R (2021) On the realistic worst case analysis of quantum arithmetic circuits. arXiv preprint arXiv:2101.04764","DOI":"10.1109\/TQE.2022.3163624"},{"key":"4401_CR27","unstructured":"F\u00f6sel T, Niu MY, Marquardt F, Li L (2021) Quantum circuit optimization with deep reinforcement learning. arXiv preprint arXiv:2103.07585"},{"issue":"2","key":"4401_CR28","doi-asserted-by":"publisher","first-page":"022406","DOI":"10.1103\/PhysRevA.102.022406","volume":"102","author":"A Kissinger","year":"2020","unstructured":"Kissinger A, van de Wetering J (2020) Reducing the number of non-clifford gates in quantum circuits. Phys Rev A 102(2):022406","journal-title":"Phys Rev A"},{"key":"4401_CR29","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 (2018) Halving the cost of quantum addition. Quantum 2:74","journal-title":"Quantum"},{"key":"4401_CR30","first-page":"100457","volume":"29","author":"H Thapliyal","year":"2021","unstructured":"Thapliyal H, Mu\u00f1oz-Coreas E, Khalus V (2021) Quantum circuit designs of carry lookahead adder optimized for T-count T-depth and qubits. Sustain Comput Inf Syst 29:100457","journal-title":"Sustain Comput Inf Syst"},{"key":"4401_CR31","doi-asserted-by":"crossref","unstructured":"Bhattacharjee D, Saki AA, Alam M, Chattopadhyay A, Ghosh S (2019) MUQUT: Multi-constraint quantum circuit mapping on NISQ computers. In: 2019 IEEE\/ACM International Conference on Computer-Aided Design (ICCAD), pp. 1\u20137 . IEEE","DOI":"10.1109\/ICCAD45719.2019.8942132"},{"key":"4401_CR32","doi-asserted-by":"publisher","first-page":"592","DOI":"10.22331\/q-2021-11-26-592","volume":"5","author":"P Czarnik","year":"2021","unstructured":"Czarnik P, Arrasmith A, Coles PJ, Cincio L (2021) Error mitigation with clifford quantum-circuit data. Quantum 5:592","journal-title":"Quantum"},{"key":"4401_CR33","doi-asserted-by":"crossref","unstructured":"Mirizadeh SMA, Asghari P (2021) Fault-tolerant quantum reversible full adder\/subtractor: Design and implementation. Optik, 168543","DOI":"10.1016\/j.ijleo.2021.168543"},{"issue":"2","key":"4401_CR34","doi-asserted-by":"publisher","first-page":"025003","DOI":"10.1088\/2058-9565\/aa66eb","volume":"2","author":"A Paler","year":"2017","unstructured":"Paler A, Polian I, Nemoto K, Devitt SJ (2017) Fault-tolerant, high-level quantum circuits: form, compilation and description. Quantum Sci Technol 2(2):025003","journal-title":"Quantum Sci Technol"},{"issue":"5","key":"4401_CR35","doi-asserted-by":"publisher","first-page":"052316","DOI":"10.1103\/PhysRevA.62.052316","volume":"62","author":"X Zhou","year":"2000","unstructured":"Zhou X, Leung DW, Chuang IL (2000) Methodology for quantum logic gate construction. Phys Rev A 62(5):052316","journal-title":"Phys Rev A"},{"issue":"3","key":"4401_CR36","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0020-0190(00)00084-3","volume":"75","author":"PO Boykin","year":"2000","unstructured":"Boykin PO, Mor T, Pulver M, Roychowdhury V, Vatan F (2000) A new universal and fault-tolerant quantum basis. Inf Process Lett 75(3):101\u2013107","journal-title":"Inf Process Lett"},{"key":"4401_CR37","unstructured":"Pai Y, Chen Y (2004) The fastest carry lookahead adder. In: Proceedings. DELTA 2004. Second IEEE International Workshop on Electronic Design, Test and Applications, pp. 434\u2013436"},{"key":"4401_CR38","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.vlsi.2016.11.009","volume":"57","author":"M Bahadori","year":"2017","unstructured":"Bahadori M, Kamal M, Afzali-Kusha A, Afsharnezhad Y, Salehi EZ (2017) CL-CPA: a hybrid carry-lookahead\/carry-propagate adder for low-power or high-performance operation mode. Integration 57:62\u201368","journal-title":"Integration"},{"key":"4401_CR39","doi-asserted-by":"crossref","unstructured":"Lye A, Wille R, Drechsler R (2015) Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits. In: The 20th Asia and South Pacific Design Automation Conference, pp. 178\u2013183 . IEEE","DOI":"10.1109\/ASPDAC.2015.7059001"},{"issue":"4","key":"4401_CR40","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1109\/TCAD.2008.917562","volume":"27","author":"D Maslov","year":"2008","unstructured":"Maslov D, Falconer SM, Mosca M (2008) Quantum circuit placement. IEEE Trans Comput Aided Des Integr Circuits Syst 27(4):752\u2013763","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"key":"4401_CR41","unstructured":"Draper TG, Kutin SA, Rains EM, Svore KM (2004) A logarithmic-depth quantum carry-lookahead adder. arXiv preprint quant-ph\/0406142"},{"key":"4401_CR42","doi-asserted-by":"crossref","unstructured":"Lisa NJ, Babu HMH (2015) Design of a compact reversible carry look-ahead adder using dynamic programming. In: 2015 28th International Conference on VLSI Design, pp. 238\u2013243 . IEEE","DOI":"10.1109\/VLSID.2015.46"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04401-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04401-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04401-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,4]],"date-time":"2022-07-04T14:09:00Z","timestamp":1656943740000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04401-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,16]]},"references-count":42,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["4401"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04401-x","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2022,3,16]]},"assertion":[{"value":"22 February 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}