Homology Computation of Large Point Clouds using Quantum Annealing

Abstract

Homology is a tool in topological data analysis which measures the shape of the data. In many cases, these measurements translate into new insights which are not available by other means. To compute homology, we rely on mathematical constructions which scale exponentially with the size of the data. Therefore, for large point clouds, the computation is infeasible using classical computers. In this paper, we present a quantum annealing pipeline for computation of homology of large point clouds. The pipeline takes as input a graph approximating the given point cloud. It uses quantum annealing to compute a clique covering of the graph and then uses this cover to construct a Mayer-Vietoris complex. The pipeline terminates by performing a simplified homology computation of the Mayer-Vietoris complex. We have introduced three different clique coverings and their quantum annealing formulation. Our pipeline scales polynomially in the size of the data, once the covering step is solved. To prove correctness of our algorithm, we have also included tests using D-Wave 2X quantum processor.

References in corpus (2)

• A practical heuristic for finding graph minors
• Fast clique minor generation in Chimera qubit connectivity graphs

Cited by in corpus (7)

• Quantum Machine Learning
• Prime factorization using quantum annealing and computational algebraic geometry
• Quantum Computing: An Overview Across the System Stack
• Finding self-similar behavior in quantum many-body dynamics via persistent homology
• Computing Wasserstein Distance for Persistence Diagrams on a Quantum Computer
• Finding Maximum Cliques on the D-Wave Quantum Annealer
• The Topology of Mutated Driver Pathways