{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T00:26:22Z","timestamp":1771547182406,"version":"3.50.1"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,5,28]],"date-time":"2023-05-28T00:00:00Z","timestamp":1685232000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,28]],"date-time":"2023-05-28T00:00:00Z","timestamp":1685232000000},"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":[[2023,5,28]]},"DOI":"10.1109\/icc45041.2023.10279010","type":"proceedings-article","created":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T17:54:10Z","timestamp":1698083650000},"page":"2692-2697","source":"Crossref","is-referenced-by-count":3,"title":["ATOM: An Efficient Topology Adaptive Algorithm for Minor Embedding in Quantum Computing"],"prefix":"10.1109","author":[{"given":"Hoang M.","family":"Ngo","sequence":"first","affiliation":[{"name":"University of Florida"}]},{"given":"Tamer","family":"Kahveci","sequence":"additional","affiliation":[{"name":"University of Florida"}]},{"given":"My T.","family":"Thai","sequence":"additional","affiliation":[{"name":"University of Florida"}]}],"member":"263","reference":[{"key":"ref13","author":"cai","year":"2014","journal-title":"A practical heuristic for finding graph minors"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58942-4_8"},{"key":"ref15","author":"boothby","year":"2020","journal-title":"Next-Generation Topology of D- Wave Quantum Processors"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-20656-7_7"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-018-1863-4"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-015-1150-6"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2021.102549"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-019-1666-5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-010-0200-3"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICSPCS47537.2019.9008543"},{"key":"ref9","article-title":"Adiabatic quantum pro-gramming: Minor embedding with hard faults","volume":"13","author":"klymko","year":"2012","journal-title":"Quantum Information Processing"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TQE.2022.3199267"},{"key":"ref3","first-page":"28362","article-title":"Parametrized quantum policies for reinforcement learning","volume":"34","author":"jerbi","year":"2021","journal-title":"Advances in neural information processing systems"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.3389\/fict.2017.00029","article-title":"Traffic flow optimization using a quantum annealer","volume":"4","author":"neukart","year":"2017","journal-title":"Frontiers in ICT"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s42979-021-00466-2"}],"event":{"name":"ICC 2023 - IEEE International Conference on Communications","location":"Rome, Italy","start":{"date-parts":[[2023,5,28]]},"end":{"date-parts":[[2023,6,1]]}},"container-title":["ICC 2023 - IEEE International Conference on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10278505\/10278554\/10279010.pdf?arnumber=10279010","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T19:04:23Z","timestamp":1699902263000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10279010\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,28]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/icc45041.2023.10279010","relation":{},"subject":[],"published":{"date-parts":[[2023,5,28]]}}}