{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T12:52:08Z","timestamp":1760100728377,"version":"3.41.0"},"reference-count":22,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2014,11,18]],"date-time":"2014-11-18T00:00:00Z","timestamp":1416268800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000201","name":"U.S. Department of the Interior","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000201","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011039","name":"Intelligence Advanced Research Projects Activity","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100011039","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. Emerg. Technol. Comput. Syst."],"published-print":{"date-parts":[[2014,11,18]]},"abstract":"<jats:p>\n            Improving circuit realization of known quantum algorithms by CAD techniques has benefits for quantum experimentalists. In this article, the problem of synthesizing a given function on a set of ancillea is addressed. The proposed approach benefits from extensive sharing of cofactors among cubes that appear on function outputs. Accordingly, it can be considered a multilevel logic optimization technique for reversible circuits. In particular, the suggested approach can efficiently implement any\n            <jats:italic>n<\/jats:italic>\n            -input,\n            <jats:italic>m<\/jats:italic>\n            -output lookup table (LUT) by a reversible circuit. This problem has interesting applications in the Shor's number-factoring algorithm and in quantum walk on sparse graphs. Simulation results reveal that the proposed cofactor-sharing synthesis algorithm has a significant impact on reducing the size of modular exponentiation circuits for Shor's quantum factoring algorithm, oracle circuits in quantum walk on sparse graphs, and the well-known MCNC benchmarks.\n          <\/jats:p>","DOI":"10.1145\/2629524","type":"journal-article","created":{"date-parts":[[2014,11,18]],"date-time":"2014-11-18T14:21:03Z","timestamp":1416320463000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Cofactor Sharing for Reversible Logic Synthesis"],"prefix":"10.1145","volume":"11","author":[{"given":"Alireza","family":"Shafaei","sequence":"first","affiliation":[{"name":"University of Southern California, Los Angeles, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehdi","family":"Saeedi","sequence":"additional","affiliation":[{"name":"University of Southern California, Los Angeles, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massoud","family":"Pedram","sequence":"additional","affiliation":[{"name":"University of Southern California, Los Angeles, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,11,18]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1646353.1646375"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"R. Brayton A. L. Sangiovanni-Vincentelli C. T. McMullen and G. D. Hachtel. 1984. Logic Minimization Algorithms for VLSI Synthesis. Kluwer Academic Publishers.   R. Brayton A. L. Sangiovanni-Vincentelli C. T. McMullen and G. D. Hachtel. 1984. Logic Minimization Algorithms for VLSI Synthesis. Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4613-2821-6"},{"key":"e_1_2_1_3_1","first-page":"420","article-title":"Efficient circuits for quantum qalks. Quantum Info","volume":"10","author":"Chiang C.-F.","year":"2010","journal-title":"Comput."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780552"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-9260(94)00007-7"},{"volume-title":"Proceedings of the IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. 206--209","author":"Fazel K.","key":"e_1_2_1_6_1"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.2298\/FUEE1103403L"},{"key":"e_1_2_1_8_1","first-page":"5","article-title":"Constant-optimized quantum circuits for modular multiplication and exponentiation. Quantum Info","volume":"12","author":"Markov I. L.","year":"2012","journal-title":"Comput."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2011.2105555"},{"volume-title":"Proceedings of the Reed-Muller Workshop.","author":"Mishchenko A.","key":"e_1_2_1_10_1"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.2298\/FUEE1103385N"},{"key":"e_1_2_1_12_1","unstructured":"M. A. Nielsen and I. L. Chuang. 2000. Quantum Computation and Quantum Information. Cambridge University Press.   M. A. Nielsen and I. L. Chuang. 2000. Quantum Computation and Quantum Information. Cambridge University Press."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.83.032302"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2431211.2431220"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1877745.1877747"},{"key":"e_1_2_1_16_1","first-page":"109","article-title":"The role of symmetries in adiabatic quantum algorithms. Quantum Info","volume":"10","author":"Schaller G.","year":"2010","journal-title":"Comput."},{"volume-title":"Proceedings of Design, Automation and Test in Europe. 1235--1240","author":"Shafaei A.","key":"e_1_2_1_17_1"},{"volume-title":"Proceedings of the Workshop on Reversible Computation","year":"2010","author":"Soeken M.","key":"e_1_2_1_18_1"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.85.5452"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629911.1629984"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISMVL.2008.43"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.108.130501"}],"container-title":["ACM Journal on Emerging Technologies in Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2629524","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2629524","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:18Z","timestamp":1750230078000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2629524"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,18]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,11,18]]}},"alternative-id":["10.1145\/2629524"],"URL":"https:\/\/doi.org\/10.1145\/2629524","relation":{},"ISSN":["1550-4832","1550-4840"],"issn-type":[{"type":"print","value":"1550-4832"},{"type":"electronic","value":"1550-4840"}],"subject":[],"published":{"date-parts":[[2014,11,18]]},"assertion":[{"value":"2013-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-11-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}