{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T06:35:44Z","timestamp":1764657344298,"version":"3.46.0"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T00:00:00Z","timestamp":1756512000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T00:00:00Z","timestamp":1756512000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,8,30]]},"DOI":"10.1109\/qce65121.2025.00226","type":"proceedings-article","created":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T18:22:51Z","timestamp":1764613371000},"page":"2064-2073","source":"Crossref","is-referenced-by-count":0,"title":["Enhancing Fidelity in NISQ Computers via Crosstalk-Optimized Gate Decomposition"],"prefix":"10.1109","author":[{"given":"Indu","family":"Palanisamy","sequence":"first","affiliation":[{"name":"Kennesaw State University,Department of Computer Science,Marietta,GA,USA,30060"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hieu","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Kennesaw State University,Department of Computer Science,Marietta,GA,USA,30060"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ethan","family":"Hunt","sequence":"additional","affiliation":[{"name":"Kennesaw State University,Department of Computer Science,Marietta,GA,USA,30060"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dillon","family":"Horton","sequence":"additional","affiliation":[{"name":"Kennesaw State University,Department of Computer Science,Marietta,GA,USA,30060"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dheeraj","family":"Tukkugudam","sequence":"additional","affiliation":[{"name":"Kennesaw State University,Department of Computer Science,Marietta,GA,USA,30060"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tu N.","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Kennesaw State University,Department of Computer Science,Marietta,GA,USA,30060"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"issue":"5","key":"ref1","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","article-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","volume":"26","author":"Shor","year":"1997","journal-title":"SIAM Journal on Computing"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/11398448_2","volume-title":"Quantum Gates and Decoherence","author":"Scheel","year":"2006"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1103\/prxquantum.3.020301"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1145\/3373376.3378477","article-title":"Software mitigation of crosstalk on noisy intermediate-scale quantum computers","volume-title":"Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems","author":"Murali"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.129.060501"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-021-21982-y"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.22331\/qv-2020-10-29-46"},{"journal-title":"A synergistic compilation workflow for tackling crosstalk in quantum machines","year":"2022","author":"Hua","key":"ref8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18074.2021.9586145"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1103\/physrevapplied.16.024063"},{"volume-title":"Ibm quantum achieves its highest quantum volume to date","year":"2021","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ab79b1"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1126\/science.1131563"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1103\/physrevb.72.134519"},{"key":"ref15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-38986-3_18","article-title":"Reducing the depth of quantum circuits using additional circuit lines","volume-title":"International Workshop on Reversible Computation","author":"Abdessaied","year":"2013"},{"volume-title":"Quantum gate decomposition algorithms","author":"Slepoy","key":"ref16","doi-asserted-by":"crossref","DOI":"10.2172\/889415"},{"issue":"6","key":"ref17","doi-asserted-by":"crossref","DOI":"10.3390\/e25060855","article-title":"Suppression of crosstalk in quantum circuit based on instruction exchange rules and duration","volume":"25","author":"Guan","year":"2023","journal-title":"Entropy"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1103\/prxquantum.2.040338"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1103\/prxquantum.3.020301"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/5.573740"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.22331\/q-2020-09-11-321"}],"event":{"name":"2025 IEEE International Conference on Quantum Computing and Engineering (QCE)","start":{"date-parts":[[2025,8,30]]},"location":"Albuquerque, NM, USA","end":{"date-parts":[[2025,9,5]]}},"container-title":["2025 IEEE International Conference on Quantum Computing and Engineering (QCE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11249812\/11249813\/11250227.pdf?arnumber=11250227","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T06:33:38Z","timestamp":1764657218000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11250227\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,30]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/qce65121.2025.00226","relation":{},"subject":[],"published":{"date-parts":[[2025,8,30]]}}}