{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T02:03:16Z","timestamp":1780711396217,"version":"3.54.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319084930","type":"print"},{"value":"9783319084947","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08494-7_12","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T14:50:00Z","timestamp":1404571800000},"page":"149-162","source":"Crossref","is-referenced-by-count":27,"title":["Quantum Circuit Optimization by Hadamard Gate Reduction"],"prefix":"10.1007","author":[{"given":"Nabila","family":"Abdessaied","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mathias","family":"Soeken","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rolf","family":"Drechsler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1907","key":"12_CR1","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1098\/rspa.1992.0167","volume":"439","author":"D. Deutsch","year":"1992","unstructured":"Deutsch, D., Jozsa, R.: Rapid solution of problems by quantum computation. Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences\u00a0439(1907), 553\u2013558 (1992)","journal-title":"Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. Foundations of Computer Science, 124\u2013134 (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.1109\/TCAD.2005.855930","volume":"25","author":"V.V. Shende","year":"2006","unstructured":"Shende, V.V., Bullock, S.S., Markov, I.L.: Synthesis of quantum-logic circuits. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems\u00a025, 1000\u20131010 (2006)","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"issue":"7-8","key":"12_CR4","doi-asserted-by":"crossref","first-page":"607","DOI":"10.26421\/QIC13.7-8-4","volume":"13","author":"V. Kliuchnikov","year":"2013","unstructured":"Kliuchnikov, V., Maslov, D., Mosca, M.: Fast and efficient exact synthesis of single-qubit unitaries generated by Clifford and T gates. Quantum Information & Computation\u00a013(7-8), 607\u2013630 (2013)","journal-title":"Quantum Information & Computation"},{"key":"12_CR5","unstructured":"Jones, N.C.: Logic synthesis for fault-tolerant quantum computers. arXiv preprint arXiv:1310.7290 (2013)"},{"issue":"5","key":"12_CR6","doi-asserted-by":"publisher","first-page":"52312","DOI":"10.1103\/PhysRevA.80.052312","volume":"80","author":"A.G. Fowler","year":"2009","unstructured":"Fowler, A.G., Stephens, A.M., Groszkowski, P.: High-threshold universal quantum computation on the surface code. Physical Review A\u00a080(5), 52312 (2009)","journal-title":"Physical Review A"},{"issue":"6","key":"12_CR7","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. on CAD of Integrated Circuits and Systems\u00a032(6), 818\u2013830 (2013)","journal-title":"IEEE Trans. on CAD of Integrated Circuits and Systems"},{"key":"12_CR8","unstructured":"Gosset, D., Kliuchnikov, V., Mosca, M., Russo, V.: An algorithm for the T-count. arXiv preprint arXiv:1308.4134 (2013)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Amy, M., Maslov, D., Mosca, M.: Polynomial-time T-depth optimization of Clifford+T circuits via matroid partitioning. arXiv preprint arXiv:1303.2042 (2013)","DOI":"10.1109\/TCAD.2014.2341953"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/3-540-10003-2_104","volume-title":"Automata, Languages and Programming","author":"T. Toffoli","year":"1980","unstructured":"Toffoli, T.: Reversible Computing. In: de Bakker, J., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol.\u00a085, pp. 632\u2013644. Springer, Heidelberg (1980)"},{"issue":"6","key":"12_CR11","first-page":"710","volume":"22","author":"V.V. Shende","year":"2003","unstructured":"Shende, V.V., Prasad, A.K., Markov, I.L., Hayes, J.P.: Synthesis of reversible logic circuits. TCAD\u00a022(6), 710\u2013722 (2003)","journal-title":"TCAD"},{"key":"12_CR12","unstructured":"Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge Univ. Press (2000)"},{"key":"12_CR13","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., DiVinchenzo, D., Margolus, N., Shor, P., Sleator, T., Smolin, J., Weinfurter, H.: Elementary gates for quantum computation. Physical Review A\u00a052, 3457\u20133467 (1995)","journal-title":"Physical Review A"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Sasanian, Z., Wille, R., Miller, D.M., Drechsler, R.: Realizing reversible circuits using a new class of quantum gates. In: Design Automation Conference, pp. 36\u201341 (2012)","DOI":"10.1145\/2228360.2228368"},{"issue":"4","key":"12_CR15","doi-asserted-by":"publisher","first-page":"42302","DOI":"10.1103\/PhysRevA.87.042302","volume":"87","author":"P. Selinger","year":"2013","unstructured":"Selinger, P.: Quantum circuits of T-depth one. Physical Review A\u00a087(4), 42302 (2013)","journal-title":"Physical Review A"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Miller, D.M., Maslov, D., Dueck, G.W.: A transformation based algorithm for reversible logic synthesis. In: Design Automation Conference, pp. 318\u2013323 (2003)","DOI":"10.1145\/775914.775915"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Fazel, K., Thornton, M., Rice, J.: ESOP-based Toffoli gate cascade generation. In: IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. PacRim 2007, pp. 206\u2013209 (2007)","DOI":"10.1109\/PACRIM.2007.4313212"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Soeken, M., Wille, R., Hilken, C., Przigoda, N., Drechsler, R.: Synthesis of reversible circuits with minimal lines for large functions. In: Asia and South Pacific Design Automation Conference, pp. 59\u201370 (2012)","DOI":"10.1109\/ASPDAC.2012.6165069"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Wille, R., Gro\u00dfe, D., Dueck, G., Drechsler, R.: Reversible logic synthesis with output permutation. In: 2009 22nd International Conference on VLSI Design, pp. 189\u2013194 (2009)","DOI":"10.1109\/VLSI.Design.2009.40"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Maslov, D., Dueck, G., Miller, D.: Simplification of Toffoli networks via templates. In: Proceedings of the 16th Symposium on Integrated Circuits and Systems Design, pp. 53\u201358 (2003)","DOI":"10.1109\/SBCCI.2003.1232806"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Wille, R., Soeken, M., Drechsler, R.: Reducing the number of lines in reversible circuits. In: IEEE Design Automation Conference, pp. 647\u2013652 (2010)","DOI":"10.1145\/1837274.1837439"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-642-38986-3_18","volume-title":"Reversible Computation","author":"N. Abdessaied","year":"2013","unstructured":"Abdessaied, N., Wille, R., Soeken, M., Drechsler, R.: Reducing the depth of quantum circuits using additional circuit lines. In: Dueck, G.W., Miller, D.M. (eds.) RC 2013. LNCS, vol.\u00a07948, pp. 221\u2013233. Springer, Heidelberg (2013)"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Soeken, M., Wille, R., Dueck, G., Drechsler, R.: Window optimization of reversible and quantum circuits. In: 2010 IEEE 13th International Symposium on Design and Diagnostics of Electronic Circuits and Systems, pp. 341\u2013345 (2010)","DOI":"10.1109\/DDECS.2010.5491754"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-642-36315-3_9","volume-title":"Reversible Computation","author":"Z. Sasanian","year":"2013","unstructured":"Sasanian, Z., Miller, D.M.: Reversible and quantum circuit optimization: A functional approach. In: Gl\u00fcck, R., Yokoyama, T. (eds.) RC 2012. LNCS, vol.\u00a07581, pp. 112\u2013124. Springer, Heidelberg (2013)"},{"key":"12_CR25","doi-asserted-by":"publisher","first-page":"1790","DOI":"10.1049\/el:20031202","volume":"39","author":"D. Maslov","year":"2003","unstructured":"Maslov, D., Dueck, G.: Improved quantum cost for n-bit Toffoli gates. Electronics Letters\u00a039, 1790 (2003)","journal-title":"Electronics Letters"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Miller, D.M., Wille, R., Sasanian, Z.: Elementary quantum gate realizations for multiple-control Toffoli gates. In: 41st IEEE International Symposium on Multiple-Valued Logic, pp. 217\u2013222 (2011)","DOI":"10.1109\/ISMVL.2011.54"},{"key":"12_CR27","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: Asia and South Pacific Design Automation Conference, pp. 145\u2013150 (2013)","DOI":"10.1109\/ASPDAC.2013.6509587"},{"issue":"3","key":"12_CR28","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 Transactions on Computer-Aided Design of Integrated Circuits and Systems\u00a027(3), 436\u2013444 (2008)","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"12_CR29","doi-asserted-by":"publisher","first-page":"42322","DOI":"10.1103\/PhysRevA.88.042322","volume":"88","author":"M. Soeken","year":"2013","unstructured":"Soeken, M., Miller, D.M., Drechsler, R.: Quantum circuits employing roots of the Pauli matrices. Physical Review A\u00a088, 042322 (2013)","journal-title":"Physical Review A"},{"key":"12_CR30","unstructured":"Soeken, M., Frehse, S., Wille, R., Drechsler, R.: Revkit: A toolkit for reversible circuit design. Journal of Multiple-Valued Logic & Soft Computing\u00a018(1) (2012), RevKit is available at http:\/\/www.revkit.org"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Wille, R., Gro\u00dfe, D., Teuber, L., Dueck, G.W., Drechsler, R.: RevLib: an online resource for reversible functions and reversible circuits. In: 38th IEEE International Symposium on Multiple-Valued Logic, pp. 220\u2013225 (2008), RevLib is available at http:\/\/www.revlib.org","DOI":"10.1109\/ISMVL.2008.43"},{"key":"12_CR32","unstructured":"Maslov, D.: Reversible logic synthesis benchmarks page, http:\/\/webhome.cs.uvic.ca\/~dmaslov\/ (last accessed January 2011)"},{"issue":"4","key":"12_CR33","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/1278349.1278355","volume":"12","author":"D. Maslov","year":"2007","unstructured":"Maslov, D., Dueck, G.W., Miller, D.M.: Techniques for the synthesis of reversible Toffoli networks. ACM Transactions on Design Automation of Electronic Systems (TODAES)\u00a012(4), 42 (2007)","journal-title":"ACM Transactions on Design Automation of Electronic Systems (TODAES)"},{"issue":"2","key":"12_CR34","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. Advances in Mathematics of Communications\u00a02(2), 183\u2013200 (2008)","journal-title":"Advances in Mathematics of Communications"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08494-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T17:49:23Z","timestamp":1746294563000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08494-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319084930","9783319084947"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08494-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}