← Back to papers
Quantum HodgeRank: Topology-based rank aggregation on quantum computers
Caesnan M. G. Leditto, A. Southwell, Behnam Tonekaboni, Muhammad Usman, Kavan Modi·July 29, 2024·DOI: 10.1103/m6nc-ypl7
Physics
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
HodgeRank generalizes ranking algorithms, e.g. Google PageRank, to rank alternatives based on real-world (often incomplete) data using graphs and discrete exterior calculus. It analyzes multipartite interactions on high-dimensional networks with a complexity that scales exponentially with dimension. We develop a quantum algorithm that approximates the HodgeRank solution with complexity independent of dimension. Our algorithm extracts relevant information from the state such as the ranking consistency, which achieves a superpolynomial speedup over similar classical methods.