(Quantum) complexity of testing signed graph clusterability - Institut de Recherche en Informatique Fondamentale
Communication Dans Un Congrès Année : 2024

(Quantum) complexity of testing signed graph clusterability

Kuo-Chin Chen
Min-Hsiu Hsieh

Résumé

This study examines clusterability testing for a signed graph in the bounded-degree model. Our contributions are two-fold. First, we provide a quantum algorithm with query complexity $\tilde{O}(N^{1/3})$ for testing clusterability, which yields a polynomial speedup over the best classical clusterability tester known [arXiv:2102.07587]. Second, we prove an $\tilde{\Omega}(\sqrt{N})$ classical query lower bound for testing clusterability, which nearly matches the upper bound from [arXiv:2102.07587]. This settles the classical query complexity of clusterability testing, and it shows that our quantum algorithm has an advantage over any classical algorithm.
Fichier principal
Vignette du fichier
2311.10480.pdf (1.37 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04516220 , version 1 (22-03-2024)

Identifiants

Citer

Kuo-Chin Chen, Simon Apers, Min-Hsiu Hsieh. (Quantum) complexity of testing signed graph clusterability. Theory of Quantum Computation, Communication and Cryptography (TQC 2024), Sep 2024, Okinawa, Japan. pp.1-16, ⟨10.4230/LIPIcs.TQC.2024.8⟩. ⟨hal-04516220⟩
90 Consultations
22 Téléchargements

Altmetric

Partager

More