{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T11:37:35Z","timestamp":1725017855878},"reference-count":20,"publisher":"Association for Computing Machinery (ACM)","issue":"4","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. Emerg. Technol. Comput. Syst."],"published-print":{"date-parts":[[2010,12]]},"abstract":"\n Reversible logic has applications in various research areas, including signal processing, cryptography and quantum computation. In this article, direct NCT-based synthesis of a given\n k<\/jats:italic>\n -cycle in a cycle-based synthesis scenario is examined. To this end, a set of seven building blocks is proposed that reveals the potential of direct synthesis of a given permutation to reduce both quantum cost and average runtime. To synthesize a given large cycle, we propose a decomposition algorithm to extract the suggested building blocks from the input specification. Then, a synthesis method is introduced that uses the building blocks and the decomposition algorithm. Finally, a hybrid synthesis framework is suggested that uses the proposed cycle-based synthesis method in conjunction with one of the recent NCT-based synthesis approaches which is based on Reed-Muller (RM) spectra.\n <\/jats:p>\n The time complexity and the effectiveness of the proposed synthesis approach are analyzed in detail. Our analyses show that the proposed hybrid framework leads to a better quantum cost in the worst-case scenario compared to the previously presented methods. The proposed framework always converges and typically synthesizes a given specification very fast compared to the available synthesis algorithms. Besides, the quantum costs of benchmark functions are improved about 20% on average (55% in the best case).<\/jats:p>","DOI":"10.1145\/1877745.1877747","type":"journal-article","created":{"date-parts":[[2010,12,22]],"date-time":"2010-12-22T14:41:31Z","timestamp":1293028891000},"page":"1-26","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":82,"title":["Reversible circuit synthesis using a cycle-based approach"],"prefix":"10.1145","volume":"6","author":[{"given":"Mehdi","family":"Saeedi","sequence":"first","affiliation":[{"name":"Amirkabir University of Technology, Tehran, Iran"}]},{"given":"Morteza Saheb","family":"Zamani","sequence":"additional","affiliation":[{"name":"Amirkabir University of Technology, Tehran, Iran"}]},{"given":"Mehdi","family":"Sedighi","sequence":"additional","affiliation":[{"name":"Amirkabir University of Technology, Tehran, Iran"}]},{"given":"Zahra","family":"Sasanian","sequence":"additional","affiliation":[{"name":"Amirkabir University of Technology, Tehran, Iran"}]}],"member":"320","published-online":{"date-parts":[[2010,12,21]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.52.3457"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.176.0525"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1330521.1330523"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01857727"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.871622"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.53.0183"},{"key":"e_1_2_1_7_1","unstructured":"Maslov D. Dueck G. and Scott N. 2009. Reversible logic synthesis benchmarks page. http:\/\/www.cs.uvic.ca\/~dmaslov\/. Maslov D. Dueck G. and Scott N. 2009. Reversible logic synthesis benchmarks page. http:\/\/www.cs.uvic.ca\/~dmaslov\/."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.847911"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1278349.1278355"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.911334"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2005.249"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.96.170501"},{"key":"e_1_2_1_13_1","unstructured":"Nielsen M. and Chuang I. 2000. Quantum Computation and Quantum Information. Cambridge University Press Cambridge UK. Nielsen M. and Chuang I. 2000. Quantum Computation and Quantum Information. Cambridge University Press Cambridge UK."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1216396.1216399"},{"key":"e_1_2_1_15_1","unstructured":"Saeedi M. Saheb Zamani M. and Sedighi M. 2010. Reversible logic synthesis benchmarks. http:\/\/ceit.aut.ac.ir\/QDA\/benchmarks. Saeedi M. Saheb Zamani M. and Sedighi M. 2010. Reversible logic synthesis benchmarks. http:\/\/ceit.aut.ac.ir\/QDA\/benchmarks."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1509633.1509801"},{"key":"e_1_2_1_17_1","unstructured":"Schrom G. 1998. Ultra-low-power cmos technology. Ph.D. thesis Technischen Universitat Wien. Schrom G. 1998. Ultra-low-power cmos technology. Ph.D. thesis Technischen Universitat Wien."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.855930"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2003.811448"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2003.818324"}],"container-title":["ACM Journal on Emerging Technologies in Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1877745.1877747","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T18:23:38Z","timestamp":1672338218000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1877745.1877747"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["10.1145\/1877745.1877747"],"URL":"https:\/\/doi.org\/10.1145\/1877745.1877747","relation":{},"ISSN":["1550-4832","1550-4840"],"issn-type":[{"value":"1550-4832","type":"print"},{"value":"1550-4840","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12]]},"assertion":[{"value":"2009-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-12-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}
