Quantum distance approximation for persistence diagrams
Open Access
- 23 January 2025
- journal article
- research article
- Published by IOP Publishing in Journal of Physics: Complexity
- Vol. 6 (1) , 015005
Abstract
Topological data analysis (TDA) methods can be useful for classification and clustering tasks in many different fields as they can provide two dimensional persistence diagrams that summarize important information about the shape of potentially complex and high dimensional data sets. The space of persistence diagrams can be endowed with various metrics, which admit a statistical structure and allow to use these summaries for machine learning algorithms, e.g. the Wasserstein distance. However, computing the distance between two persistence diagrams involves finding an optimal way to match the points of the two diagrams and may not always be an easy task for classical computers. Recently, quantum algorithms have shown the potential to speedup the process of obtaining the persistence information displayed on persistence diagrams by estimating the spectra of persistent Dirac operators. So, in this work we explore the potential of quantum computers to estimate the distance between persistence diagrams as the next step in the design of a fully quantum framework for TDA. In particular we propose variational quantum algorithms for the Wasserstein distance as well as the d p c distance. Our implementation is a weighted version of the quantum approximate optimization Algorithm that relies on control clauses to encode the constraints of the optimization problem.Keywords
All Related Versions
Funding Information
- National Science Foundation (DGE-2152168)
This publication has 51 references indexed in Scilit:
- Quantum persistent homologyJournal of Applied and Computational Topology, 2024
- A random persistence diagram generatorStatistics and Computing, 2022
- Persistent spectral graphInternational Journal for Numerical Methods in Biomedical Engineering, 2020
- Signal classification with a point process distance on the space of persistence diagramsAdvances in Data Analysis and Classification, 2017
- Persistent homology for the quantitative prediction of fullerene stabilityJournal of Computational Chemistry, 2014
- jHoles: A Tool for Understanding Biological Complex Networks via Clique Weight Rank Persistent HomologyElectronic Notes in Theoretical Computer Science, 2014
- Sliding Windows and Persistence: An Application of Topological Methods to Signal AnalysisFoundations of Computational Mathematics, 2014
- Distributed computation of coverage in sensor networks by homological methodsApplicable Algebra in Engineering, Communication and Computing, 2012
- Zigzag PersistenceFoundations of Computational Mathematics, 2010
- Computing Persistent HomologyDiscrete & Computational Geometry, 2004