{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T16:16:58Z","timestamp":1778257018224,"version":"3.51.4"},"reference-count":47,"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"}],"funder":[{"DOI":"10.13039\/501100000038","name":"DOE-SC Office of Advanced Scientific Computing Research MACHQ","doi-asserted-by":"publisher","award":["DE-AC02-06CH11357"],"award-info":[{"award-number":["DE-AC02-06CH11357"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,8,30]]},"DOI":"10.1109\/qce65121.2025.00049","type":"proceedings-article","created":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T18:22:51Z","timestamp":1764613371000},"page":"368-374","source":"Crossref","is-referenced-by-count":2,"title":["Is Circuit Depth Accurate for Comparing Quantum Circuit Runtimes?"],"prefix":"10.1109","author":[{"given":"Matthew","family":"Tremba","sequence":"first","affiliation":[{"name":"Argonne National Laboratory,Mathematics and Computer Science Division,Lemont,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Hovland","sequence":"additional","affiliation":[{"name":"Argonne National Laboratory,Mathematics and Computer Science Division,Lemont,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji","family":"Liu","sequence":"additional","affiliation":[{"name":"Argonne National Laboratory,Mathematics and Computer Science Division,Lemont,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CSCE60160.2023.00272"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1038\/nature08812"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISQED51717.2021.9424258"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aba404"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2021.3057166"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511976667"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.22331\/q-2024-11-07-1516"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-024-08449-y"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-021-03318-4"},{"key":"ref12","volume-title":"Quantum processing units","year":"2025"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA61900.2025.00023"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/QCE57702.2023.00116"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CGO51591.2021.9370310"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/QCE52317.2021.00041"},{"key":"ref17","first-page":"arXiv","article-title":"Decomposing and routing quantum circuits under constraints for neutral atom architectures","author":"Nottingham","year":"2023","journal-title":"arXiv e-prints"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3669940.3707240"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3519939.3523433"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD57390.2023.10323863"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-025-01001-1"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-018-0072-4"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3729269"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/QCE57702.2023.00087"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/QCE60285.2024.00112"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TQE.2021.3091648"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-024-47857-6"},{"key":"ref28","author":"Javadi-Abhari","year":"2024","journal-title":"Quantum computing with Qiskit"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ab8e92"},{"key":"ref30","volume-title":"Berkeley quantum synthesis toolkit (bqskit) v1","volume":"04","author":"Younis","year":"2021"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1038\/s43588-025-00792-y"},{"key":"ref32","author":"Zou","year":"2024","journal-title":"Lightsabre: A lightweight and enhanced sabre algorithm"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.22331\/q-2022-01-24-629"},{"key":"ref34","volume-title":"Quil-t","author":"Computing","year":"2025"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-020-00346-2"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-97063-4_11"},{"key":"ref37","volume-title":"Faster and shorter synthesis of hamiltonian simulation circuits","author":"de Brugire","year":"2024"},{"key":"ref38","volume-title":"Rzgate","year":"2025"},{"key":"ref39","volume-title":"Native gates","year":"2025"},{"key":"ref40","first-page":"49","article-title":"Computer Architecture, ch. Fundamentals of Quantitative Design and Analysis","volume-title":"The Morgan Kaufmann Series in Computer Architecture and Design","author":"Hennessy","year":"2011"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms5213"},{"key":"ref42","article-title":"A quantum approximate optimization algorithm","author":"Farhi","year":"2014","journal-title":"arXiv preprint"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevB.101.184305"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA53966.2022.00050"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3297858.3304023"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2024.3513262"},{"key":"ref47","article-title":"Efficient compilation for shuttling trapped-ion machines via the position graph architectural abstraction","author":"Bach","year":"2025","journal-title":"arXiv preprint"}],"event":{"name":"2025 IEEE International Conference on Quantum Computing and Engineering (QCE)","location":"Albuquerque, NM, USA","start":{"date-parts":[[2025,8,30]]},"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\/11250136.pdf?arnumber=11250136","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T06:46:42Z","timestamp":1764658002000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11250136\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,30]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/qce65121.2025.00049","relation":{},"subject":[],"published":{"date-parts":[[2025,8,30]]}}}