{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:01:41Z","timestamp":1750309301115,"version":"3.41.0"},"reference-count":48,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2024,7,13]],"date-time":"2024-07-13T00:00:00Z","timestamp":1720828800000},"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":["ACM Trans. Quantum Comput."],"published-print":{"date-parts":[[2024,9,30]]},"abstract":"<jats:p>\n            Decoherence jeopardizes the entanglement of fragile quantum states, and is among the foremost challenges towards engineering scalable quantum computers. Realizing quantum circuit implementation with small qubit count and shallow circuit depth is necessary due to the linear scaling of decoherence rate with qubit count and circuit depth. Conversely, reasonable correction of small unitary errors can be achieved by using surface codes along with a transversal gate set to protect quantum information from decoherence. In this paper, we analyze and report the upper bound of non-Clifford phase-depth for different mapping schemes and synthesis approaches. We introduce a synthesis methodology based on lookup-table\u00a0(LUT) networks, wherein the Boolean logic translates into fault-tolerant quantum logic using Clifford+\n            <jats:italic>\n              Z\n              <jats:sub>N<\/jats:sub>\n            <\/jats:italic>\n            group with zero ancillary cost. We also present fault-tolerant synthesis techniques for\n            <jats:italic>k<\/jats:italic>\n            -LUT network using additional ancillary lines with exponential phase-count and unit phase-depth.\n          <\/jats:p>","DOI":"10.1145\/3673240","type":"journal-article","created":{"date-parts":[[2024,6,14]],"date-time":"2024-06-14T11:29:04Z","timestamp":1718364544000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Synthesis Techniques for Fault-tolerant Quantum Circuit Implementation using Clifford+\n            <i>\n              Z\n              <sub>N<\/sub>\n            <\/i>\n            -group"],"prefix":"10.1145","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0446-1731","authenticated-orcid":false,"given":"Laxmidhar","family":"Biswal","sequence":"first","affiliation":[{"name":"CCDS, Nanyang Technological University, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6561-8934","authenticated-orcid":false,"given":"Debjyoti","family":"Bhattacharjee","sequence":"additional","affiliation":[{"name":"Interuniversity Microelectronics Centre, Leuven, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4380-3172","authenticated-orcid":false,"given":"Amlan","family":"Chakrabarti","sequence":"additional","affiliation":[{"name":"University of Calcutta, Kolkata, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8818-6983","authenticated-orcid":false,"given":"Anupam","family":"Chattopadhyay","sequence":"additional","affiliation":[{"name":"CCDS, Nanyang Technological University, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,7,13]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.79.325"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144598347011"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02650179"},{"key":"e_1_3_1_5_2","volume-title":"Quantum Computation and Quantum Information: 10th Anniversary Edition (10th ed.)","author":"Nielsen Michael A.","year":"2011","unstructured":"Michael A. Nielsen and Isaac L. Chuang. 2011. Quantum Computation and Quantum Information: 10th Anniversary Edition (10th ed.). Cambridge University Press, USA."},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1038\/35090662"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.51.992"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/2499370.2462177"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2006.4"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ab9359"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.125.170501"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-018-0074-2"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-019-1666-5"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2018-08-06-79"},{"key":"e_1_3_1_15_2","unstructured":"Google. 2019. Google may have Just Ushered in an Era of \u2018quantum supremacy\u2019. https:\/\/www.theverge.com\/2019\/9\/23\/20879485\/google-quantum-supremacy-qubits-nasa. (2019). [Online; accessed 05-Dec-2021]."},{"key":"e_1_3_1_16_2","unstructured":"IBM. 2021. IBM Quantum Breaks the 100-qubit Processor Barrier. https:\/\/research.ibm.com\/blog\/127-qubit-quantum-processor-eagle. (2021). [Online; accessed 05-Dec-2021]."},{"key":"e_1_3_1_17_2","first-page":"quant\u2013ph\/030607","article-title":"Decoherence and the transition from quantum to classical \u2013 REVISITED","author":"Zurek Wojciech H.","year":"2003","unstructured":"Wojciech H. Zurek. 2003. Decoherence and the transition from quantum to classical \u2013 REVISITED. arXiv e-prints (June2003), quant\u2013ph\/0306072. arxiv:quant-ph\/quant-ph\/0306072","journal-title":"arXiv e-prints"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.86.032324"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.111.090505"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature23460"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.52.3457"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.100.062326"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1063\/1.4927100"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.96.022330"},{"key":"e_1_3_1_25_2","article-title":"Resource comparison of two surface code implementations of small angle Z rotations","author":"Mishra Prashant","year":"2014","unstructured":"Prashant Mishra and Austin G. Fowler. 2014. Resource comparison of two surface code implementations of small angle Z rotations. arXiv: Quantum Physics (2014).","journal-title":"arXiv: Quantum Physics"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/1\/1\/015007"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.86.052329"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.123.070507"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2014.2341953"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1147\/rd.176.0525"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2859251"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-021-00514-y"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISMVL.2019.00026"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.aar3106"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.102.110502"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.125.060405"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.80.052312"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2013.2244643"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2017215"},{"key":"e_1_3_1_40_2","unstructured":"Mathias Soeken Nabila Abdessaied and Rolf Drechsler. 2014. A Framework for Reversible Circuit Complexity. (2014). arxiv:cs.ET\/1407.5878"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.871622"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2014.01.003"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-21500-2_12"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_5"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.mejo.2018.08.011"},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.87.042302"},{"key":"e_1_3_1_47_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2488484"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/3287624.3287671"},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3317893"}],"container-title":["ACM Transactions on Quantum Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3673240","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3673240","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:40Z","timestamp":1750291420000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3673240"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,13]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9,30]]}},"alternative-id":["10.1145\/3673240"],"URL":"https:\/\/doi.org\/10.1145\/3673240","relation":{},"ISSN":["2643-6809","2643-6817"],"issn-type":[{"type":"print","value":"2643-6809"},{"type":"electronic","value":"2643-6817"}],"subject":[],"published":{"date-parts":[[2024,7,13]]},"assertion":[{"value":"2023-05-08","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-05-21","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}