{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T16:50:18Z","timestamp":1781283018756,"version":"3.54.1"},"reference-count":28,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2024,8,1]]},"DOI":"10.1587\/transinf.2023lop0003","type":"journal-article","created":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T22:18:03Z","timestamp":1722464283000},"page":"940-948","source":"Crossref","is-referenced-by-count":1,"title":["New Bounds for Quick Computation of the Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits"],"prefix":"10.1587","volume":"E107.D","author":[{"given":"Takashi","family":"HIRAYAMA","sequence":"first","affiliation":[{"name":"Department of Systems Innovation Engineering, Iwate University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rin","family":"SUZUKI","sequence":"additional","affiliation":[{"name":"Department of Systems Innovation Engineering, Iwate University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Katsuhisa","family":"YAMANAKA","sequence":"additional","affiliation":[{"name":"Department of Systems Innovation Engineering, Iwate University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yasuaki","family":"NISHITANI","sequence":"additional","affiliation":[{"name":"Department of Systems Innovation Engineering, Iwate University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] T. Hirayama, R. Suzuki, K. Yamanaka, and Y. Nishitani, \u201cQuick computation of the lower bound on the gate count of toffoli-based reversible logic circuits,\u201d Proc. 53rd ISMVL, Matsue, Japan, pp.153-157, May 2023.","DOI":"10.1109\/ISMVL57333.2023.00038"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[3] P. Gupta, A. Agrawal, and N.K. Jha, \u201cAn algorithm for synthesis of reversible logic circuits,\u201d IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol.25, no.11, pp.2317-2330, Nov. 2006. 10.1109\/tcad.2006.871622","DOI":"10.1109\/TCAD.2006.871622"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[4] K. Iwama, Y. Kambayashi, and S. Yamashita, \u201cTransformation rules for designing CNOT-based quantum circuits,\u201d Proc. 39th Design Automation Conference, USA, pp.419-424, 2002. 10.1145\/514022.514026","DOI":"10.1145\/513918.514026"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[5] D. Maslov, G.W. Dueck, and D.M. Miller, \u201cToffoli network synthesis with templates,\u201d IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol.24, no.6, pp.807-817, June 2005. 10.1109\/tcad.2005.847911","DOI":"10.1109\/TCAD.2005.847911"},{"key":"5","unstructured":"[6] D. Miller and G. Dueck, \u201cSpectral techniques for reversible logic synthesis,\u201d Proc. 6th Int. Symp. Representations and Methodology of Future Computing Technologies, Trier, Germany, pp.56-62, March 2003."},{"key":"6","doi-asserted-by":"crossref","unstructured":"[7] G.W. Dueck, D. Maslov, and D.M. Miller, \u201cTransformation-based synthesis of networks of Toffoli\/Fredkin gates,\u201d Proc. Canadian Conference on Electrical and Computer Engineering, pp.211-214, vol.1, May 2003.","DOI":"10.1109\/CCECE.2003.1226380"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[8] P. Kerntopf, \u201cA new heuristic algorithm for reversible logic synthesis,\u201d Proc. 41st Design Automation Conference, pp.834-837, 2004. 10.1145\/996566.996789","DOI":"10.1145\/996566.996789"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[9] D. Maslov, G.W. Dueck, and D.M. Miller, \u201cSynthesis of Fredkin-Toffoli reversible networks,\u201d IEEE Trans. VLSI Syst., vol.13, no.6, pp.765-769, June 2005. 10.1109\/tvlsi.2005.844284","DOI":"10.1109\/TVLSI.2005.844284"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[10] H. Thapliyal and N. Ranganathan, \u201cDesign of reversible sequential circuits optimizing quantum cost, delay and garbage outputs,\u201d ACM Journal of Emerging Technologies in Computing Systems, vol.6, no.4, article 14, pp.1-31, Dec. 2010. 10.1145\/1877745.1877748","DOI":"10.1145\/1877745.1877748"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[11] H. Thapliyal and N. Ranganathan, \u201cDesign of efficient reversible logic based binary and BCD adder circuits,\u201d ACM Journal of Emerging Technologies in Computing Systems, vol.9, no.3, pp.17:1-17:31, Oct. 2013. 10.1145\/2491682","DOI":"10.1145\/2491682"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[12] M. Saeedi and I.L. Markov, \u201cSynthesis and optimization of reversible circuits-a survey,\u201d ACM Computing Surveys, vol.45, no.2, article 21, pp.1-34, Feb. 2013. 10.1145\/2431211.2431220","DOI":"10.1145\/2431211.2431220"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[13] K.N. Patel, I.L. Markov, and J.P. Hayes, \u201cOptimal synthesis of linear reversible circuits,\u201d Quantum Information and Computation, vol.8, no.3&4, pp.282-294, March 2008. 10.26421\/qic8.3-4-4","DOI":"10.26421\/QIC8.3-4-4"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[14] N. Abdessaied, M. Amy, R. Drechsler, and M. Soeken, \u201cComplexity of reversible circuits and their quantum implementations,\u201d Theoretical Computer Science, vol.618, pp.85-106, 2016. 10.1016\/j.tcs.2016.01.011","DOI":"10.1016\/j.tcs.2016.01.011"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[15] D. Maslov and G.W. Dueck, \u201cReversible cascades with minimal garbage,\u201d IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol.23, no.11, pp.1497-1509, Nov. 2004. 10.1109\/tcad.2004.836735","DOI":"10.1109\/TCAD.2004.836735"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[16] V.V. Shende, A.K. Prasad, I.L. Markov, and J.P. Hayes, \u201cSynthesis of reversible logic circuits,\u201d IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol.22, no.6, pp.710-722, June 2003. 10.1109\/tcad.2003.811448","DOI":"10.1109\/TCAD.2003.811448"},{"key":"16","unstructured":"[17] M. Soeken, N. Abdessaied, and R. Drechsler, \u201cA framework for reversible circuit complexity,\u201d Proc. International Workshop on Boolean Problems 2014, arXiv:1407.5878, Aug. 2014."},{"key":"17","doi-asserted-by":"crossref","unstructured":"[18] D.V. Zakablukov, \u201cOn asymptotic gate complexity and depth of reversible circuits without additional memory,\u201d arXiv:1504.06876, Feb. 2016.","DOI":"10.1016\/j.jcss.2016.09.010"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[19] S. Popescu, B. Groisman, and S. Massar, \u201cLower bound on the number of Toffoli gates in a classical reversible circuit through quantum information concepts,\u201d Physical Review Letters, vol.95, no.12, pp.120503-1-120503-4, Sept. 2005. 10.1103\/physrevlett.95.120503","DOI":"10.1103\/PhysRevLett.95.120503"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[20] D. Maslov, \u201cOptimal and asymptotically optimal NCT reversible circuits by the gate types,\u201d Quantum Information & Computation, vol.16, no.13&14, pp.1096-1112, Oct. 2016.","DOI":"10.26421\/QIC16.13-14-2"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[21] M. Saeedi, M.S. Zamani, M. Sedighi, and Z. Sasanian, \u201cReversible circuit synthesis using a cycle-based approach,\u201d ACM Journal on Emerging Technologies in Computing Systems, vol.6, no.4, article 13, pp.1-26, Dec. 2010. 10.1145\/1877745.1877747","DOI":"10.1145\/1877745.1877747"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[22] R. Wille and R. Drechsler, \u201cSynthesis of Boolean functions in reversible logic,\u201d in Progress in Applications of Boolean Functions, ed. T. Sasao and J.T. Butler, ch. 4, pp.79-96, Morgan & Claypool Publishers, 2010.","DOI":"10.1007\/978-3-031-79812-2_4"},{"key":"22","unstructured":"[23] N.M. Nayeem and J.E. Rice, \u201cImproved ESOP-based synthesis of reversible logic,\u201d Proc. Reed-Muller 2011 Workshop, Tuusula, Finland, pp.57-62, May 2011."},{"key":"23","unstructured":"[24] M. Higashiohno, T. Hirayama, and Y. Nishitani, \u201cA lower bound on the number of Toffoli gates in reversible logic circuits,\u201d IEICE Trans. Fundamentals of Electronics, Communications and Computer Sciences, vol.J92-A, no.4, pp.263-266, April 2009."},{"key":"24","doi-asserted-by":"publisher","unstructured":"[25] T. Hirayama, H. Sugawara, K. Yamanaka, and Y. Nishitani, \u201cA lower bound on the gate count of Toffoli-based reversible logic circuits,\u201d IEICE Trans. Information and Systems, vol.E97.D, no.9, pp.2253-2261, Sept. 2014. 10.1587\/transinf.2013lop0013","DOI":"10.1587\/transinf.2013LOP0013"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[26] M. Szyprowski and P. Kerntopf, \u201cEstimating the quality of complexity measures in heuristics for reversible logic synthesis,\u201d Proc. IEEE Congress on Evolutionary Computation (CEC) 2010, pp.1-8, July 2010.","DOI":"10.1109\/CEC.2010.5586069"},{"key":"26","doi-asserted-by":"crossref","unstructured":"[27] X. Chen and M.L. Bushnell, \u201cEfficient Branch and Bound Search with Application to Computer-Aided Design,\u201d Springer, 1996. 10.1007\/978-1-4613-1329-8","DOI":"10.1007\/978-1-4613-1329-8"},{"key":"27","unstructured":"[28] M. Davio, J.P. Deschamps, and A. Thayse, \u201cDiscrete and Switching Functions,\u201d McGraw-Hill International, 1978."},{"key":"28","doi-asserted-by":"crossref","unstructured":"[29] T. Sasao, \u201cSwitching Theory For Logic Synthesis,\u201d Kluwer Academic Publishers, Feb. 1999. 10.1007\/978-1-4615-5139-3","DOI":"10.1007\/978-1-4615-5139-3"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E107.D\/8\/E107.D_2023LOP0003\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,25]],"date-time":"2024-11-25T11:32:21Z","timestamp":1732534341000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E107.D\/8\/E107.D_2023LOP0003\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,1]]},"references-count":28,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2024]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2023lop0003","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,1]]},"article-number":"2023LOP0003"}}