{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T17:41:50Z","timestamp":1773337310057,"version":"3.50.1"},"reference-count":35,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2014,10,6]],"date-time":"2014-10-06T00:00:00Z","timestamp":1412553600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Intelligence Advanced Research Projects Agency (IARPA) via of Interior National Business Center","award":["D11PC20165"],"award-info":[{"award-number":["D11PC20165"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. Emerg. Technol. Comput. Syst."],"published-print":{"date-parts":[[2014,10,6]]},"abstract":"<jats:p>Quantum algorithms are known for their ability to solve some problems much faster than classical algorithms. They are executed on quantum circuits, which consist of a cascade of quantum gates. However, synthesis of quantum circuits is not straightforward because of the complexity of quantum algorithms.<\/jats:p>\n          <jats:p>Generally, quantum algorithms contain two parts: classical and quantum. Thus, synthesizing circuits for the two parts separately reduces overall synthesis complexity. In addition, many quantum algorithms use similar subroutines that can be implemented with similar circuit modules. Because of their frequent use, it is important to use automated scripts to generate such modules efficiently. These modules can then be subjected to further synthesis optimizations.<\/jats:p>\n          <jats:p>This article proposes QLib, a quantum module library, which contains scripts to generate quantum modules of different sizes and specifications for well-known quantum algorithms. Thus, QLib can also serve as a suite of benchmarks for quantum logic and physical synthesis.<\/jats:p>","DOI":"10.1145\/2629430","type":"journal-article","created":{"date-parts":[[2014,10,7]],"date-time":"2014-10-07T12:57:47Z","timestamp":1412686667000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["QLib"],"prefix":"10.1145","volume":"11","author":[{"given":"Chia-Chun","family":"Lin","sequence":"first","affiliation":[{"name":"Princeton University"}]},{"given":"Amlan","family":"Chakrabarti","sequence":"additional","affiliation":[{"name":"University of Calcutta"}]},{"given":"Niraj K.","family":"Jha","sequence":"additional","affiliation":[{"name":"Princeton University"}]}],"member":"320","published-online":{"date-parts":[[2014,10,6]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Scaffold: Quantum programming language. ftp:\/\/ftp.cs.princeton.edu\/techreports\/2012\/934.pdf","author":"Abhari A. J.","year":"2012","unstructured":"A. J. Abhari , A. Faruque , M. J. Dousti , 2012 . Scaffold: Quantum programming language. ftp:\/\/ftp.cs.princeton.edu\/techreports\/2012\/934.pdf A. J. Abhari, A. Faruque, M. J. Dousti, et al. 2012. Scaffold: Quantum programming language. ftp:\/\/ftp.cs.princeton.edu\/techreports\/2012\/934.pdf"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11672142_13"},{"key":"e_1_2_1_3_1","first-page":"175","article-title":"Circuit for Shor\u2019s algorithm using 2n+3 qubits. Quantum Info","volume":"3","author":"Beauregard S.","year":"2003","unstructured":"S. Beauregard . 2003 . Circuit for Shor\u2019s algorithm using 2n+3 qubits. Quantum Info . Computing 3 , 2, 175 -- 185 . S. Beauregard. 2003. Circuit for Shor\u2019s algorithm using 2n+3 qubits. Quantum Info. Computing 3, 2, 175--185.","journal-title":"Computing"},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the Annual Conference on Theoretical Aspects of Computer Science. 661--672","author":"Childs A. M.","unstructured":"A. M. Childs and R. Kothari . 2011. Quantum query complexity of minor-closed graph properties . In Proceedings of the Annual Conference on Theoretical Aspects of Computer Science. 661--672 . A. M. Childs and R. Kothari. 2011. Quantum query complexity of minor-closed graph properties. In Proceedings of the Annual Conference on Theoretical Aspects of Computer Science. 661--672."},{"key":"e_1_2_1_5_1","unstructured":"S. A. Cuccaro T. G. Draper S. A. Kutin and D. P. Moulton. 2008. A new quantum ripple-carry addition circuit. arXiv:quant-ph\/0410184v1.  S. A. Cuccaro T. G. Draper S. A. Kutin and D. P. Moulton. 2008. A new quantum ripple-carry addition circuit. arXiv:quant-ph\/0410184v1."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1330521.1330523"},{"key":"e_1_2_1_7_1","unstructured":"T. G. Draper. 2000. Addition on a quantum computer. (2000). arXiv:quant-ph\/0008033v1.  T. G. Draper. 2000. Addition on a quantum computer. (2000). arXiv:quant-ph\/0008033v1."},{"key":"e_1_2_1_8_1","unstructured":"B. Drury and P. J. Love. 2008. Constructive quantum Shannon decomposition from Cartan involutions. arXiv:0806.4015v1.  B. Drury and P. J. Love. 2008. Constructive quantum Shannon decomposition from Cartan involutions. arXiv:0806.4015v1."},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","unstructured":"E. Fredkin and T. Toffoli. 2002. Conservative Logic. Springer 47--81.   E. Fredkin and T. Toffoli. 2002. Conservative Logic . Springer 47--81.","DOI":"10.1007\/978-1-4471-0129-1_3"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2017215"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.871622"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.05.039"},{"key":"e_1_2_1_14_1","unstructured":"S. Jordan. 2011. Quantum Algorithm Zoo. http:\/\/math.nist.gov\/quantum\/zoo\/  S. Jordan. 2011. Quantum Algorithm Zoo. http:\/\/math.nist.gov\/quantum\/zoo\/"},{"key":"e_1_2_1_15_1","doi-asserted-by":"crossref","unstructured":"P. Kaye R. Laflamme and M. Mosca. 2007. An Introduction to Quantum Computing. Oxford University Press Inc.   P. Kaye R. Laflamme and M. Mosca. 2007. An Introduction to Quantum Computing . Oxford University Press Inc.","DOI":"10.1093\/oso\/9780198570004.001.0001"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2012.2227518"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2013.2269869"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2564923"},{"key":"e_1_2_1_19_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","unstructured":"I. L. Markov and M. Saeedi . 2012 . Constant-optimized quantum circuits for modular multiplication and exponentiation. Quantum Info . Computing 12 , 5 -- 6 , 361--394. I. L. Markov and M. Saeedi. 2012. Constant-optimized quantum circuits for modular multiplication and exponentiation. Quantum Info. Computing 12, 5--6, 361--394.","journal-title":"Computing"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.847911"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1278349.1278355"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/775832.775915"},{"key":"e_1_2_1_23_1","unstructured":"M. Nielsen and I. Chuang. 2000. Quantum Computation and Quantum Information. Cambridge University Press.   M. Nielsen and I. Chuang. 2000. Quantum Computation and Quantum Information . Cambridge University Press."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2011.6081399"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.32.3266"},{"key":"e_1_2_1_26_1","unstructured":"QASM. 2006. qasm-tools. (2006). http:\/\/www.media.mit.edu\/quanta\/quanta-web\/projects\/qasm-tools\/.  QASM. 2006. qasm-tools. (2006). http:\/\/www.media.mit.edu\/quanta\/quanta-web\/projects\/qasm-tools\/."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"e_1_2_1_28_1","first-page":"262","article-title":"Block-based quantum-logic synthesis","volume":"11","author":"Saeedi M.","year":"2011","unstructured":"M. Saeedi , M. Arabzadeh , M. S. Zamani , and M. Sedighi . 2011 . Block-based quantum-logic synthesis . Quantum Infor. Process. 11 , 3, 262 -- 277 . M. Saeedi, M. Arabzadeh, M. S. Zamani, and M. Sedighi. 2011. Block-based quantum-logic synthesis. Quantum Infor. Process. 11, 3, 262--277.","journal-title":"Quantum Infor. Process."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1877745.1877747"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.855930"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2003.811448"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the International Design Test Workshop. 143--148","author":"Soeken M.","unstructured":"M. Soeken , R. Wille , and R. Drechsler . 2010. Hierarchical synthesis of reversible circuits using positive and negative Davio decomposition . In Proceedings of the International Design Test Workshop. 143--148 . M. Soeken, R. Wille, and R. Drechsler. 2010. Hierarchical synthesis of reversible circuits using positive and negative Davio decomposition. In Proceedings of the International Design Test Workshop. 143--148."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.54.147"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629911.1629984"}],"container-title":["ACM Journal on Emerging Technologies in Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2629430","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2629430","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:17Z","timestamp":1750230077000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2629430"}},"subtitle":["Quantum module library"],"short-title":[],"issued":{"date-parts":[[2014,10,6]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,10,6]]}},"alternative-id":["10.1145\/2629430"],"URL":"https:\/\/doi.org\/10.1145\/2629430","relation":{},"ISSN":["1550-4832","1550-4840"],"issn-type":[{"value":"1550-4832","type":"print"},{"value":"1550-4840","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,6]]},"assertion":[{"value":"2013-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-10-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}