{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T12:16:01Z","timestamp":1783080961892,"version":"3.54.6"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030214999","type":"print"},{"value":"9783030215002","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-21500-2_12","type":"book-chapter","created":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T23:02:48Z","timestamp":1560726168000},"page":"191-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Evaluating ESOP Optimization Methods in Quantum Compilation Flows"],"prefix":"10.1007","author":[{"given":"Giulia","family":"Meuli","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bruno","family":"Schmitt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R\u00fcdiger","family":"Ehlers","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Heinz","family":"Riener","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giovanni","family":"De Micheli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,5,23]]},"reference":[{"issue":"6","key":"12_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."},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-14295-6_5","volume-title":"Computer Aided Verification","author":"R Brayton","year":"2010","unstructured":"Brayton, R., Mishchenko, A.: ABC: an academic industrial-strength verification tool. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 24\u201340. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-14295-6_5"},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.3934\/amc.2008.2.183","volume":"2","author":"A Vos De","year":"2008","unstructured":"De Vos, A., Van Rentergem, Y.: Young subgroups for reversible computers. Adv. Math. Commun. 2(2), 183\u2013200 (2008)","journal-title":"Adv. Math. Commun."},{"issue":"9","key":"12_CR4","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1109\/12.795226","volume":"48","author":"R Drechsler","year":"1999","unstructured":"Drechsler, R.: Pseudo-kronecker expressions for symmetric functions. IEEE Trans. Comput. 48(9), 987\u2013990 (1999)","journal-title":"IEEE Trans. Comput."},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-642-20520-0_16","volume-title":"Applications of Evolutionary Computation","author":"R Drechsler","year":"2011","unstructured":"Drechsler, R., Finder, A., Wille, R.: Improving ESOP-based synthesis of reversible logic using evolutionary algorithms. In: Di Chio, C., et al. (eds.) EvoApplications 2011. LNCS, vol. 6625, pp. 151\u2013161. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-20520-0_16"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Fazel, K., Thornton, M., Rice, J.E.: ESOP-based Toffoli gate cascade generation. In: IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, pp. 206\u2013209 (2007)","DOI":"10.1109\/PACRIM.2007.4313212"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-319-99498-7_11","volume-title":"Reversible Computation","author":"T Haener","year":"2018","unstructured":"Haener, T., Soeken, M., Roetteler, M., Svore, K.M.: Quantum circuits for floating-point arithmetic. In: Kari, J., Ulidowski, I. (eds.) RC 2018. LNCS, vol. 11106, pp. 162\u2013174. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-99498-7_11"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-319-94144-8_26","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2018","author":"A Ignatiev","year":"2018","unstructured":"Ignatiev, A., Morgado, A., Marques-Silva, J.: PySAT: a Python toolkit for prototyping with SAT oracles. In: Beyersdorff, O., Wintersteiger, C.M. (eds.) SAT 2018. LNCS, vol. 10929, pp. 428\u2013437. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-94144-8_26"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"JavadiAbhari, A., et al.: ScaffCC: a framework for compilation and analysis of quantum computing programs. In: Proceedings of the 11th ACM Conference on Computing Frontiers, p. 1. ACM (2014)","DOI":"10.1145\/2597917.2597939"},{"key":"12_CR10","unstructured":"Li, C.M., Many\u00e0, F.: MaxSAT, hard and soft constraints. In: Handbook of Satisfiability, pp. 613\u2013631 (2009)"},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"022311","DOI":"10.1103\/PhysRevA.93.022311","volume":"93","author":"D Maslov","year":"2016","unstructured":"Maslov, D.: Advantages of using relative-phase Toffoli gates with an application to multiple control Toffoli optimization. Phys. Rev. A 93(2), 022311 (2016)","journal-title":"Phys. Rev. A"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Miller, D.M., Wille, R., Drechsler, R.: Reducing reversible circuit cost by adding lines. In: 2010 40th IEEE International Symposium on Multiple-Valued Logic, pp. 217\u2013222. IEEE (2010)","DOI":"10.1109\/ISMVL.2010.48"},{"issue":"2","key":"12_CR13","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1109\/TCAD.2006.887925","volume":"26","author":"A Mishchenko","year":"2007","unstructured":"Mishchenko, A., Chatterjee, S., Brayton, R.K.: Improvements to technology mapping for LUT-based FPGAs. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 26(2), 240\u2013253 (2007)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circ. Syst."},{"key":"12_CR14","unstructured":"Mishchenko, A., Perkowski, M.: Fast heuristic minimization of exclusive-sums-of-products. In: Proceedings of International Workshop on Applications of the Reed-Muller Expansion in Circuit Design, pp. 242\u2013250 (2001)"},{"issue":"02","key":"12_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1142\/S0218126607003605","volume":"16","author":"T Mizuki","year":"2007","unstructured":"Mizuki, T., Otagiri, T., Sone, H.: An application of ESOP expressions to secure computations. J. Circ. Syst. Comput. 16(02), 191\u2013198 (2007)","journal-title":"J. Circ. Syst. Comput."},{"issue":"10","key":"12_CR16","doi-asserted-by":"publisher","first-page":"1850163","DOI":"10.1142\/S0218126618501633","volume":"27","author":"K Papakonstantinou","year":"2018","unstructured":"Papakonstantinou, K., Papakonstantinou, G.: A nonlinear integer programming approach for the minimization of boolean expressions. J. Circ. Syst. Comput. 27(10), 1850163 (2018)","journal-title":"J. Circ. Syst. Comput."},{"key":"12_CR17","unstructured":"Perkowski, M., Chrzanowska-Jeske, M.: An exact algorithm to minimize mixed-radix exclusive sums of products for incompletely specified Boolean functions. In: ISCAS, pp. 1652\u20131655 (1990)"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-319-20860-2_20","volume-title":"Reversible Computation","author":"M Rawski","year":"2015","unstructured":"Rawski, M.: Application of functional decomposition in synthesis of reversible circuits. In: Krivine, J., Stefani, J.-B. (eds.) RC 2015. LNCS, vol. 9138, pp. 285\u2013290. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-20860-2_20"},{"key":"12_CR19","unstructured":"Riener, H., Ehlers, R., Schmitt, B., De Micheli, G.: Exact synthesis of ESOP forms. CoRR abs\/1807.11103 (2018). \n                      http:\/\/arxiv.org\/abs\/1807.11103"},{"issue":"5","key":"12_CR20","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1109\/43.277608","volume":"12","author":"T Sasao","year":"1993","unstructured":"Sasao, T.: EXMIN2: a simplification algorithm for exclusive-or-sum-of-products expressions for multiple-valued-input two-valued-output functions. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 12(5), 621\u2013632 (1993)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circ. Syst."},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-1-4613-1385-4_2","volume-title":"Representations of Discrete Functions","author":"T Sasao","year":"1996","unstructured":"Sasao, T.: Representations of logic functions using EXOR operators. In: Sasao, T., Fujita, M. (eds.) Representations of Discrete Functions, pp. 29\u201354. Springer, Boston (1996). \n                      https:\/\/doi.org\/10.1007\/978-1-4613-1385-4_2"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Soeken, M., Haener, T., Roetteler, M.: Programming quantum computers using design automation. In: Design, Automation & Test in Europe Conference & Exhibition (DATE), pp. 137\u2013146. IEEE (2018)","DOI":"10.23919\/DATE.2018.8341993"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Soeken, M., Mozafari, F., Schmitt, B., De Micheli, G.: Compiling permutations for superconducting QPUs. In: DATE (2019, to appear)","DOI":"10.23919\/DATE.2019.8715275"},{"key":"12_CR24","unstructured":"Soeken, M., Riener, H., Haaswijk, W., Micheli, G.D.: The EPFL logic synthesis libraries. CoRR abs\/1805.05121 (2018). \n                      http:\/\/arxiv.org\/abs\/1805.05121"},{"key":"12_CR25","unstructured":"Soeken, M., Roetteler, M., Wiebe, N., De Micheli, G.: Logic synthesis for quantum computing. CoRR abs\/1706.02721 (2017). \n                      http:\/\/arxiv.org\/abs\/1706.02721"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Soeken, M., Roetteler, M., Wiebe, N., De Micheli, G.: LUT-based hierarchical reversible logic synthesis. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. (2018)","DOI":"10.1109\/TCAD.2018.2859251"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Stergiou, S., Daskalakis, K., Papakonstantinou, G.: A fast and efficient heuristic ESOP minimization algorithm. In: Proceedings of the 14th ACM Great Lakes symposium on VLSI, pp. 78\u201381. ACM (2004)","DOI":"10.1145\/988952.988971"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Wille, R., Soeken, M., Otterstedt, C., Drechsler, R.: Improving the mapping of reversible circuits to quantum circuits using multiple target lines. In: 2013 18th Asia and South Pacific Design Automation Conference (ASP-DAC), pp. 145\u2013150. IEEE (2013)","DOI":"10.1109\/ASPDAC.2013.6509587"},{"key":"12_CR29","first-page":"9","volume":"34","author":"I Zhegalkin","year":"1927","unstructured":"Zhegalkin, I.: The technique of calculation of statementsin symbolic logic. Mathe. Sbornik. 34, 9\u201328 (1927). (in Russian)","journal-title":"Mathe. Sbornik."}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21500-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T23:15:36Z","timestamp":1560726936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-21500-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030214999","9783030215002"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21500-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reversible Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lausanne","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/reversible-computation.github.io\/","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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"22","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"55% - 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"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"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"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"One invited paper is included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}