{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:24:06Z","timestamp":1761402246571,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["947702"],"award-info":[{"award-number":["947702"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["024.003.037"],"award-info":[{"award-number":["024.003.037"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P 32863-N"],"award-info":[{"award-number":["P 32863-N"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,20]]},"DOI":"10.1145\/3519270.3538413","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"109-119","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["A Framework for Distributed Quantum Queries in the CONGEST Model"],"prefix":"10.1145","author":[{"given":"Joran","family":"van Apeldoorn","sequence":"first","affiliation":[{"name":"University of Amsterdam, Amsterdam, Netherlands"}]},{"given":"Tijn","family":"de Vos","sequence":"additional","affiliation":[{"name":"University of Salzburg, Salzburg, Austria"}]}],"member":"320","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447311"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P"},{"volume-title":"Spectra of Graphs","author":"Brouwer Andries E","key":"e_1_3_2_2_3_1","unstructured":"Andries E Brouwer and Willem H Haemers . 2012. Spectra of Graphs . Springer . Andries E Brouwer and Willem H Haemers. 2012. Spectra of Graphs. Springer."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276713"},{"key":"e_1_3_2_2_5_1","volume-title":"Dean Leitersdorf, and Rotem Oshman.","author":"Censor-Hillel Keren","year":"2022","unstructured":"Keren Censor-Hillel , Orr Fischer , Francois Le Gall , Dean Leitersdorf, and Rotem Oshman. 2022 . Quantum Distributed Algorithms for Detection of Cliques . arXiv:2201.03000 [quant-ph] Keren Censor-Hillel, Orr Fischer, Francois Le Gall, Dean Leitersdorf, and Rotem Oshman. 2022. Quantum Distributed Algorithms for Detection of Cliques. arXiv:2201.03000 [quant-ph]"},{"key":"e_1_3_2_2_6_1","volume-title":"Cycles and Small Subgraphs. In Proc. of the Symposium on Distributed Computing (DISC)","volume":"179","author":"Censor-Hillel Keren","year":"2020","unstructured":"Keren Censor-Hillel , Orr Fischer , Tzlil Gonen , Francois Le Gall , Dean Leitersdorf , and Rotem Oshman . 2020 . Fast Distributed Algorithms for Girth , Cycles and Small Subgraphs. In Proc. of the Symposium on Distributed Computing (DISC) , Vol. 179 . 33:1--33:17. Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, Francois Le Gall, Dean Leitersdorf, and Rotem Oshman. 2020. Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. In Proc. of the Symposium on Distributed Computing (DISC), Vol. 179. 33:1--33:17."},{"key":"e_1_3_2_2_7_1","volume-title":"Quantum Computing: Lecture Notes. arXiv:1907.09415 [quant-ph]","author":"de Wolf Ronald","year":"2021","unstructured":"Ronald de Wolf . 2021 . Quantum Computing: Lecture Notes. arXiv:1907.09415 [quant-ph] Ronald de Wolf. 2021. Quantum Computing: Lecture Notes. arXiv:1907.09415 [quant-ph]"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1992.0167"},{"key":"e_1_3_2_2_9_1","unstructured":"Christoph D\u00fcrr and Peter H\u00f8yer. 1996. A Quantum Algorithm for Finding the Minimum. (1996). quant-ph\/9607014.  Christoph D\u00fcrr and Peter H\u00f8yer. 1996. A Quantum Algorithm for Finding the Minimum. (1996). quant-ph\/9607014."},{"key":"e_1_3_2_2_10_1","volume-title":"Sublinear-time distributed algorithms for detecting small cliques and even cycles. Distributed Computing","author":"Eden Talya","year":"2021","unstructured":"Talya Eden , Nimrod Fiat , Orr Fischer , Fabian Kuhn , and Rotem Oshman . 2021. Sublinear-time distributed algorithms for detecting small cliques and even cycles. Distributed Computing ( 2021 ), 1--28. Talya Eden, Nimrod Fiat, Orr Fischer, Fabian Kuhn, and Rotem Oshman. 2021. Sublinear-time distributed algorithms for detecting small cliques and even cycles. Distributed Computing (2021), 1--28."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611488"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.91"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04355-0_26"},{"key":"e_1_3_2_2_14_1","unstructured":"Tudor Giurgica-Tiron Iordanis Kerenidis Farrokh Labib Anupam Prakash and William Zeng. 2020. Low depth algorithms for quantum amplitude estimation. arXiv:2012.03348 [quant-ph]  Tudor Giurgica-Tiron Iordanis Kerenidis Farrokh Labib Anupam Prakash and William Zeng. 2020. Low depth algorithms for quantum amplitude estimation. arXiv:2012.03348 [quant-ph]"},{"key":"e_1_3_2_2_15_1","volume-title":"Grover and Jaikumar Radhakrishnan","author":"Lov","year":"2004","unstructured":"Lov K. Grover and Jaikumar Radhakrishnan . 2004 . Quantum search for multiple items using parallel queries. arXiv:quant-ph\/0407217 [quant-ph] Lov K. Grover and Jaikumar Radhakrishnan. 2004. Quantum search for multiple items using parallel queries. arXiv:quant-ph\/0407217 [quant-ph]"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332504"},{"key":"e_1_3_2_2_17_1","volume-title":"Proc. of the Symposium on Theoretical Aspects of Computer Science (STACS). 23:1--23:13","author":"Izumi Taisuke","year":"2019","unstructured":"Taisuke Izumi , Francois Le Gall , and Fr\u00e9d\u00e9ric Magniez . 2019 . Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model . In Proc. of the Symposium on Theoretical Aspects of Computer Science (STACS). 23:1--23:13 . Taisuke Izumi, Francois Le Gall, and Fr\u00e9d\u00e9ric Magniez. 2019. Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. In Proc. of the Symposium on Theoretical Aspects of Computer Science (STACS). 23:1--23:13."},{"key":"e_1_3_2_2_18_1","volume-title":"Optimal Parallel Quantum Query Algorithms. 79, 2 (Sept","author":"Jeffery Stacey","year":"2016","unstructured":"Stacey Jeffery , Frederic Magniez , and Ronald de Wolf . 2016. Optimal Parallel Quantum Query Algorithms. 79, 2 (Sept . 2016 ), 509--529. Stacey Jeffery, Frederic Magniez, and Ronald de Wolf. 2016. Optimal Parallel Quantum Query Algorithms. 79, 2 (Sept. 2016), 509--529."},{"key":"e_1_3_2_2_19_1","volume-title":"Proc. of the Structure in Complexity Theory Conference. 41--49","author":"Kalyanasundaram Bala","year":"1987","unstructured":"Bala Kalyanasundaram and Georg Schnitger . 1987 . The probabilistic communication complexity of set intersection . In Proc. of the Structure in Complexity Theory Conference. 41--49 . Bala Kalyanasundaram and Georg Schnitger. 1987. The probabilistic communication complexity of set intersection. In Proc. of the Structure in Complexity Theory Conference. 41--49."},{"key":"e_1_3_2_2_20_1","volume-title":"Deterministic Subgraph Detection in Broadcast CONGEST. In Proc. of the Conference on Principles of Distributed Systems (OPODIS)","volume":"95","author":"Janne","unstructured":"Janne H. Korhonen and Joel Rybicki. 2018 . Deterministic Subgraph Detection in Broadcast CONGEST. In Proc. of the Conference on Principles of Distributed Systems (OPODIS) , Vol. 95 . 4:1--4:16. Janne H. Korhonen and Joel Rybicki. 2018. Deterministic Subgraph Detection in Broadcast CONGEST. In Proc. of the Conference on Principles of Distributed Systems (OPODIS), Vol. 95. 4:1--4:16."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212744"},{"key":"e_1_3_2_2_22_1","volume-title":"Proc. of the Symposium on Theoretical Aspects of Computer Science (STACS). Schloss Dagstuhl-Leibniz- Zentrum fuer Informatik.","author":"Gall Francois Le","year":"2019","unstructured":"Francois Le Gall , Harumichi Nishimura , and Ansis Rosmanis . 2019 . Quantum advantage for the LOCAL model in distributed computing . In Proc. of the Symposium on Theoretical Aspects of Computer Science (STACS). Schloss Dagstuhl-Leibniz- Zentrum fuer Informatik. Francois Le Gall, Harumichi Nishimura, and Ansis Rosmanis. 2019. Quantum advantage for the LOCAL model in distributed computing. In Proc. of the Symposium on Theoretical Aspects of Computer Science (STACS). Schloss Dagstuhl-Leibniz- Zentrum fuer Informatik."},{"key":"e_1_3_2_2_23_1","first-page":"1","article-title":"Quantum Distributed Complexity of Set Disjointness on a Line","volume":"82","author":"Magniez Fr\u00e9d\u00e9ric","year":"2020","unstructured":"Fr\u00e9d\u00e9ric Magniez and Ashwin Nayak . 2020 . Quantum Distributed Complexity of Set Disjointness on a Line . In Proc. of the International Colloquium on Automata, Languages, and Programming (ICALP). 82 : 1 -- 82 :18. Fr\u00e9d\u00e9ric Magniez and Ashwin Nayak. 2020. Quantum Distributed Complexity of Set Disjointness on a Line. In Proc. of the International Colloquium on Automata, Languages, and Programming (ICALP). 82:1--82:18.","journal-title":"Proc. of the International Colloquium on Automata, Languages, and Programming (ICALP)."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.09.009"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.2015.0301"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31585-5_58"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0032036"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_48"},{"key":"e_1_3_2_2_29_1","volume-title":"Grover's quantum searching algorithm is optimal. Phys. Rev. A 60 (10","author":"Zalka Christof","year":"1999","unstructured":"Christof Zalka . 1999. Grover's quantum searching algorithm is optimal. Phys. Rev. A 60 (10 1999 ), 2746--2751. Issue 4. Christof Zalka. 1999. Grover's quantum searching algorithm is optimal. Phys. Rev. A 60 (10 1999), 2746--2751. Issue 4."}],"event":{"name":"PODC '22: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Salerno Italy","acronym":"PODC '22"},"container-title":["Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538413","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538413","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:20Z","timestamp":1750191140000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538413"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":29,"alternative-id":["10.1145\/3519270.3538413","10.1145\/3519270"],"URL":"https:\/\/doi.org\/10.1145\/3519270.3538413","relation":{},"subject":[],"published":{"date-parts":[[2022,7,20]]},"assertion":[{"value":"2022-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}