{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T02:04:29Z","timestamp":1780711469831,"version":"3.54.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319994970","type":"print"},{"value":"9783319994987","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-99498-7_12","type":"book-chapter","created":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T04:45:39Z","timestamp":1534826739000},"page":"175-188","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["SAT-based {CNOT, T} Quantum Circuit Synthesis"],"prefix":"10.1007","author":[{"given":"Giulia","family":"Meuli","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mathias","family":"Soeken","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":[[2018,8,22]]},"reference":[{"issue":"10","key":"12_CR1","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. CAD Integr. Circ. Syst. 33(10), 1476\u20131489 (2014)","journal-title":"IEEE Trans. CAD Integr. Circ. Syst."},{"issue":"6","key":"12_CR2","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. CAD Integr. Circ. Syst. 32(6), 818\u2013830 (2013)","journal-title":"IEEE Trans. CAD Integr. Circ. Syst."},{"key":"12_CR3","unstructured":"Amy, M., Azimzadeh, P., Mosca, M.: On the CNOT-complexity of CNOT-phase circuits. arXiv preprint 1712.01859v1 (2017)"},{"key":"12_CR4","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. IOS Press, Amsterdam (2009)"},{"key":"12_CR5","unstructured":"Boixo, S., et al.: Characterizing quantum supremacy in near-term devices. arXiv preprint arXiv:1608.00263v3 (2017)"},{"issue":"7635","key":"12_CR6","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1038\/541009a","volume":"541","author":"D Castelvecchi","year":"2017","unstructured":"Castelvecchi, D.: Quantum computers ready to leap out of the lab in 2017. Nat. News 541(7635), 9 (2017)","journal-title":"Nat. News"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Moura de","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"issue":"2","key":"12_CR8","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":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/T-C.1975.224082","volume":"24","author":"CR Edwards","year":"1975","unstructured":"Edwards, C.R.: The application of the Rademacher-Walsh transform to Boolean function classification and threshold logic synthesis. IEEE Trans. Comput. 24(1), 48\u201362 (1975)","journal-title":"IEEE Trans. Comput."},{"issue":"7671","key":"12_CR10","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1038\/nature23458","volume":"549","author":"AW Harrow","year":"2017","unstructured":"Harrow, A.W., Montanaro, A.: Quantum computational supremacy. Nature 549(7671), 203\u2013209 (2017)","journal-title":"Nature"},{"issue":"26","key":"12_CR11","doi-asserted-by":"publisher","first-page":"5022","DOI":"10.1103\/PhysRevLett.78.5022","volume":"78","author":"S Hill","year":"1997","unstructured":"Hill, S., Wootters, W.K.: Entanglement of a pair of quantum bits. Phys. Rev. Lett. 78(26), 5022 (1997)","journal-title":"Phys. Rev. Lett."},{"key":"12_CR12","unstructured":"IBM: IBM builds its most powerful universal quantum computing processors (2017). Press release by IBM, posted online 17 May 2017"},{"key":"12_CR13","unstructured":"Intel: Intel delivers 17-qubit superconducting chip with advanced packaging to QuTech (2017). Press release by Intel, posted online 10 October 2017"},{"key":"12_CR14","unstructured":"Kelly, J.: A preview of Bristlecone, Google\u2019s new quantum processor. Google Research Blog (2018)"},{"key":"12_CR15","unstructured":"Knight, W.: IBM rasises the bar with a 50-qubit quantum computer. Sighted at MIT Review Technology (2017). https:\/\/www.technologyreview.com\/s\/609451\/ibm-raises-the-bar-with-a-50-qubit-quantum-computer"},{"key":"12_CR16","volume-title":"The Art of Computer Programming","author":"DE Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol. 3, 2nd edn. Addison-Wesley, Redwood City (1998)","edition":"2"},{"issue":"13","key":"12_CR17","doi-asserted-by":"publisher","first-page":"3305","DOI":"10.1073\/pnas.1618020114","volume":"114","author":"NM Linke","year":"2017","unstructured":"Linke, N.M., Maslov, D., Roetteler, M., Debnath, S., Figgatt, C., Landsman, K.A., Wright, K.E., Monroe, C.: Experimental comparison of two quantum computing architectures. Proc. Nat. Acad. Sci. 114(13), 3305\u20133310 (2017)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"12_CR18","unstructured":"Meuli, G., et al.: Estimating single-target gate T-count using spectral classification. In: International Workshop on Logic and Synthesis (2018)"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Meuli, G., Soeken, M., Roetteler, M., Wiebe, N., De Micheli, G.: A best-fit mapping algorithm to facilitate ESOP-decomposition in Clifford+T quantum network synthesis. In: Proceedings of the 23rd Asia and South Pacific Design Automation Conference, pp. 664\u2013669. IEEE Press (2018)","DOI":"10.1109\/ASPDAC.2018.8297398"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Nam, Y.S., Ross, N.J., Su, Y., Childs, A.M., Maslov, D.: Automated optimization of large quantum circuits with continuous parameters. arXiv preprint arXiv:1710.07345 (2017)","DOI":"10.1038\/s41534-018-0072-4"},{"key":"12_CR21","unstructured":"Patel, K.N., Markov, I.L., Hayes, J.P.: Efficient synthesis of linear reversible circuits. arXiv preprint quant-ph\/0302002 (2003)"},{"issue":"6","key":"12_CR22","doi-asserted-by":"publisher","first-page":"062321","DOI":"10.1103\/PhysRevA.69.062321","volume":"69","author":"VV Shende","year":"2004","unstructured":"Shende, V.V., Markov, I.L., Bullock, S.S.: Minimal universal two-qubit controlled-not-based circuits. Phys. Rev. A 69(6), 062321 (2004)","journal-title":"Phys. Rev. A"},{"issue":"1","key":"12_CR23","first-page":"55","volume":"18","author":"M Soeken","year":"2012","unstructured":"Soeken, M., Frehse, S., Wille, R., Drechsler, R.: RevKit: a toolkit for reversible circuit design. Multiple Valued Logic Soft Comput. 18(1), 55\u201365 (2012)","journal-title":"Multiple Valued Logic Soft Comput."},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Soeken, M., Roetteler, M., Wiebe, N., De Micheli, G.: Design automation and design space exploration for quantum computers. In: Design, Automation and Test in Europe, pp. 470\u2013475 (2017)","DOI":"10.23919\/DATE.2017.7927035"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Soeken, M., Roetteler, M., Wiebe, N., De Micheli, G.: Hierarchical reversible logic synthesis using LUTs. In: Design Automation Conference, pp. 78:1\u201378:6 (2017)","DOI":"10.1145\/3061639.3062261"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99498-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T13:24:52Z","timestamp":1571750692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99498-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319994970","9783319994987"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99498-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}