arXiv:2307.07383 · IEEE International Conference on Quantum Computing and Engineering (QCE)

Higher-Order Topological Kernels via Quantum Computation

Massimiliano Incudini, Francesco Martini, Alessandra Di Pierro

Published Sep 17, 2023• 4 citations

Abstract

Topological data analysis (TDA) has emerged as a powerful tool for extracting meaningful insights from complex data. TDA enhances the analysis of objects by embedding them into a simplicial complex and extracting useful global properties such as the Betti numbers, i.e. the number of multidimensional holes, which can be used to define kernel methods that are easily integrated with existing machine-learning algorithms. These kernel methods have found broad applications, as they rely on powerful mathematical frameworks which provide theoretical guarantees on their performance. However, the computation of higher-dimensional Betti numbers can be prohibitively expensive on classical hardware, while quantum algorithms can approximate them in polynomial time in the instance size. In this work, we propose a quantum approach to defining topological kernels, which is based on constructing Betti curves, i.e. topological fingerprint of filtrations with increasing order. We exhibit a working prototype of our approach implemented on a noiseless simulator and show its robustness by means of some empirical results suggesting that topological approaches may offer an advantage in quantum machine learning.

DOI: 10.1109/qce57702.2023.00076

Related papers

Quantum algorithm for persistent Betti numbers and topological data analysis

Ryu Hayakawa

Topological data analysis (TDA) is an emergent field of data analysis. The critical step of TDA is computing the persistent Betti numbers. Existing classical algorithms for TDA are limited if we want to learn from high-dimensional topological features because the number of high-dimensional simplices grows exponentially in the size of the data. In the context of quantum computation, it has been previously shown that there exists an efficient quantum algorithm for estimating the Betti numbers even in high dimensions. However, the Betti numbers are less general than the persistent Betti numbers, and there have been no quantum algorithms that can estimate the persistent Betti numbers of arbitrary dimensions. This paper shows the first quantum algorithm that can estimate the (normalized) persistent Betti numbers of arbitrary dimensions. Our algorithm is efficient for simplicial complexes such as the Vietoris-Rips complex and demonstrates exponential speedup over the known classical algorithms.

arXiv:2111.00433QuantumDec 7, 202240 citations

Practical Quantum Topological Data Analysis with Applications to High-Dimensional Feature Extraction and Time Series Analysis

Jason Iaconis, Sayonee Ray, Samwel Sekwao +2 more

Topological data analysis (TDA) provides a powerful framework for extracting information about the shape of complex, unstructured data, but the classical cost of computing high dimensional topological features limits its application. Quantum algorithms for TDA offer a route around this bottleneck, yet existing approaches typically focus on exact or high precision Betti number estimation, making the regime for practical quantum advantage appear narrow. Here, we instead frame quantum TDA as a feature-extraction method for downstream data analysis by extracting low-order spectral information from the combinatorial Laplacian as a proxy for high-dimensional topology. We support this perspective from both the application and algorithmic sides. First, we show that higher-order TDA features improve predictive performance in two time-series applications: functional MRI analysis for neurodegenerative disease classification and financial time-series analysis for identifying market instability. Second, we develop a moment-based quantum algorithm and show that low-order moments, including the relative trace, are strongly correlated with high-dimensional Betti information, even when the relative Betti number is small. Finally, we present circuit constructions, resource estimates, quantum-classical crossover projections, and experimental results from a Barium development system similar to the forthcoming IonQ Tempo line, extracting Laplacian-derived observables from graph instances and quantitatively comparing them with exact Betti information. Together, these results establish quantum TDA as a practical approach for extracting topological features from classically challenging data

quant-pharXiv:2607.27206Jul 30, 20260 citations

Quantum-Enhanced Topological Data Analysis: A Peep from an Implementation Perspective

Ankit Khandelwal, M Girish Chandra

There is heightened interest in quantum algorithms for Topological Data Analysis (TDA) as it is a powerful tool for data analysis, but it can get highly computationally expensive. Even though there are different propositions and observations for Quantum Topological Data Analysis (QTDA), the necessary details to implement them on software platforms are lacking. Towards closing this gap, the present paper presents an implementation of one such algorithm for calculating Betti numbers.The step-by-step instructions for the chosen quantum algorithm and the aspects of how it can be used for machine learning tasks are provided. We provide encouraging results on using Betti numbers for classification and give a preliminary analysis of the effect of the number of shots and precision qubits on the outcome of the quantum algorithm.

arXiv:2302.09553IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd ForumMay 1, 20234 citations

Hybrid quantum-classical framework for Betti number estimation with applications to topological data analysis

Nhat A. Nghiem, Tzu-Chieh Wei

Topological data analysis (TDA) is a rapidly growing area that applies techniques from algebraic topology to extract robust features from large-scale data. A key task in TDA is the estimation of (normalized) Betti numbers, which capture essential topological invariants. While recent work has led to quantum algorithms for this problem, we explore an alternative direction: combining classical and quantum resources to estimate the Betti numbers of a simplicial complex more efficiently. Assuming the classical description of a simplicial complex, that is, its set of vertices and edges, we propose a hybrid quantum-classical algorithm. The classical component enumerates all simplices, and this combinatorial structure is subsequently processed by a quantum algorithm to estimate the Betti numbers. We analyze the performance of our approach and identify regimes where it potentially achieves polynomial to exponential speedups over existing quantum methods, at the trade-off of using more ancilla qubits. We further demonstrate the utility of normalized Betti numbers in concrete applications, highlighting the broader potential of hybrid quantum algorithms in topological data analysis.

arXiv:2508.01516Aug 2, 20250 citations

Quantum-Inspired Algorithms for Topological Data Analysis

Jincheng Zhang

Topological data analysis (TDA) has emerged as a powerful tool for uncovering hidden patterns and structures within complex datasets. However, traditional TDA algorithms can be computationally intensive, particularly when dealing with high-dimensional data. This paper explores the application of quantum-inspired algorithms to enhance TDA, aiming to improve both efficiency and accuracy. We propose a framework that leverages concepts from quantum mechanics, such as entanglement and superposition, to simulate and manipulate topological data structures. The core mechanism involves the use of quantum-inspired simulation techniques to represent and process persistent homology calculations, resulting in a potential acceleration of the algorithm. We demonstrate the theoretical feasibility and outline a potential implementation strategy, suggesting that this approach could unlock new insights within TDA and provide a pathway toward more scalable and robust topological analysis methods. The primary focus is on developing a computational model that mimics aspects of quantum computation without requiring actual quantum hardware, focusing instead on algorithmic design inspired by quantum principles. This work establishes a foundational approach for integrating quantum-inspired techniques into the domain of TDA, paving the way for future research and development in this exciting area.

Aug 31, 20260 citations

Topological Data Analysis with Quantum-Enhanced Feature Extraction

Jincheng Zhang

This paper investigates the integration of Topological Data Analysis (TDA) with quantum algorithms to enhance feature extraction processes. Traditional feature extraction methods often struggle with noisy data and limited representation, while TDA offers a powerful framework for identifying inherent patterns and structures within complex datasets. We propose a novel approach that leverages the topological properties of data to generate robust and informative features, ultimately improving the performance of machine learning models. The paper explores the potential of quantum algorithms, specifically Quantum Feature Extraction (QFE), to accelerate and refine this process. We present a preliminary implementation demonstrating the efficacy of this combined technique, showcasing improved accuracy in a simulated dataset. The research explores the benefits of using quantum algorithms to discover hidden patterns that classical methods miss, offering a pathway toward more accurate and resilient machine learning.

Sep 7, 20260 citations