Abstract: Graph sparsification serves as a foundation for many algorithms, such as approximation algorithms for graph cuts and Laplacian system solvers. As its natural generalization, hypergraph sparsification has recently gained increasing attention, with broad applications in graph machine learning and other areas. In this work, we propose the first quantum algorithm for hypergraph sparsification, addressing an open problem proposed by Apers and de Wolf (FOCS'20). For a weighted hypergraph with n vertices, m hyperedges, and rank r, our algorithm outputs a near-linear size ε-spectral sparsifier in time O(rmn/ε). This algorithm matches the quantum lower bound for constant r and demonstrates quantum speedup when compared with the state-of-the-art O(mr)-time classical algorithm. As applications, our algorithm implies quantum speedups for computing hypergraph cut sparsifiers, approximating hypergraph mincuts and hypergraph s-t mincuts.
Join our community today and start discussing with our members by participating in exciting events, competitions, and challenges. Sign up now to engage with quantum experts!
