{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T04:03:20Z","timestamp":1749528200792,"version":"3.41.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031902024","type":"print"},{"value":"9783031902031","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-90203-1_43","type":"book-chapter","created":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T15:49:11Z","timestamp":1749484151000},"page":"367-372","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Quantum Computing to\u00a0Solve Case Studies in\u00a0Science and\u00a0Engineering"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-6610-2795","authenticated-orcid":false,"given":"Laura\u00a0M.","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"}]}],"member":"297","published-online":{"date-parts":[[2025,6,10]]},"reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"Nielsen, M., Chuang, I.: Quantum computation and quantum information. American Association of Physics Teachers (2002)","DOI":"10.1119\/1.1463744"},{"key":"43_CR2","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":"43_CR3","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":"43_CR4","doi-asserted-by":"crossref","unstructured":"Bernhardt, C.: Quantum Computing for Everyone. The MIT Press, Cambridge (2019). ISBN: 9780262539531 (0262539535)","DOI":"10.7551\/mitpress\/11860.001.0001"},{"issue":"3","key":"43_CR5","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":"43_CR6","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)","journal-title":"Phys. Rev. A"},{"key":"43_CR7","doi-asserted-by":"publisher","unstructured":"Niemann, P., Wille, R., Drechsler, R.: Advanced exact synthesis of Clifford+T circuits. Quant. Inf. Process. 19 (2020). https:\/\/doi.org\/10.1007\/s11128-020-02816-0","DOI":"10.1007\/s11128-020-02816-0"},{"issue":"6","key":"43_CR8","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). https:\/\/doi.org\/10.1109\/tcad.2013.2244643","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"43_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-08494-7_13","volume-title":"Reversible Computation","author":"DM Miller","year":"2014","unstructured":"Miller, D.M., Soeken, M., Drechsler, R.: Mapping NCV circuits to optimized clifford+T circuits. In: Yamashita, S., Minato, S. (eds.) RC 2014. LNCS, vol. 8507, pp. 163\u2013175. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08494-7_13"},{"issue":"10","key":"43_CR10","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."},{"key":"43_CR11","doi-asserted-by":"crossref","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":"43_CR12","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. Sustain. Comput. Inf. Syst. 29, 100457 (2021). https:\/\/doi.org\/10.1016\/j.suscom.2020.100457","journal-title":"Sustain. Comput. Inf. Syst."},{"key":"43_CR13","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":"43_CR14","doi-asserted-by":"publisher","unstructured":"Paler, A., Polian, I., Nemoto, K., Devitt, S.: Fault-tolerant, high-level quantum circuits: form, compilation and description. Quant. Sci. Technol. 2(2) (2017). https:\/\/doi.org\/10.1088\/2058-9565\/aa66eb","DOI":"10.1088\/2058-9565\/aa66eb"},{"key":"43_CR15","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":"43_CR16","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"},{"key":"43_CR17","doi-asserted-by":"publisher","unstructured":"Thapliyal, H., Ranganathan, N., Ferreira, R.: Design of a comparator tree based on reversible logic. In: 2010 10th IEEE Conference on Nanotechnology, pp. 1113\u20131116 (2010). https:\/\/doi.org\/10.1109\/NANO.2010.5697872","DOI":"10.1109\/NANO.2010.5697872"},{"key":"43_CR18","doi-asserted-by":"publisher","first-page":"1572","DOI":"10.1007\/s10825-022-01858-0","volume":"21","author":"H Maity","year":"2022","unstructured":"Maity, H.: Design and implementation of a two-qubit quantum comparator circuit (Q-CC). J. Comput. Electron. 21, 1572\u20138137 (2022). https:\/\/doi.org\/10.1007\/s10825-022-01858-0","journal-title":"J. Comput. Electron."},{"key":"43_CR19","doi-asserted-by":"publisher","unstructured":"Kalita, G., Saikia, N.: Reversible comparator circuit using a new reversible gate. In: Proceedings of the Sixth International Conference on Computer and Communication Technology 2015, pp. 419\u2013423 (2015). https:\/\/doi.org\/10.1145\/2818567.2818685","DOI":"10.1145\/2818567.2818685"},{"issue":"3","key":"43_CR20","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."},{"key":"43_CR21","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"}],"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-90203-1_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T15:49:14Z","timestamp":1749484154000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-90203-1_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031902024","9783031902031"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-90203-1_43","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":"10 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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"}}]}}