{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T03:52:59Z","timestamp":1773201179164,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,8,1]],"date-time":"2008-08-01T00:00:00Z","timestamp":1217548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s11128-008-0081-x","type":"journal-article","created":{"date-parts":[[2008,8,22]],"date-time":"2008-08-22T20:14:40Z","timestamp":1219436080000},"page":"175-192","source":"Crossref","is-referenced-by-count":32,"title":["Heuristic methods to use don\u2019t cares in automated design of reversible and quantum logic circuits"],"prefix":"10.1007","volume":"7","author":[{"given":"Majid","family":"Mohammadi","sequence":"first","affiliation":[]},{"given":"Mohammad","family":"Eshghi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,8,23]]},"reference":[{"issue":"5","key":"81_CR1","doi-asserted-by":"crossref","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 52(5), 3457\u20133467 (1995)","journal-title":"Phys. Rev. A"},{"issue":"6","key":"81_CR2","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"C.H. Bennett","year":"1973","unstructured":"Bennett C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17(6), 525\u2013532 (1973)","journal-title":"IBM J. Res. Dev."},{"key":"81_CR3","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA (1989) ISBN 0201157675"},{"key":"81_CR4","doi-asserted-by":"crossref","unstructured":"Grobe, D., Dueck, G.W., Chen, X., Drechsler, R.: Exact SAT-based Toffoli network synthesis. In: Proceedings of the 17th ACM Great Lakes Symposium on VLSI (GLSVLSI\u201907), Stresa-Lago Maggiore, Italy, pp. 96\u2013101 (2007)","DOI":"10.1145\/1228784.1228812"},{"issue":"11","key":"81_CR5","doi-asserted-by":"crossref","first-page":"2317","DOI":"10.1109\/TCAD.2006.871622","volume":"25","author":"P. Gupta","year":"2006","unstructured":"Gupta P., Agrawal A., Jha N.K.: An algorithm for synthesis of reversible logic circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25(11), 2317\u20132330 (2006)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"3","key":"81_CR6","doi-asserted-by":"crossref","first-page":"282","DOI":"10.3844\/ajassp.2008.282.288","volume":"5","author":"M. Haghprast","year":"2008","unstructured":"Haghprast M., Navi K.: A novel reversible BCD adder for nanotechnology based systems. Am. J.~Appl. Sci. 5(3), 282\u2013288 (2008)","journal-title":"Am. J.~Appl. Sci."},{"key":"81_CR7","doi-asserted-by":"crossref","unstructured":"Kerntopf, P.: A new heuristic algorithm for reversible logic synthesis. In: Annual ACM IEEE Design Automation Conference. Proceedings of the 41st Annual Conference on Design Automation, San Diego, CA, USA, pp. 834\u2013837 (2004). ISBN 1-58113-828-8","DOI":"10.1145\/996566.996789"},{"key":"81_CR8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1147\/rd.53.0183","volume":"5","author":"R. Landauer","year":"1961","unstructured":"Landauer R.: Irreversibility and heat generation in the computing processes. IBM J. Res. Dev. 5, 183\u2013191 (1961)","journal-title":"IBM J. Res. Dev."},{"key":"81_CR9","unstructured":"Lee, S., Lee, S.J., Kim, T., Lee, J.-S., Biamonte, J., Perkowski, M.: The cost of quantum gate primitives. J. Multi-Valued Logic Soft Comput. 12(5\u20136) (2006)"},{"issue":"3\u20134","key":"81_CR10","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1023\/B:AIRE.0000006605.86111.79","volume":"20","author":"M. Lukac","year":"2003","unstructured":"Lukac M., Perkowski M., Gol H.: Evolutionary approach to quantum and reversible circuits synthesis. Artif. Intell. Rev. 20(3\u20134), 361\u2013417 (2003)","journal-title":"Artif. Intell. Rev."},{"key":"81_CR11","unstructured":"Lukac, M., Pivtoraiko, M., Mishchenko, A., Perkowski, M.: Automated synthesis of generalized reversible cascades using genetic algorithms. In: Proceedings of the Fifth International Workshop on Boolean Problems, Freiberg, Sachsen, Germany, 19\u201320 September, pp. 33\u201345 (2006)"},{"key":"81_CR12","unstructured":"Maslov, D., Dueck, G.W.: Garbage in reversible design of multiple output functions. In: 6th International Symposium on Representations and Methodology of Future Computing Technologies, Trier, Germany, pp. 162\u2013170 (2003)"},{"key":"81_CR13","doi-asserted-by":"crossref","unstructured":"Miller, D.M., Dueck, G.W., Maslov, D.: A transformation based algorithm for reversible logic synthesis. In: Proceedings of the 40th Design Automation Conference, Anaheim, CA, pp. 318\u2013323 (2003)","DOI":"10.1145\/775832.775915"},{"key":"81_CR14","unstructured":"Mohamadi, M., Eshghi, M., Navi, K.: Optimizing the reversible full adder circuit. In: Proceedings of the IEEE East-West on Design and Tests (EWDTS), Yerevan, Armenia, 7\u201310 September, pp. 312\u2013315 (2007)"},{"issue":"1","key":"81_CR15","first-page":"49","volume":"5","author":"V.V. Shende","year":"2005","unstructured":"Shende V.V., Markov I.L.: Quantum circuits for incompletely specified two-qubit operators. Quantum Inf. Comput. 5(1), 49\u201357 (2005)","journal-title":"Quantum Inf. Comput."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s11128-008-0081-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/article\/10.1007\/s11128-008-0081-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s11128-008-0081-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T17:01:03Z","timestamp":1738342863000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/10.1007\/s11128-008-0081-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["81"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/s11128-008-0081-x","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8]]}}}