A streamlined quantum algorithm for topological data analysis with exponentially fewer qubits

Mcardle, Sam and Gilyén, András Pál and Berta, Mario (2026) A streamlined quantum algorithm for topological data analysis with exponentially fewer qubits. QUANTUM, 10. ISSN 2521-327X

Preview

Text q-2026-04-10-2058.pdf - Draft Version Download (1MB) | Preview

Abstract

Topological invariants of a dataset, such as the number of holes that survive from one length scale to another (persistent Betti numbers) can be used to analyze and classify data in machine learning applications. We present an improved quantum algorithm for computing persistent Betti numbers, and provide an end-to-end complexity analysis. Our approach provides large polynomial time improvements, and an exponential space saving, over existing quantum algorithms. Subject to gap dependencies, our algorithm obtains an almost quintic speedup in the number of datapoints over previously known rigorous classical algorithms for computing the persistent Betti numbers to constant additive error – the salient task for applications. However, we also introduce a quantum-inspired classical power method with provable scaling only quadratically worse than the quantum algorithm. This gives a provable classical algorithm with scaling comparable to existing classical heuristics, subject to assumptions on the gap scaling. We discuss whether quantum algorithms can achieve an exponential speedup for tasks of practical interest, as claimed previously. We conclude that there is currently no evidence for this being the case. © 2026, Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften. All Rights Reserved.

Actions (login required)

View Item