New aspects of quantum topological data analysis: Betti number estimation, and testing and tracking of homology and cohomology classes

TL;DR

This paper introduces quantum algorithms for efficiently estimating Betti numbers and testing homology classes in topological data analysis, achieving exponential speedups over classical methods.

Contribution

It presents novel quantum algorithms for topological invariants, including Betti number estimation and homology testing, with polylogarithmic complexity and exponential quantum speedups.

Findings

Polylogarithmic complexity in the number of simplices for Betti number estimation.

Exponential quantum speedups for homology tracking and property testing.

First quantum algorithms for constructing and manipulating cocycles efficiently.

Abstract

We introduce several new quantum algorithms for estimating homological invariants, specifically Betti numbers and persistent Betti numbers, of a simplicial complex given via a structured classical input. At the core of our algorithm lies the ability to efficiently construct the block-encoding of Laplacians (and persistent Laplacians) based on the classical description of the given complex. From such block-encodings, Betti numbers (and persistent Betti numbers) can be estimated. The complexity of our method is polylogarithmic in the number of simplices in both simplex-sparse and simplex-dense regimes, thus offering an advantage over existing works. Moreover, prior quantum algorithms based on spectral methods incur significant overhead due to their reliance on estimating the kernel of combinatorial Laplacians, particularly when the Betti number is small. We introduce a new approach for estimating Betti numbers based on homology tracking and homology property testing, which enables exponential quantum speedups over both classical and prior quantum approaches under sparsity and structure assumptions. We further initiate the study of homology triviality and equivalence testing as natural property testing problems in topological data analysis, and provide efficient quantum algorithms with time complexity nearly linear in the number of simplices when the rank of the boundary operator is large. In addition, we develop a cohomological approach based on block-encoded projections onto cocycle spaces, enabling rank-independent testing of homology equivalence. This yields the first quantum algorithms for constructing and manipulating r-cocycles in time polylogarithmic in the size of the complex. Together, these results establish a new direction in quantum topological data analysis and demonstrate that computing topological invariants can serve as a fertile ground for provable quantum advantage.