{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T18:00:52Z","timestamp":1773856852249,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"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_13","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T14:50:00Z","timestamp":1404571800000},"page":"163-175","source":"Crossref","is-referenced-by-count":43,"title":["Mapping NCV Circuits to Optimized Clifford+T Circuits"],"prefix":"10.1007","author":[{"given":"D. Michael","family":"Miller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathias","family":"Soeken","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Drechsler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"3319","DOI":"10.1007\/s11128-013-0601-1","volume":"12","author":"M. AlFailakawi","year":"2013","unstructured":"AlFailakawi, M., AlTerkawi, L., Ahmad, I., Hamdan, S.: Line ordering of reversible circuits for linear nearest neighbour realization. Qunatum Inf. Process.\u00a012, 3319\u20133339 (2013)","journal-title":"Qunatum Inf. Process."},{"key":"13_CR2","unstructured":"Amy, M., Maslov, D., Mosca, M.: Polynomial-time T-depth optimization of Clifford+T circuits via matroid partitioning, arXiv:quant-ph\/1303.2042v2 (2013)"},{"issue":"6","key":"13_CR3","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\u00a032(6), 818\u2013830 (2013)","journal-title":"IEEE Trans. on CAD"},{"issue":"5","key":"13_CR4","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., DiVincenzo, D.P., Margolus, N., Shor, P., Sleator, T., Smolin, J.A., Weinfurter, H.: Elementary gates for quantum computation. Phys. Rev. A\u00a052(5), 3457\u20133467 (1995)","journal-title":"Phys. Rev. A"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Cleve, R., Laurent, M., Linden, N., Schrijver, A., Unger, F.: New limits on fault-tolerant quantum computation. In: Foundations of Computer Science, vol.\u00a027, pp. 411\u2013419. IEEE Computer Society (2006)","DOI":"10.1109\/FOCS.2006.50"},{"key":"13_CR6","unstructured":"Chakrabarti, A., Sur-Kolay, S., Chaudhury, A.: Linear nearest neighbor synthesis of reversible circuits by graph partitioning. CoRR, arXiv:1112.0564v2 (2012)"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1038\/35042541","volume":"408","author":"D.P. DiVincenzo","year":"2000","unstructured":"DiVincenzo, D.P., Bacon, D., Kempe, J., Burkard, G., Whaley, K.B.: Universal quantum computation with the exchange interaction. Nature\u00a0408, 339\u2013342 (2000)","journal-title":"Nature"},{"key":"13_CR8","first-page":"1","volume":"16","author":"M.H.A. Khan","year":"2008","unstructured":"Khan, M.H.A.: Cost reduction in nearest neighbour based synthesis of quantum Boolean circuits. Engineering Letters\u00a016, 1\u20135 (2008)","journal-title":"Engineering Letters"},{"key":"13_CR9","unstructured":"Lukac, M.: Quantum Inductive Learning and Quantum Logic Synthesis. BiblioLabsII (2011)"},{"issue":"3","key":"13_CR10","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.W., Miller, D.M., Negrevergne, C.: Quantum circuit simplification and level compaction. IEEE Trans. CAD\u00a027(3), 436\u2013444 (2008)","journal-title":"IEEE Trans. CAD"},{"key":"13_CR11","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press (2000)"},{"issue":"3&4","key":"13_CR12","doi-asserted-by":"crossref","first-page":"282","DOI":"10.26421\/QIC8.3-4-4","volume":"8","author":"K. Patel","year":"2008","unstructured":"Patel, K., Markov, I.L., Hayes, J.P.: Optimal synthesis of linear reversible circuits. Quantum Information and Computation\u00a08(3&4), 282\u2013294 (2008)","journal-title":"Quantum Information and Computation"},{"issue":"1","key":"13_CR13","first-page":"83","volume":"18","author":"Z. Sasanian","year":"2012","unstructured":"Sasanian, Z., Miller, D.M.: Mapping a multiple-control Toffoli gate cascade to an elementary quantum gate circuit. Multiple-Valued Logic and Soft Computing\u00a018(1), 83\u201398 (2012)","journal-title":"Multiple-Valued Logic and Soft Computing"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Selinger, P.: Quantum circuits of T-depth one. Phys. Rev. A\u00a087, 042302 (2013)","DOI":"10.1103\/PhysRevA.87.042302"},{"issue":"6","key":"13_CR15","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 Trans. on CAD\u00a025(6), 1000\u20131010 (2006)","journal-title":"IEEE Trans. on CAD"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Soeken, M., Miller, D.M., Drechsler, R.: Quantum circuits employing roots of the Pauli matrices. Phys. Rev. A\u00a088, 042322 (2013)","DOI":"10.1103\/PhysRevA.88.042322"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-38986-3_16","volume-title":"Reversible Computation","author":"M. Soeken","year":"2013","unstructured":"Soeken, M., Thomsen, M.K.: White dots do matter: Rewriting reversible logic circuits. In: Dueck, G.W., Miller, D.M. (eds.) RC 2013. LNCS, vol.\u00a07948, pp. 196\u2013208. Springer, Heidelberg (2013)"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Weinstein, Y.S.: Non-fault tolerant T-gates for the [7,1,3] quantum error correction code. Phys. Rev. A\u00a087, 032320 (2013)","DOI":"10.1103\/PhysRevA.87.032320"},{"key":"13_CR19","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: Int\u2019l Symp. on Multi-Valued Logic, pp. 220\u2013225 (2008), RevLib is available at www.revlib.org","DOI":"10.1109\/ISMVL.2008.43"}],"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_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,10]],"date-time":"2022-04-10T14:49:31Z","timestamp":1649602171000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08494-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319084930","9783319084947"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08494-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}