{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T15:10:08Z","timestamp":1751037008522,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","funder":[{"name":"QEP grant","award":["NRF2021-QEP2-02-P05"],"award-info":[{"award-number":["NRF2021-QEP2-02-P05"]}]},{"name":"MoE AcRF Tier 1 award","award":["RT10\/23"],"award-info":[{"award-number":["RT10\/23"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,30]]},"DOI":"10.1145\/3716368.3735184","type":"proceedings-article","created":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T14:00:26Z","timestamp":1751032826000},"page":"35-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Reducing T-Depth and T-Count in Quantum Multiplication Using Compressor Primitives"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-9128-1857","authenticated-orcid":false,"given":"Siyi","family":"Wang","sequence":"first","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-4891-9919","authenticated-orcid":false,"given":"Suman","family":"Dutta","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore and Indian Statistical Institute, Applied Statistics Unit, Kolkata, India"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-6274-0719","authenticated-orcid":false,"given":"Wei Jie Bryan","family":"Lee","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-3091-6884","authenticated-orcid":false,"given":"Jerrie","family":"Feng","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3231-5771","authenticated-orcid":false,"given":"Xiang","family":"Fang","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8818-6983","authenticated-orcid":false,"given":"Anupam","family":"Chattopadhyay","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2025,6,29]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"crossref","unstructured":"Matthew Amy Dmitri Maslov Michele Mosca and Martin Roetteler. 2013. A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 32 6 (2013) 818\u2013830.","DOI":"10.1109\/TCAD.2013.2244643"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"crossref","unstructured":"Stephen\u00a0A Cook and St\u00e5l\u00a0O Aanderaa. 1969. On the minimum computation time of functions. Trans. Amer. Math. Soc. 142 (1969) 291\u2013314.","DOI":"10.1090\/S0002-9947-1969-0249212-8"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"crossref","unstructured":"Srijit Dutta Debjyoti Bhattacharjee and Anupam Chattopadhyay. 2018. Quantum circuits for Toom-Cook multiplication. Phys. Rev. A 98 (Jul 2018) 012311. Issue 1.","DOI":"10.1103\/PhysRevA.98.012311"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"crossref","unstructured":"S.\u00a0S. Gayathri R. Kumar Samiappan Dhanalakshmi Brajesh\u00a0Kumar Kaushik and Majid Haghparast. 2021. T-Count optimized Wallace Tree integer multiplier for quantum computing. International Journal of Theoretical Physics 60 8 (2021) 2823\u20132835.","DOI":"10.1007\/s10773-021-04864-3"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"crossref","unstructured":"Craig Gidney. 2018. Halving the cost of quantum addition. Quantum 2 (2018) 74.","DOI":"10.22331\/q-2018-06-18-74"},{"key":"e_1_3_3_2_7_2","unstructured":"Craig Gidney. 2019. Asymptotically efficient quantum Karatsuba multiplication. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/1904.07356 (2019)."},{"key":"e_1_3_3_2_8_2","unstructured":"Craig Gidney. 2019. Windowed quantum arithmetic. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/1905.07682 (2019)."},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"crossref","unstructured":"H.\u00a0V. Jayashree Himanshu Thapliyal Hamid\u00a0R Arabnia and Vinod\u00a0Kumar Agrawal. 2016. Ancilla-input and garbage-output optimized design of a reversible quantum integer multiplier. The Journal of Supercomputing 72 (2016) 1477\u20131493.","DOI":"10.1007\/s11227-016-1676-0"},{"key":"e_1_3_3_2_10_2","first-page":"293","volume-title":"Doklady Akademii Nauk","author":"Karatsuba Anatolii\u00a0Alekseevich","year":"1962","unstructured":"Anatolii\u00a0Alekseevich Karatsuba and Yu\u00a0P Ofman. 1962. Multiplication of many-digital numbers by automatic computers. In Doklady Akademii Nauk, Vol.\u00a0145. Russian Academy of Sciences, 293\u2013294."},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"crossref","unstructured":"Shane Kepley and Rainer Steinwandt. 2015. Quantum circuits for \\( \\mathbb {F}_{2^{n}} \\)-multiplication with subquadratic gate count. Quantum Information Processing 14 (2015) 2373\u20132386.","DOI":"10.1007\/s11128-015-0993-1"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"crossref","unstructured":"Chia-Chun Lin Amlan Chakrabarti and Niraj\u00a0K Jha. 2014. Qlib: Quantum module library. ACM Journal on Emerging Technologies in Computing Systems (JETC) 11 1 (2014) 1\u201320.","DOI":"10.1145\/2629430"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"crossref","unstructured":"Edgard Mu\u00f1oz-Coreas and Himanshu Thapliyal. 2018. Quantum circuit design of a T-Count optimized integer multiplier. IEEE Trans. Comput. 68 5 (2018) 729\u2013739.","DOI":"10.1109\/TC.2018.2882774"},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976667"},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"crossref","unstructured":"F Orts E Filatovas G Ortega JF SanJuan-Estrada and EM Garz\u00f3n. 2023. Improving the number of T gates and their spread in integer multipliers on quantum computing. Physical Review A 107 4 (2023) 042621.","DOI":"10.1103\/PhysRevA.107.042621"},{"key":"e_1_3_3_2_16_2","unstructured":"Alex Parent Martin Roetteler and Michele Mosca. 2017. Improved reversible and quantum circuits for Karatsuba-based integer multiplication. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/1706.03419 (2017)."},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"crossref","unstructured":"Arnold Sch\u00f6nhage and Volker Strassen. 1971. Fast multiplication of large numbers. Computing 7 (1971) 281\u2013292.","DOI":"10.1007\/BF02242355"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"crossref","unstructured":"Peter Selinger. 2013. Quantum circuits of T-Depth one. Phys. Rev. A 87 (Apr 2013) 042302. Issue 4.","DOI":"10.1103\/PhysRevA.87.042302"},{"key":"e_1_3_3_2_19_2","unstructured":"Peter Shor. 1996. Algorithms for Quantum Computation: Discrete Logarithms and Factoring. Proceedings of 35th Annual Symposium on Foundations of Computer Science (10 1996)."},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCSP.2019.8697981"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICICES.2013.6508192"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"crossref","unstructured":"Christopher\u00a0S Wallace. 1964. A suggestion for a fast multiplier. IEEE Transactions on Electronic Computers1 (1964) 14\u201317.","DOI":"10.1109\/PGEC.1964.263830"},{"key":"e_1_3_3_2_23_2","doi-asserted-by":"crossref","unstructured":"Siyi Wang Suman Deb Ankit Mondal and Anupam Chattopadhyay. 2024. Optimal Toffoli-Depth Quantum Adder. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2405.02523 (2024).","DOI":"10.1145\/3743691"},{"key":"e_1_3_3_2_24_2","unstructured":"Siyi Wang Xiufan Li Wei Jie\u00a0Bryan Lee Suman Deb Eugene Lim and Anupam Chattopadhyay. 2024. A Comprehensive Study of Quantum Arithmetic Circuits. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2406.03867 (2024)."},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2017.22"},{"key":"e_1_3_3_2_26_2","unstructured":"Christof Zalka. 1998. Fast versions of Shor\u2019s quantum factoring algorithm. arXiv quant-ph\/9806084 (1998)."}],"event":{"name":"GLSVLSI '25: Great Lakes Symposium on VLSI 2025","sponsor":["SIGDA ACM Special Interest Group on Design Automation"],"location":"New Orleans LA USA","acronym":"GLSVLSI '25"},"container-title":["Proceedings of the Great Lakes Symposium on VLSI 2025"],"original-title":[],"deposited":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T14:37:49Z","timestamp":1751035069000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3716368.3735184"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,29]]},"references-count":25,"alternative-id":["10.1145\/3716368.3735184","10.1145\/3716368"],"URL":"https:\/\/doi.org\/10.1145\/3716368.3735184","relation":{},"subject":[],"published":{"date-parts":[[2025,6,29]]},"assertion":[{"value":"2025-06-29","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}