Work

Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks

Year: 2022

Type: article

Abstract: This paper studies the round complexity of computing the weighted diameter and radius of a graph in the quantum CONGEST model. We present a quantum algorithm that (1+o (1))-approximates the diameter and radius with round complexity Õ (min (n n9/10D3/10, n)) , where D denotes the unweighted diameter.

Source: IEEE Transactions on Information Theory

DOI: 10.1109/tit.2026.3704289

Authors: Xudong Wu, Penghui Yao

Institution: Nanjing University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: National Natural Science Foundation of China, Natural Science Foundation of Jiangsu Province, Overseas Expertise Introduction Center for Discipline Innovation of Food Nutrition and Human Health (111 Center)