{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:09:48Z","timestamp":1750219788795,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,16]],"date-time":"2023-06-16T00:00:00Z","timestamp":1686873600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["2218678"],"award-info":[{"award-number":["2218678"]}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["2114269"],"award-info":[{"award-number":["2114269"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,19]]},"DOI":"10.1145\/3583668.3594600","type":"proceedings-article","created":{"date-parts":[[2023,6,16]],"date-time":"2023-06-16T22:28:38Z","timestamp":1686954518000},"page":"286-289","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: Improved Consensus in Quantum Networks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4842-0533","authenticated-orcid":false,"given":"Mohammadtaghi","family":"Hajiaghayi","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1316-7788","authenticated-orcid":false,"given":"Dariusz Rafal","family":"Kowalski","sequence":"additional","affiliation":[{"name":"Augusta University, Augusta, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9278-3935","authenticated-orcid":false,"given":"Jan","family":"Olkowski","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,6,16]]},"reference":[{"volume-title":"Revisited. In Proc.of the ACM Symposium on Principles of Distributed Computing (PODC). 317--326","author":"Abraham I.","key":"e_1_3_2_1_1_1","unstructured":"I. Abraham, T.-H. Hubert Chan, D. Dolev, K. Nayak, R. Pass, L. Ren, and E. Shi. 2019. Communication Complexity of Byzantine Agreement, Revisited. In Proc.of the ACM Symposium on Principles of Distributed Computing (PODC). 317--326."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-017-0315-1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/3271116.3271169"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278304"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411510"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/0471478210"},{"volume-title":"Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing (PODC). 193--199","author":"Bar-Joseph Z.","key":"e_1_3_2_1_7_1","unstructured":"Z. Bar-Joseph and A M. Ben-Or. 1998. Tight Lower Bound for Randomized Synchronous Consensus. In Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing (PODC). 193--199."},{"volume-title":"Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC).","author":"Ben-Or M.","key":"e_1_3_2_1_8_1","unstructured":"M. Ben-Or and A. Hassidim. 2005. Fast quantum byzantine agreement. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1412700.1412717"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.08.001"},{"volume-title":"Proceedings of the 28th ACM Symposium on Principles of Distributed Computing (PODC). 111--120","author":"Chlebus B. S.","key":"e_1_3_2_1_11_1","unstructured":"B. S. Chlebus, D. R. Kowalski, and M. Strojnowski. 2009. Fast scalable deterministic consensus for crash failures. In Proceedings of the 28th ACM Symposium on Principles of Distributed Computing (PODC). 111--120."},{"volume-title":"Proceedings of the 24th International Symposium on Distributed Computing (DISC).","author":"Chlebus B. S.","key":"e_1_3_2_1_12_1","unstructured":"B. S. Chlebus, D. R. Kowalski, and M. Strojnowski. 2010. Scalable Quantum Consensus for Crash Failures. In Proceedings of the 24th International Symposium on Distributed Computing (DISC)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-022-03492-y"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/65950.65956"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214112"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793255527"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539790187084"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90033-3"},{"volume-title":"Proceedings of the 36th IEEE Symposium on Foundations of Computer Science (FOCS).","author":"Galil Z.","key":"e_1_3_2_1_19_1","unstructured":"Z. Galil, A. Mayer, and M. Yung. 1995. Resolving message complexity of Byzantine agreement and beyond. In Proceedings of the 36th IEEE Symposium on Foundations of Computer Science (FOCS)."},{"volume-title":"Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 965--977","author":"Gilbert S.","key":"e_1_3_2_1_20_1","unstructured":"S. Gilbert and D. R. Kowalski. 2010. Distributed agreement with optimal communication complexity. In Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 965--977."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01187074"},{"volume-title":"Proceedings of the 54th Annual ACM Symposium on Theory of Computing (STOC). 488--501","author":"Hajiaghayi M.","key":"e_1_3_2_1_22_1","unstructured":"M. Hajiaghayi, D. R. Kowalski, and J. Olkowski. 2022. Improved communication complexity of fault-tolerant consensus. In Proceedings of the 54th Annual ACM Symposium on Theory of Computing (STOC). 488--501."},{"key":"e_1_3_2_1_23_1","unstructured":"MohammadTaghi Hajiaghayi Dariusz R. Kowalski and Jan Olkowski. 2023. Fault-Tolerant Consensus in Quantum Networks. arXiv:2305.10618 [cs.DS]"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400841"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10773-019-04269-3"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2141938.2141939"},{"key":"e_1_3_2_1_28_1","first-page":"18","article-title":"Breaking the O(n2) bit barrier: Scalable byzantine agreement with an adaptive adversary","volume":"18","author":"Valerie King Jared Saia","year":"2011","unstructured":"Jared Saia Valerie King. 2011. Breaking the O(n2) bit barrier: Scalable byzantine agreement with an adaptive adversary. J. ACM 18, 24 (2011), 18--1.","journal-title":"J. ACM"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538413"},{"volume-title":"Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC).","author":"Wu X.","key":"e_1_3_2_1_30_1","unstructured":"X. Wu and P. Yao. 2022. Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC)."}],"event":{"name":"PODC '23: 2023 ACM Symposium on Principles of Distributed Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGOPS ACM Special Interest Group on Operating Systems"],"location":"Orlando FL USA","acronym":"PODC '23"},"container-title":["Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583668.3594600","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583668.3594600","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583668.3594600","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:55Z","timestamp":1750178275000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583668.3594600"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,16]]},"references-count":30,"alternative-id":["10.1145\/3583668.3594600","10.1145\/3583668"],"URL":"https:\/\/doi.org\/10.1145\/3583668.3594600","relation":{},"subject":[],"published":{"date-parts":[[2023,6,16]]},"assertion":[{"value":"2023-06-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}