{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:39:20Z","timestamp":1767339560379,"version":"3.41.2"},"reference-count":35,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Microelectronics Journal"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1016\/j.mejo.2018.08.011","type":"journal-article","created":{"date-parts":[[2018,9,18]],"date-time":"2018-09-18T21:53:19Z","timestamp":1537307599000},"page":"58-68","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":26,"special_numbering":"C","title":["A template-based technique for efficient Clifford+T-based quantum circuit implementation"],"prefix":"10.1016","volume":"81","author":[{"given":"Laxmidhar","family":"Biswal","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/linproxy.fan.workers.dev:443\/https\/orcid.org\/0000-0002-0059-4393","authenticated-orcid":false,"given":"Rakesh","family":"Das","sequence":"additional","affiliation":[]},{"given":"Chandan","family":"Bandyopadhyay","sequence":"additional","affiliation":[]},{"given":"Anupam","family":"Chattopadhyay","sequence":"additional","affiliation":[]},{"given":"Hafizur","family":"Rahaman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.mejo.2018.08.011_bib1","first-page":"124","article-title":"Algorithms for quantum computation: discrete logarithms and factoring","author":"Shor","year":"1994","journal-title":"Found. Comput. Sci."},{"key":"10.1016\/j.mejo.2018.08.011_bib2","series-title":"Theory of Computing","first-page":"212","article-title":"A fast quantum mechanical algorithm for database search","author":"Grover","year":"1996"},{"year":"2000","author":"Nielsen","series-title":"Quantum Computation and Quantum Information","key":"10.1016\/j.mejo.2018.08.011_bib3"},{"key":"10.1016\/j.mejo.2018.08.011_bib4","first-page":"133","article-title":"Using error correction to determine the noise model","author":"Laforest","year":"2007","journal-title":"Mhysical Rev. A"},{"unstructured":"https:\/\/linproxy.fan.workers.dev:443\/http\/www.nature.com\/nature\/journal\/v519\/n7541\/full\/nature14270.html.","key":"10.1016\/j.mejo.2018.08.011_bib5"},{"key":"10.1016\/j.mejo.2018.08.011_bib6","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1147\/rd.53.0183","article-title":"Irreversibility and heat generation in the computing process","volume":"5","author":"Landauer","year":"1961","journal-title":"IBM J. Res. Dev."},{"issue":"7573","key":"10.1016\/j.mejo.2018.08.011_bib7","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1038\/nature15263","article-title":"A two-qubit logic gate in silicon","volume":"526","author":"Veldhorst","year":"2015","journal-title":"Nature"},{"key":"10.1016\/j.mejo.2018.08.011_bib8","first-page":"3457","article-title":"Elementary gates for quantum computation","author":"Barenco","year":"1995","journal-title":"APS Phys. Rev."},{"key":"10.1016\/j.mejo.2018.08.011_bib9","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1038\/nature04279","article-title":"Scalable multiparticle entanglement of trapped ions","author":"Haffner","year":"2005","journal-title":"Nature"},{"key":"10.1016\/j.mejo.2018.08.011_bib10","article-title":"Lecture notes for physics 229: Quantum information and computation","volume":"16","author":"Preskill","year":"1998","journal-title":"Calif. Inst. Technol."},{"key":"10.1016\/j.mejo.2018.08.011_bib11","article-title":"High-fidelity CZ gate for resonator based superconducting quantum computers","volume":"87","author":"Ghosh","year":"2013","journal-title":"Mhys. Rev. A"},{"key":"10.1016\/j.mejo.2018.08.011_bib12","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1038\/nature13171","article-title":"Logic gates at the surface code threshold: superconducting qubits poised for fault-tolerant quantum computing","author":"Barends","year":"2014","journal-title":"Nature"},{"unstructured":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.nature.com\/news\/d-wave-upgrade-how-scientists-are-using-the-world-s-most-controversial-quantum-computer-1.21353.","key":"10.1016\/j.mejo.2018.08.011_bib13"},{"key":"10.1016\/j.mejo.2018.08.011_bib14","series-title":"Proc. Int'l Symp. on Multiple-valued Logic","first-page":"217","article-title":"Elementary quantum gate realizations for multiple-control Toffolli gates","author":"Miller","year":"2011"},{"key":"10.1016\/j.mejo.2018.08.011_bib15","series-title":"Proc. Design Automation Conf.","first-page":"36","article-title":"Realizing reversible circuits using a new class of quantum gates","author":"Sasanian","year":"2012"},{"key":"10.1016\/j.mejo.2018.08.011_bib16","series-title":"Transforming MCT Circuits to NCVW Circuits","first-page":"77","author":"Sasnian","year":"2011"},{"year":"2014","author":"Miller","series-title":"Mapping NCV Circuits to Optimized Clifford+T Circuits","key":"10.1016\/j.mejo.2018.08.011_bib17"},{"key":"10.1016\/j.mejo.2018.08.011_bib18","doi-asserted-by":"crossref","first-page":"2","DOI":"10.22331\/q-2017-04-25-2","article-title":"The surface code with a twist","volume":"1","author":"Yoder","year":"2017","journal-title":"Quantum"},{"key":"10.1016\/j.mejo.2018.08.011_bib19","first-page":"97","article-title":"Quantum accuracy threshold for concatenated distance-3 codes","volume":"6","author":"Aliferis","year":"2006","journal-title":"Quant. Inf. Comput."},{"key":"10.1016\/j.mejo.2018.08.011_bib20","article-title":"Methodology for quantum logic gate construction","volume":"62","author":"Zhou","year":"2000","journal-title":"Mhys. Rev. A"},{"year":"2012","author":"Fowler","series-title":"Time-optimal Quantum Computation","key":"10.1016\/j.mejo.2018.08.011_bib21"},{"key":"10.1016\/j.mejo.2018.08.011_bib22","series-title":"6th International Conference on Reversible Computation, Japan","article-title":"Polynomial-time T-depth optimization of Clifford+T circuits via matroid partitioning","author":"Amy","year":"2014"},{"key":"10.1016\/j.mejo.2018.08.011_bib23","series-title":"International Conference on Reversible Computation","first-page":"163","article-title":"Mapping NCV Circuits to Optimized Clifford+T Circuits","author":"Miller","year":"2014"},{"issue":"6","key":"10.1016\/j.mejo.2018.08.011_bib24","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1109\/TCAD.2013.2244643","article-title":"A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits","volume":"32","author":"Amy","year":"2013","journal-title":"IEEE Trans. CAD"},{"key":"10.1016\/j.mejo.2018.08.011_bib25","article-title":"Quantum circuits of T-depth one","volume":"87","author":"Selinger","year":"2013","journal-title":"Mhys. Rev. A"},{"key":"10.1016\/j.mejo.2018.08.011_bib26","series-title":"Proceedings of the 46th Annual Design Automation Conference","first-page":"270","article-title":"Bdd-based synthesis of reversible logic for large functions","author":"Wille","year":"2009"},{"key":"10.1016\/j.mejo.2018.08.011_bib27","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1038\/nature13171","article-title":"Logic gates at the surface code threshold: superconducting qubits poised for fault-tolerant quantum computing","author":"Barends","year":"2014","journal-title":"Nature"},{"key":"10.1016\/j.mejo.2018.08.011_bib28","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevA.71.022316","article-title":"Universal Quantum Computation with ideal Clifford gates and noisy ancillas","volume":"71","author":"Bravyi","year":"2005","journal-title":"Phys. Rev. A"},{"key":"10.1016\/j.mejo.2018.08.011_bib29","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.entcs.2010.02.006","article-title":"Effect of BDD optimization on synthesis of reversible and quantum logic","volume":"253","author":"Wille","year":"2010","journal-title":"Electron. Notes Theor. Comput. Sci."},{"year":"2001","author":"Somenzi","series-title":"CUDD: CU Decision Diagram Package Release 2.3.1","key":"10.1016\/j.mejo.2018.08.011_bib30"},{"key":"10.1016\/j.mejo.2018.08.011_bib31","series-title":"38th ISMVL","first-page":"220","article-title":"Revlib: an online resources for reversible functions and reversible circuits","author":"Wille","year":"2008"},{"unstructured":"https:\/\/linproxy.fan.workers.dev:443\/http\/www.revkit.org\/.","key":"10.1016\/j.mejo.2018.08.011_bib32"},{"doi-asserted-by":"crossref","unstructured":"S. Shirinzadeh, M. Soeken, D. Groe, and R. Drechsler An adaptive prioritized -preferred evolutionary algorithm for approximate BDD optimization. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '17), pp. 1232-1239.","key":"10.1016\/j.mejo.2018.08.011_bib33","DOI":"10.1145\/3071178.3071281"},{"key":"10.1016\/j.mejo.2018.08.011_bib34","article-title":"On quantum circuits employing roots of the Pauli matrices","volume":"88","author":"Soeken","year":"2013","journal-title":"J. Ref.: Phys. Rev. A"},{"issue":"12","key":"10.1016\/j.mejo.2018.08.011_bib35","doi-asserted-by":"crossref","DOI":"10.1109\/TCAD.2014.2356463","article-title":"Exact reordering of circuit lines for nearest neighbor quantum architectures","volume":"33","author":"Wille","year":"2014","journal-title":"Comput. Aided Des. Integr. Circ. Syst. IEEE Trans."}],"container-title":["Microelectronics Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0026269218300430?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0026269218300430?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T20:24:26Z","timestamp":1751919866000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0026269218300430"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":35,"alternative-id":["S0026269218300430"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.mejo.2018.08.011","relation":{},"ISSN":["1879-2391"],"issn-type":[{"type":"print","value":"1879-2391"}],"subject":[],"published":{"date-parts":[[2018,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A template-based technique for efficient Clifford+T-based quantum circuit implementation","name":"articletitle","label":"Article Title"},{"value":"Microelectronics Journal","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.mejo.2018.08.011","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}