{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,21]],"date-time":"2026-06-21T00:50:05Z","timestamp":1782003005174,"version":"3.54.5"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031087592","type":"print"},{"value":"9783031087608","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-08760-8_10","type":"book-chapter","created":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T03:06:09Z","timestamp":1655780769000},"page":"122-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Studying the\u00a0Cost of\u00a0n-qubit Toffoli Gates"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4312-3671","authenticated-orcid":false,"given":"Francisco","family":"Orts","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6563-2717","authenticated-orcid":false,"given":"Gloria","family":"Ortega","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0568-5470","authenticated-orcid":false,"given":"Ester M.","family":"Garz\u00f3n","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,6,15]]},"reference":[{"issue":"6","key":"10_CR1","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. Circ. Syst. 32(6), 818\u2013830 (2013)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst."},{"issue":"5","key":"10_CR2","doi-asserted-by":"publisher","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","volume":"52","author":"A Barenco","year":"1995","unstructured":"Barenco, A., et al.: Elementary gates for quantum computation. Phys. Rev. A 52(5), 3457 (1995)","journal-title":"Phys. Rev. A"},{"issue":"6","key":"10_CR3","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"C Bennett","year":"1973","unstructured":"Bennett, C.: Logical reversibility of computation. IBM J. Res. Dev. 17(6), 525\u2013532 (1973)","journal-title":"IBM J. Res. Dev."},{"key":"10_CR4","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)"},{"key":"10_CR5","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":"7","key":"10_CR6","doi-asserted-by":"publisher","first-page":"2350","DOI":"10.1007\/s10773-017-3389-4","volume":"56","author":"Y He","year":"2017","unstructured":"He, Y., Luo, M., Zhang, E., Wang, H., Wang, X.: Decompositions of n-qubit Toffoli gates with linear circuit complexity. Int. J. Theor. Phys. 56(7), 2350\u20132361 (2017)","journal-title":"Int. J. Theor. Phys."},{"issue":"2","key":"10_CR7","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":"2","key":"10_CR8","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1038\/nphys1150","volume":"5","author":"B Lanyon","year":"2009","unstructured":"Lanyon, B., et al.: Simplifying quantum logic using higher-dimensional Hilbert spaces. Nat. Phys. 5(2), 134\u2013140 (2009)","journal-title":"Nat. Phys."},{"issue":"3","key":"10_CR9","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1109\/TCAD.2007.911334","volume":"27","author":"D Maslov","year":"2008","unstructured":"Maslov, D., Dueck, G., Miller, D., Negrevergne, C.: Quantum circuit simplification and level compaction. IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst. 27(3), 436\u2013444 (2008)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst."},{"issue":"4","key":"10_CR10","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. Quant. Inf. Process. 8(4), 297\u2013318 (2009)","journal-title":"Quant. Inf. Process."},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Nielsen, M., Chuang, I.: Quantum computation and quantum information (2002)","DOI":"10.1119\/1.1463744"},{"key":"10_CR12","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.F., Garz\u00f3n, E.M.: A review on reversible quantum adders. J. Netw. Comput. Appl. 170, 102810 (2020)","journal-title":"J. Netw. Comput. Appl."},{"issue":"8","key":"10_CR13","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.C., Filatovas, E., Garz\u00f3n, E.M.: Optimal fault-tolerant quantum comparators for image binarization. J. Supercomput. 77(8), 8433\u20138444 (2021)","journal-title":"J. Supercomput."},{"issue":"9\u201310","key":"10_CR14","first-page":"747","volume":"20","author":"F Orts","year":"2020","unstructured":"Orts, F., Ortega, G., Garzon, E.M.: Efficient reversible quantum design of sign-magnitude to two\u2019s complement converters. Quant. Inf. Comput. 20(9\u201310), 747\u2013765 (2020)","journal-title":"Quant. Inf. Comput."},{"key":"10_CR15","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"},{"issue":"4","key":"10_CR16","doi-asserted-by":"publisher","first-page":"042302","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":"6","key":"10_CR17","doi-asserted-by":"publisher","first-page":"1802","DOI":"10.1007\/s10773-012-1274-8","volume":"52","author":"R Zhou","year":"2013","unstructured":"Zhou, R., Wu, Q., Zhang, M., Shen, C.: Quantum image encryption and decryption algorithms based on quantum image geometric transformations. Int. J. Theor. Phys. 52(6), 1802\u20131817 (2013)","journal-title":"Int. J. Theor. Phys."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08760-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,21]],"date-time":"2026-06-21T00:10:02Z","timestamp":1782000602000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08760-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031087592","9783031087608"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08760-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"474","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"175","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}