LIPIcs.OPODIS.2023.2.pdf
- Filesize: 385 kB
- 1 pages
Document
Quantum Distributed Computing: Potential and Limitations (Invited Talk)
Author
François Le Gall 
-
Part of:
Volume:
27th International Conference on Principles of Distributed Systems (OPODIS 2023)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Principles of Distributed Systems (OPODIS) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2024-01-18
File
Document Identifiers
Author Details
Cite AsGet BibTex
François Le Gall. Quantum Distributed Computing: Potential and Limitations (Invited Talk). In 27th International Conference on Principles of Distributed Systems (OPODIS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 286, p. 2:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.OPODIS.2023.2
https://doi.org/10.4230/LIPIcs.OPODIS.2023.2
Abstract
The subject of this talk is quantum distributed computing, i.e., distributed computing where the processors of the network can exchange quantum messages. In the first part of the talk I survey recent results [Taisuke Izumi and François Le Gall, 2019; Taisuke Izumi et al., 2020; François Le Gall and Frédéric Magniez, 2018; François Le Gall et al., 2019; Xudong Wu and Penghui Yao, 2022] and some older results [Michael Ben-Or and Avinatan Hassidim, 2005; Seiichiro Tani et al., 2012] that show the potential of quantum distributed algorithms. In the second part I present our recent work [Xavier Coiteux-Roy et al., 2023] showing the limitations of quantum distributed algorithms for approximate graph coloring. Finally, I mention interesting and important open questions in quantum distributed computing.
Subject Classification
ACM Subject Classification
- Theory of computation → Distributed algorithms
- Theory of computation → Quantum computation theory
Keywords
- Quantum computing
- distributed algorithms
- CONGEST model
- LOCAL model
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- Michael Ben-Or and Avinatan Hassidim. Fast quantum byzantine agreement. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), pages 481-485, 2005. URL: https://doi.org/10.1145/1060590.1060662.
- Xavier Coiteux-Roy, Francesco d'Amore, Rishikesh Gajjala, Fabian Kuhn, François Le Gall, Henrik Lievonen, Augusto Modanese, Marc-Olivier Renou, Gustav Schmid, and Jukka Suomela. No distributed quantum advantage for approximate graph coloring. CoRR, abs/2307.09444, 2023. URL: https://doi.org/10.48550/ARXIV.2307.09444.
- Taisuke Izumi and François Le Gall. Quantum distributed algorithm for the All-Pairs Shortest Path problem in the CONGEST-CLIQUE model. In Proceedings of the 38th ACM Symposium on Principles of Distributed Computing (PODC 2019), pages 84-93, 2019. URL: https://doi.org/10.1145/3293611.3331628.
- Taisuke Izumi, François Le Gall, and Frédéric Magniez. Quantum distributed algorithm for triangle finding in the CONGEST model. In Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), pages 23:1-23:13, 2020. URL: https://doi.org/10.4230/LIPICS.STACS.2020.23.
- François Le Gall and Frédéric Magniez. Sublinear-time quantum computation of the diameter in CONGEST networks. In Proceedings of the 37th ACM Symposium on Principles of Distributed Computing (PODC 2018), pages 337-346, 2018. URL: https://doi.org/10.1145/3212734.3212744.
- François Le Gall, Harumichi Nishimura, and Ansis Rosmanis. Quantum advantage for the LOCAL model in distributed computing. In Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), pages 49:1-49:14, 2019. URL: https://doi.org/10.4230/LIPICS.STACS.2019.49.
- Seiichiro Tani, Hirotada Kobayashi, and Keiji Matsumoto. Exact quantum algorithms for the leader election problem. ACM Transactions on Computation Theory, 4(1):1:1-1:24, 2012. URL: https://doi.org/10.1145/2141938.2141939.
- Xudong Wu and Penghui Yao. Quantum complexity of weighted diameter and radius in CONGEST networks. In Proceedings of the 42nd ACM Symposium on Principles of Distributed Computing (PODC 2022), pages 120-130, 2022. URL: https://doi.org/10.1145/3519270.3538441.