Provable Quantum Speedups for Computing Persistence in Topological Data Analysis

Topological data analysis (TDA) aims to extract noise-robust features from a dataset by examining the number and persistence of holes in its topology. We provide an efficient quantum algorithm for a computational problem closely related to a core task in TDA—determining whether a given hole persists across different length scales. Further, we prove the problem itself is B Q P 1 -hard, implying that a classical solution is extremely unlikely; this stands in contrast to all previous quantum approaches to TDA, where the problems were also intractable for quantum computers, or where a rigorous proof of classical hardness still remains open. This result implies an exponential quantum speedup for this problem under standard complexity-theoretic assumptions. Our approach relies on encoding the persistence of a hole in a variant of the guided sparse Hamiltonian problem, where the guiding state is constructed from a harmonic representative of the hole.