Quantum Persistent Homology

• URL: http://arxiv.org/abs/2202.12965v1
• Date: Fri, 25 Feb 2022 20:52:03 GMT
• Title: Quantum Persistent Homology
• Authors: Bernardo Ameneyro, Vasileios Maroulas, George Siopsis
• Abstract summary: Persistent homology is a powerful mathematical tool that summarizes useful information about the shape of data. We develop an efficient quantum computation of persistent Betti numbers, which track topological features of data across different scales. Our approach employs a persistent Dirac operator whose square yields the persistent Laplacian, and in turn the underlying persistent Betti numbers.
• Score: 0.9023847175654603
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Persistent homology is a powerful mathematical tool that summarizes useful information about the shape of data allowing one to detect persistent topological features while one adjusts the resolution. However, the computation of such topological features is often a rather formidable task necessitating the subsampling the underlying data. To remedy this, we develop an efficient quantum computation of persistent Betti numbers, which track topological features of data across different scales. Our approach employs a persistent Dirac operator whose square yields the persistent combinatorial Laplacian, and in turn the underlying persistent Betti numbers which capture the persistent features of data. We also test our algorithm on point cloud data.

Related papers

• Topograph: An efficient Graph-Based Framework for Strictly Topology Preserving Image Segmentation [78.54656076915565]
  Topological correctness plays a critical role in many image segmentation tasks. Most networks are trained using pixel-wise loss functions, such as Dice, neglecting topological accuracy. We propose a novel, graph-based framework for topologically accurate image segmentation.
  arXiv  Detail & Related papers  (2024-11-05T16:20:14Z)
• A Cosmic-Scale Benchmark for Symmetry-Preserving Data Processing [1.96862953848735]
  We benchmark the ability of graph neural networks to simultaneously capture local clustering environments and long-range correlations. We find that current architectures fail to capture information from long-range correlations as effectively as domain-specific baselines.
  arXiv  Detail & Related papers  (2024-10-27T16:58:48Z)
• Discovering symbolic expressions with parallelized tree search [59.92040079807524]
  Symbolic regression plays a crucial role in scientific research thanks to its capability of discovering concise and interpretable mathematical expressions from data. Existing algorithms have faced a critical bottleneck of accuracy and efficiency over a decade when handling problems of complexity. We introduce a parallelized tree search (PTS) model to efficiently distill generic mathematical expressions from limited data.
  arXiv  Detail & Related papers  (2024-07-05T10:41:15Z)
• Improving embedding of graphs with missing data by soft manifolds [51.425411400683565]
  The reliability of graph embeddings depends on how much the geometry of the continuous space matches the graph structure. We introduce a new class of manifold, named soft manifold, that can solve this situation. Using soft manifold for graph embedding, we can provide continuous spaces to pursue any task in data analysis over complex datasets.
  arXiv  Detail & Related papers  (2023-11-29T12:48:33Z)
• Non-isotropic Persistent Homology: Leveraging the Metric Dependency of PH [5.70896453969985]
  We show that information on the point cloud is lost when restricting persistent homology to a single distance function. We numerically show that non-isotropic persistent homology can extract information on orientation, orientational variance, and scaling of randomly generated point clouds.
  arXiv  Detail & Related papers  (2023-10-25T08:03:17Z)
• Higher-order topological kernels via quantum computation [68.8204255655161]
  Topological data analysis (TDA) has emerged as a powerful tool for extracting meaningful insights from complex data. We propose a quantum approach to defining Betti kernels, which is based on constructing Betti curves with increasing order.
  arXiv  Detail & Related papers  (2023-07-14T14:48:52Z)
• Human Semantic Segmentation using Millimeter-Wave Radar Sparse Point Clouds [3.3888257250564364]
  This paper presents a framework for semantic segmentation on sparse sequential point clouds of millimeter-wave radar. The sparsity and capturing temporal-topological features of mmWave data is still a problem. We introduce graph structure and topological features to the point cloud and propose a semantic segmentation framework. Our model achieves mean accuracy on a custom dataset by $mathbf82.31%$ and outperforms state-of-the-art algorithms.
  arXiv  Detail & Related papers  (2023-04-27T12:28:06Z)
• Quantum Persistent Homology for Time Series [0.9023847175654603]
  Persistent homology summarizes the shape of data through tracking topological features across changes in different scales. Two quantum algorithms of persistent homology have been developed based on two different approaches. In this paper, we establish a quantum Takens's delay embedding algorithm, which turns a time series into a point cloud. Having this quantum transformation of time series to point clouds, then one may use a quantum persistent homology algorithm to extract the topological features from the point cloud.
  arXiv  Detail & Related papers  (2022-11-08T18:58:18Z)
• A streamlined quantum algorithm for topological data analysis with exponentially fewer qubits [5.478764356647437]
  We present an improved quantum algorithm for computing persistent Betti numbers. We discuss whether quantum algorithms can achieve an exponential speedup for tasks of practical interest.
  arXiv  Detail & Related papers  (2022-09-26T17:56:11Z)
• Multiway Non-rigid Point Cloud Registration via Learned Functional Map Synchronization [105.14877281665011]
  We present SyNoRiM, a novel way to register multiple non-rigid shapes by synchronizing the maps relating learned functions defined on the point clouds. We demonstrate via extensive experiments that our method achieves a state-of-the-art performance in registration accuracy.
  arXiv  Detail & Related papers  (2021-11-25T02:37:59Z)
• Stable and consistent density-based clustering via multiparameter persistence [77.34726150561087]
  We consider the degree-Rips construction from topological data analysis. We analyze its stability to perturbations of the input data using the correspondence-interleaving distance. We integrate these methods into a pipeline for density-based clustering, which we call Persistable.
  arXiv  Detail & Related papers  (2020-05-18T19:45:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.