Accelerating Spectral Clustering on Quantum and Analog Platforms
<|reference_start|>Accelerating Spectral Clustering on Quantum and Analog Platforms: We introduce a novel hybrid quantum-analog algorithm to perform graph clustering that exploits connections between the evolution of dynamical systems on graphs and the underlying graph spectra. This approach constitutes a new class of algorithms that combine emerging quantum and analog platforms to accelerate computations. Our hybrid algorithm is equivalent to spectral clustering and has a computational complexity of $O(N)$, where $N$ is the number of nodes in the graph, compared to $O(N^3)$ scaling on classical computing platforms. The proposed method employs the dynamic mode decomposition (DMD) framework on the data generated by Schr\"{o}dinger dynamics that evolves on the manifold induced by the graph Laplacian. In particular, we prove and demonstrate that one can extract the eigenvalues and scaled eigenvectors of the normalized graph Laplacian by evolving Schr\"{o}dinger dynamics on quantum computers followed by DMD computations on analog devices.<|reference_end|>
@article{xu2024accelerating,
    title={Accelerating Spectral Clustering on Quantum and Analog Platforms},
    author={Xingzi Xu and Tuhin Sahai},
    journal={arXiv preprint arXiv:2408.08486},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.08486},
    primaryClass={cs.DS math.DS math.SP}
}