{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T06:50:00Z","timestamp":1770360600587,"version":"3.49.0"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2018,7,31]],"date-time":"2018-07-31T00:00:00Z","timestamp":1532995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. Emerg. Technol. Comput. Syst."],"published-print":{"date-parts":[[2018,7,31]]},"abstract":"<jats:p>\n            Quantum circuits for basic mathematical functions such as the square root are required to implement scientific computing algorithms on quantum computers. Quantum circuits that are based on Clifford+T gates can easily be made fault tolerant, but the T gate is very costly to implement. As a result, reducing T-count has become an important optimization goal. Further, quantum circuits with many qubits are difficult to realize, making designs that save qubits and produce no garbage outputs desirable. In this work, we present a T-count optimized quantum square root circuit with only 2 \u1e61\n            <jats:italic>n<\/jats:italic>\n            + 1 qubits and no garbage output. To make a fair comparison against existing work, the Bennett\u2019s garbage removal scheme is used to remove garbage output from existing works. We determined that our proposed design achieves an average T-count savings of 43.44%, 98.95%, 41.06%, and 20.28% as well as qubit savings of 85.46%, 95.16%, 90.59%, and 86.77% compared to existing works.\n          <\/jats:p>","DOI":"10.1145\/3264816","type":"journal-article","created":{"date-parts":[[2018,10,24]],"date-time":"2018-10-24T11:57:18Z","timestamp":1540382238000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["T-count and Qubit Optimized Quantum Circuit Design of the Non-Restoring Square Root Algorithm"],"prefix":"10.1145","volume":"14","author":[{"given":"Edgard","family":"Mu\u00f1oz-Coreas","sequence":"first","affiliation":[{"name":"University of Kentucky, Lexington, KY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9157-4517","authenticated-orcid":false,"given":"Himanshu","family":"Thapliyal","sequence":"additional","affiliation":[{"name":"University of Kentucky, Lexington, KY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,10,23]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"10","article-title":"Polynomial-time T-depth optimization of clifford+T circuits via matroid partitioning","volume":"33","author":"Amy M.","year":"2014","journal-title":"IEEE Trans. Comput.-Aid. Des. Integr. Circ. Syst."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2013.2244643"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2017.01.002"},{"key":"e_1_2_1_4_1","first-page":"2","article-title":"Circuit for shor\u2019s algorithm using 2n+3 gubits","volume":"3","author":"Beauregard S","year":"2003","journal-title":"Quant. Inf. Comput."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.176.0525"},{"key":"e_1_2_1_6_1","first-page":"3","article-title":"Quantum algorithms and circuits for scientific computing","volume":"16","author":"Bhaskar M. K.","year":"2016","journal-title":"Quant. Inf. Comput."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89304-2_9"},{"key":"e_1_2_1_8_1","unstructured":"S. J. Devitt A. M. Stephens W. J. Munro and K. Nemoto. 2013. Requirements for fault-tolerant factoring on an atom-optics quantum computer. Nat. Commun. 4 Article 2524 (Oct. 2013) 2524 pages. arxiv:quant-ph\/1212.4934  S. J. Devitt A. M. Stephens W. J. Munro and K. Nemoto. 2013. Requirements for fault-tolerant factoring on an atom-optics quantum computer. Nat. Commun. 4 Article 2524 (Oct. 2013) 2524 pages. arxiv:quant-ph\/1212.4934"},{"key":"e_1_2_1_9_1","unstructured":"Dave Wecker et al. 2016. Language-Integrated Quantum Operations: LIQUi&verbar;&gt;. Retrieved from https:\/\/www.microsoft.com\/en-us\/research\/project\/language-integrated-quantum-operations-liqui\/.  Dave Wecker et al. 2016. Language-Integrated Quantum Operations: LIQUi&verbar;&gt;. Retrieved from https:\/\/www.microsoft.com\/en-us\/research\/project\/language-integrated-quantum-operations-liqui\/."},{"key":"e_1_2_1_10_1","unstructured":"Peter Selinger et al. 2016. The Quipper System. Retrieved from http:\/\/www.mathstat.dal.ca\/selinger\/quipper\/doc\/.  Peter Selinger et al. 2016. The Quipper System. Retrieved from http:\/\/www.mathstat.dal.ca\/selinger\/quipper\/doc\/."},{"key":"e_1_2_1_11_1","first-page":"15","article-title":"An algorithm for the T-count","volume":"14","author":"Gosset David","year":"2014","journal-title":"Quant. Inf. Comput."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/CIS.2014.40"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1206035.1206039"},{"key":"e_1_2_1_14_1","unstructured":"IBM. 2017. Quantum Computing\u2014IBM Q. Retrieved from https:\/\/www.research.ibm.com\/ibm-q\/.  IBM. 2017. Quantum Computing\u2014IBM Q. Retrieved from https:\/\/www.research.ibm.com\/ibm-q\/."},{"key":"e_1_2_1_15_1","first-page":"3","article-title":"Layered architecture for quantum computing","author":"Jones N. Cody","year":"2012","journal-title":"Phys. Rev."},{"key":"e_1_2_1_16_1","first-page":"5","article-title":"Constant-optimized quantum circuits for modular multiplication and exponentiation","volume":"12","author":"Markov Igor L.","year":"2012","journal-title":"Quant. Inf. Comput."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46406-9"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.89.022317"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-0060-4"},{"key":"e_1_2_1_20_1","unstructured":"E. Mu\u00f1oz-Coreas and H. Thapliyal. 2017. T-count optimized design of quantum integer multiplication. ArXiv e-prints (June 2017). arxiv:quant-ph\/1706.05113  E. Mu\u00f1oz-Coreas and H. Thapliyal. 2017. T-count optimized design of quantum integer multiplication. ArXiv e-prints (June 2017). arxiv:quant-ph\/1706.05113"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2744769.2747911"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aa66eb"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2744769.2747921"},{"key":"e_1_2_1_24_1","first-page":"4","article-title":"Shor\u2019s discrete logarithm quantum algorithm for elliptic curves","volume":"3","author":"Proos J.","year":"2003","journal-title":"Quant. Inf. Comput."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2008.04.004"},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the 2011 18th IEEE International Conference on Electronics, Circuits, and Systems. 141--144","author":"Sultana S."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-50412-3_2"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491682"},{"key":"e_1_2_1_29_1","unstructured":"W. van Dam and S. Hallgren. 2000. Efficient quantum algorithms for shifted quadratic character problems. eprint arXiv:quant-ph\/0011067 (Nov. 2000). arXiv:quant-ph\/0011067  W. van Dam and S. Hallgren. 2000. Efficient quantum algorithms for shifted quadratic character problems. eprint arXiv:quant-ph\/0011067 (Nov. 2000). arXiv:quant-ph\/0011067"},{"key":"e_1_2_1_30_1","unstructured":"W. van Dam and G. Seroussi. 2002. Efficient quantum algorithms for estimating gauss sums. eprint arXiv:quant-ph\/0207131 (July 2002). arXiv:quant-ph\/0207131  W. van Dam and G. Seroussi. 2002. Efficient quantum algorithms for estimating gauss sums. eprint arXiv:quant-ph\/0207131 (July 2002). arXiv:quant-ph\/0207131"},{"key":"e_1_2_1_31_1","volume-title":"Shparlinski","author":"van Dam Wim","year":"2008"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.92.062309"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.62.052316"}],"container-title":["ACM Journal on Emerging Technologies in Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3264816","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3264816","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:58Z","timestamp":1750212478000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3264816"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,31]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,7,31]]}},"alternative-id":["10.1145\/3264816"],"URL":"https:\/\/doi.org\/10.1145\/3264816","relation":{},"ISSN":["1550-4832","1550-4840"],"issn-type":[{"value":"1550-4832","type":"print"},{"value":"1550-4840","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,31]]},"assertion":[{"value":"2017-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-10-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}