{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T00:24:26Z","timestamp":1787012666108,"version":"build-2736575974"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,9,17]],"date-time":"2023-09-17T00:00:00Z","timestamp":1694908800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,9,17]],"date-time":"2023-09-17T00:00:00Z","timestamp":1694908800000},"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,9,17]]},"DOI":"10.1109\/qce57702.2023.00141","type":"proceedings-article","created":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T13:58:06Z","timestamp":1701352686000},"page":"1249-1259","source":"Crossref","is-referenced-by-count":1,"title":["Quantum Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees"],"prefix":"10.1109","author":[{"given":"Phillip A.","family":"Kerger","sequence":"first","affiliation":[{"name":"Johns Hopkins University,Department of Applied Mathematics and Statistics"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David E.","family":"Bernal Neira","sequence":"additional","affiliation":[{"name":"Research Institute of Advanced Computer Science, USRA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zoe Gonzalez","family":"Izquierdo","sequence":"additional","affiliation":[{"name":"Research Institute of Advanced Computer Science, USRA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eleanor G.","family":"Rieffel","sequence":"additional","affiliation":[{"name":"NASA Ames Research Center,Quantum Artificial Intelligence Laboratory"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Towards a complexity theory for the congested clique","author":"Korhonen","year":"2017"},{"key":"ref2","volume-title":"Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE","author":"Saikia","year":"2019"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-021-00398-3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2501983"},{"key":"ref5","article-title":"\u201c Tri, Tri Again\u201d: Finding Triangles and Small Subgraphs in a Distributed Setting - (Extended Abstract)","volume":"abs\/1201.6652","author":"Dolev","year":"2012","journal-title":"ArXiv"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451136"},{"key":"ref7","volume-title":"Distributed Graph Algorithms (Lecture Notes)","author":"Ghaffari","year":"2020"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.1145\/3293611.3331628","article-title":"Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model","volume-title":"Proceedings of the 2019 ACM Symposium on PODC","author":"Izumi"},{"key":"ref9","volume-title":"Quantum Distributed Algorithms for Detection of Cliques","author":"Censor-Hillel","year":"2022"},{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.1145\/3519270.3538413","volume-title":"A Framework for Distributed Quantum Queries in the CONGEST Model","author":"Van Apeldoorn","year":"2022"},{"key":"ref11","volume-title":"Can Quantum Communication Speed Up Distributed Computation?","author":"Elkin","year":"2012"},{"key":"ref12","doi-asserted-by":"crossref","DOI":"10.1145\/3212734.3212744","article-title":"Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks","volume-title":"Proceedings of the 2018 ACM Symposium on PODC","author":"Le Gall"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-016-0270-2"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00288961","article-title":"A fast algorithm for Steiner trees","volume":"15","author":"Kou","year":"1981","journal-title":"Acta Informatica"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.16"},{"key":"ref16","volume-title":"Quantum Computing: A Gentle Introduction","author":"Rieffel","year":"2011"},{"key":"ref17","article-title":"Mind the 0: Asymptotically better, but still impractical, quantum distributed algorithms","volume-title":"Algorithms","author":"Kerger","year":"2023"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/567112.567114"},{"key":"ref19","volume-title":"Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model","author":"Izumi","year":"2020"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.6028\/jres.071B.032"},{"key":"ref21","volume-title":"A Compendium on Steiner Tree Problems","author":"Hauptmann","year":"2015"}],"event":{"name":"2023 IEEE International Conference on Quantum Computing and Engineering (QCE)","location":"Bellevue, WA, USA","start":{"date-parts":[[2023,9,17]]},"end":{"date-parts":[[2023,9,22]]}},"container-title":["2023 IEEE International Conference on Quantum Computing and Engineering (QCE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10313590\/10313591\/10313704.pdf?arnumber=10313704","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T11:41:54Z","timestamp":1709379714000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10313704\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,17]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/qce57702.2023.00141","relation":{},"subject":[],"published":{"date-parts":[[2023,9,17]]}}}