{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T04:11:27Z","timestamp":1749615087544,"version":"3.41.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031901997","type":"print"},{"value":"9783031902000","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-90200-0_6","type":"book-chapter","created":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T16:42:35Z","timestamp":1749573755000},"page":"64-75","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing a\u00a0Quantum BCD Adder in\u00a0Terms of\u00a0T-Gates and\u00a0CNOT Gates"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-6610-2795","authenticated-orcid":false,"given":"Laura M.","family":"Donaire","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6563-2717","authenticated-orcid":false,"given":"Gloria","family":"Ortega","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4312-3671","authenticated-orcid":false,"given":"Francisco","family":"Orts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0568-5470","authenticated-orcid":false,"given":"Ester M.","family":"Garz\u00f3n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,11]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","unstructured":"Orts, F., Ortega, G., Garz\u00f3n, E.M.: A faster half subtractor circuit using reversible quantum gates. Baltic J. Modern Comput. 7(1), 99\u2013111 (2019). https:\/\/doi.org\/10.22364\/bjmc.2019.7.1.08","DOI":"10.22364\/bjmc.2019.7.1.08"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Bernhardt, C: Quantum Computing for Everyone. The MIT Press (2019)","DOI":"10.7551\/mitpress\/11860.001.0001"},{"issue":"3","key":"6_CR3","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0020-0190(00)00084-3","volume":"75","author":"P Boykin","year":"2000","unstructured":"Boykin, P., Mor, T., Pulver, M., et al.: A new universal and fault-tolerant quantum basis. Inf. Process. Lett. 75(3), 101\u2013107 (2000). https:\/\/doi.org\/10.1016\/S0020-0190(00)00084-3","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1103\/PhysRevA.57.127","volume":"57","author":"D Gottesman","year":"1998","unstructured":"Gottesman, D.: Theory of fault-tolerant quantum computation. Phys. Rev. A 57(1), 127\u2013137 (1998). https:\/\/doi.org\/10.1103\/PhysRevA.57.127","journal-title":"Phys. Rev. A"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Niemann, P., Wille, R., Drechsler, R.: Advanced exact synthesis of Clifford+T circuits. Quantum Inf. Process. 19 (2020). https:\/\/doi.org\/10.1007\/s11128-020-02816-0","DOI":"10.1007\/s11128-020-02816-0"},{"key":"6_CR6","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1109\/tcad.2013.2244643","DOI":"10.1109\/tcad.2013.2244643"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Miller, D.M., Soeken, M., Drechsler, R.: Mapping NCV circuits to optimized Clifford+T circuits. In: International Conference on Reversible Computation. International Publishing (2014), pp. 163\u2013175. Springer. https:\/\/doi.org\/10.1007\/978-3-319-08494-7-13","DOI":"10.1007\/978-3-319-08494-7-13"},{"key":"6_CR8","doi-asserted-by":"publisher","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","DOI":"10.1109\/tcad.2014.2341953"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Litinski, D.: Magic state distillation: not as costly as you think. Quantum 3, 205 (2019). https:\/\/doi.org\/10.22331\/q-2019-12-02-205","DOI":"10.22331\/q-2019-12-02-205"},{"key":"6_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.suscom.2020.100457","volume":"29","author":"H Thapliyal","year":"2021","unstructured":"Thapliyal, H., Mu\u00f1oz-Coreas, E., Vladislav, K.: Quantum circuit designs of carry lookahead adder optimized for T-count, T-depth and qubits. Sustainable Comput. Inf. Syst. 29, 100457 (2021). https:\/\/doi.org\/10.1016\/j.suscom.2020.100457","journal-title":"Sustainable Comput. Inf. Syst."},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Czarnik, P., Arrasmith, A., Coles, P.J., Cincio, L.: Error mitigation with Clifford quantum-circuit data. Quantum 5, 592 (2021). https:\/\/doi.org\/10.22331\/q-2021-11-26-592","DOI":"10.22331\/q-2021-11-26-592"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Paler, A., Polian, I., Nemoto, K., Devitt, S.: Fault-tolerant, high-level quantum circuits: form, compilation and description. Quantum Sci. Technol. 2(2) (2017). https:\/\/doi.org\/10.1088\/2058-9565\/aa66eb","DOI":"10.1088\/2058-9565\/aa66eb"},{"key":"6_CR13","doi-asserted-by":"publisher","unstructured":"Zhou, X., Leung, D.W., Chuang, I.L.: Methodology for quantum logic gate construction. Phys. Rev. A 62(5) (2000). https:\/\/doi.org\/10.1103\/PhysRevA.62.052316","DOI":"10.1103\/PhysRevA.62.052316"},{"key":"6_CR14","doi-asserted-by":"publisher","unstructured":"Preskill, J.: Quantum Computing in the NISQ era and beyond. Quantum 2(79), (2018). https:\/\/doi.org\/10.22331\/q-2018-08-06-79","DOI":"10.22331\/q-2018-08-06-79"},{"key":"6_CR15","doi-asserted-by":"publisher","unstructured":"Bataille, M.: Quantum circuits of CNOT gates. Quant-Ph 2(79) (2020). https:\/\/doi.org\/10.48550\/arXiv.2009.13247","DOI":"10.48550\/arXiv.2009.13247"},{"issue":"3","key":"6_CR16","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. Emerging Technol. Comput. Syst. 9(3), 1\u201331 (2013). https:\/\/doi.org\/10.1145\/2491682","journal-title":"ACM J. Emerging Technol. Comput. Syst."},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"Orts, F., Ortega, G., Filatovas, E., Garz\u00f3n, E.M.: Implementation of three efficient 4-digit fault-tolerant quantum carry lookahead adders. J. Supercomput. 78 (2022) https:\/\/doi.org\/10.1007\/s11227-022-04401-x","DOI":"10.1007\/s11227-022-04401-x"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. In: 10th Anniversary Edition. Cambridge University Press, 10th edn. (2011)","DOI":"10.1017\/CBO9780511976667"},{"key":"6_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-024-05959-4","author":"LM Donaire","year":"2022","unstructured":"Donaire, L.M., Ortega, G., Garz\u00f3n, E.M., Orts, F.: Lowering the cost of quantum comparator circuits. J. Supercomput. (2022). https:\/\/doi.org\/10.1007\/s11227-024-05959-4","journal-title":"J. Supercomput."},{"key":"6_CR20","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., et al.: Efficient quantum arithmetic operation circuits for quantum image processing. Sci. China Phys. Mech. Astron. 63, 1\u201313 (2020). https:\/\/doi.org\/10.1007\/s11433-020-1582-8","journal-title":"Sci. China Phys. Mech. Astron."},{"key":"6_CR21","doi-asserted-by":"publisher","unstructured":"Gidney, C: Halving the cost of quantum addition. Quantum 2, 74 (2018) https:\/\/doi.org\/10.22331\/q-2018-06-18-74","DOI":"10.22331\/q-2018-06-18-74"},{"key":"6_CR22","unstructured":"Sutor, R.S.: Dancing with Qubits: How quantum computing works and how it can change the world. Packt Publishing Ltd. (2019). ISBN: 978-1-83882-736-6"},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"1759","DOI":"10.1098\/rspa.2000.0585","volume":"456","author":"D Deutsch","year":"2000","unstructured":"Deutsch, D., Hayden, P.: Information flow in entangled quantum systems. Roy. Soc. 456, 1759\u20131774 (2000). https:\/\/doi.org\/10.1098\/rspa.2000.0585","journal-title":"Roy. Soc."},{"issue":"5","key":"6_CR24","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., et al.: Elementary gates for quantum computation. Phys. Rev. A 52(5), 3457\u20133467 (1995). https:\/\/doi.org\/10.1103\/physreva.52.3457","journal-title":"Phys. Rev. A"},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"Thapliyal, H: Mapping of subtractor and adder-subtractor circuits on reversible quantum gates, vol. 9570, pp. 10\u201334. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-662-50412-3-2","DOI":"10.1007\/978-3-662-50412-3-2"},{"key":"6_CR26","doi-asserted-by":"publisher","unstructured":"Orts, F., Ortega, G., Fern\u00e1ndez-Combarro, E., Garz\u00f3n, E.M.: A review on reversible quantum adders. J. Network Comput. Appl. 170 (2020). https:\/\/doi.org\/10.1016\/j.jnca.2020.102810","DOI":"10.1016\/j.jnca.2020.102810"},{"issue":"38","key":"6_CR27","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/43\/38\/382002","volume":"43","author":"MK Thomsen","year":"2010","unstructured":"Thomsen, M.K., Gl\u00fcck, R., Axelsen, H.B.: Reversible arithmetic logic unit for quantum arithmetic. J. Phys. A Math. Theoretical 43(38), 382002 (2010). https:\/\/doi.org\/10.1088\/1751-8113\/43\/38\/382002","journal-title":"J. Phys. A Math. Theoretical"},{"key":"6_CR28","doi-asserted-by":"publisher","unstructured":"Toffoli, T: Reversible computing. In: International Colloquium on Automata, Languages, and Programming, pp. 632\u2013644 (1980). Springer. https:\/\/doi.org\/10.1007\/3-540-10003-2-104","DOI":"10.1007\/3-540-10003-2-104"},{"key":"6_CR29","doi-asserted-by":"publisher","unstructured":"Jones C: Low-overhead constructions for the fault-tolerant Toffoli gate. Phys. Rev. A 87(2) (2013). https:\/\/doi.org\/10.1103\/physreva.87.022328","DOI":"10.1103\/physreva.87.022328"},{"issue":"3","key":"6_CR30","doi-asserted-by":"publisher","first-page":"2770","DOI":"10.1007\/s11227-020-03376-x","volume":"77","author":"G Carrascal","year":"2021","unstructured":"Carrascal, G., Del Barrio, A., Botella, G.: First experiences of teaching quantum computing. J. Supercomput. 77(3), 2770\u20132799 (2021). https:\/\/doi.org\/10.1007\/s11227-020-03376-x","journal-title":"J. Supercomput."},{"issue":"6","key":"6_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-023-2492-3","volume":"18","author":"M Noorallahzadeh","year":"2024","unstructured":"Noorallahzadeh, M., Mosleh, M., Datta, K.: A new design of parity-preserving reversible multipliers based on multiple-control Toffoli synthesis targeting emerging quantum circuits. Front. Comput. Sci. 18(6), 186908 (2024). https:\/\/doi.org\/10.1007\/s11704-023-2492-3","journal-title":"Front. Comput. Sci."},{"key":"6_CR32","doi-asserted-by":"publisher","unstructured":"Morrison, M., Ranganathan, N.: Design of a reversible ALU based on novel programmable reversible logic gate structures. In: 2011 IEEE Computer Society Annual Symposium on VLSI (2011), pp. 126\u2013131. IEEE. https:\/\/doi.org\/10.1109\/ISVLSI.2011.30","DOI":"10.1109\/ISVLSI.2011.30"},{"key":"6_CR33","doi-asserted-by":"publisher","unstructured":"Kotiyal, S., Thapliyal, H., Ranganathan, N.: Mach-Zehnder interferometer based design of all optical reversible binary adder. In: 2012 Design, Automation and Test in Europe Conference and Exhibition (DATE), pp. 721\u2013726. IEEE (2012). https:\/\/doi.org\/10.1109\/DATE.2012.6176564","DOI":"10.1109\/DATE.2012.6176564"},{"issue":"3","key":"6_CR34","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/s10773-022-05017-w","volume":"61","author":"A Slimani","year":"2022","unstructured":"Slimani, A., Benslama, A., Misra, N.: K: Optimal designs of reversible\/quantum decoder circuit using new quantum gates. Int. J. Theoret. Phys. 61(3), 72 (2022). https:\/\/doi.org\/10.1007\/s10773-022-05017-w","journal-title":"Int. J. Theoret. Phys."},{"key":"6_CR35","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.5.013065","author":"W Bujiao","year":"2023","unstructured":"Bujiao, W., Xiaoyu, H., et al.: Optimization of CNOT circuits on limited connectivity architecture. Quantum Phys. (2023). https:\/\/doi.org\/10.1103\/PhysRevResearch.5.013065","journal-title":"Quantum Phys."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2024: Parallel Processing Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-90200-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T16:42:36Z","timestamp":1749573756000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-90200-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031901997","9783031902000"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-90200-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"11 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2024.euro-par.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}