From Betti Numbers to Persistence Diagrams: A Hybrid Quantum Algorithm for Topological Data Analysis

• URL: http://arxiv.org/abs/2512.02081v1
• Date: Mon, 01 Dec 2025 00:40:29 GMT
• Title: From Betti Numbers to Persistence Diagrams: A Hybrid Quantum Algorithm for Topological Data Analysis
• Authors: Dong Liu,
• Abstract summary: Existing quantum topological algorithms can only efficiently compute summary statistics like Betti numbers.<n>This paper proposes a novel quantum-classical hybrid algorithm that achieves, for the first time, the leap from "quantum of computation Betti numbers" to "quantum acquisition of practical persistence diagrams"
• Score: 6.162927852040885
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Persistence diagrams serve as a core tool in topological data analysis, playing a crucial role in pathological monitoring, drug discovery, and materials design. However, existing quantum topological algorithms, such as the LGZ algorithm, can only efficiently compute summary statistics like Betti numbers, failing to provide persistence diagram information that tracks the lifecycle of individual topological features, severely limiting their practical value. This paper proposes a novel quantum-classical hybrid algorithm that achieves, for the first time, the leap from "quantum computation of Betti numbers" to "quantum acquisition of practical persistence diagrams." The algorithm leverages the LGZ quantum algorithm as an efficient feature extractor, mining the harmonic form eigenvectors of the combinatorial Laplacian as well as Betti numbers, constructing specialized topological kernel functions to train a quantum support vector machine (QSVM), and learning the mapping from quantum topological features to persistence diagrams. The core contributions of this algorithm are: (1) elevating quantum topological computation from statistical summaries to pattern recognition, greatly expanding its application value; (2) obtaining more practical topological information in the form of persistence diagrams for real-world applications while maintaining the exponential speedup advantage of quantum computation; (3) proposing a novel hybrid paradigm of "classical precision guiding quantum efficiency." This method provides a feasible pathway for the practical implementation of quantum topological data analysis.

Related papers

• Efficient Learning Algorithms for Noisy Quantum State and Process Tomography [17.414887413731385]
  We introduce a provably efficient and structure-agnostic learning framework for noisy $n$-qubit quantum circuits.<n>Results provide a scalable and practically relevant route toward characterizing large-scale noisy quantum devices.
  arXiv  Detail & Related papers  (2026-03-02T06:50:59Z)
• Probabilistic Design of Parametrized Quantum Circuits through Local Gate Modifications [40.28072745340568]
  We propose an evolution-inspired quantum architecture search algorithm, which we refer to as the local quantum architecture search.<n>The goal of the local quantum architecture search algorithm is to optimize parametrized quantum circuit architectures.<n>We evaluate the local quantum architecture search algorithm on two synthetic function-fitting regression tasks and two quantum chemistry regression datasets.
  arXiv  Detail & Related papers  (2026-02-12T22:47:03Z)
• Hybrid quantum-classical framework for Betti number estimation with applications to topological data analysis [0.7997838571956237]
  Topological data analysis (TDA) is a rapidly growing area that applies techniques from algebraic topology to extract robust features from large-scale data.<n>A key task in TDA is the estimation of (normalized) Betti numbers, which capture essential topological invariants.<n>We explore an alternative direction: combining classical and quantum resources to estimate the Betti numbers of a simplicial complex more efficiently.
  arXiv  Detail & Related papers  (2025-08-02T23:19:11Z)
• An em algorithm for quantum Boltzmann machines [40.40469032705598]
  We develop a quantum version of the em algorithm for training quantum Boltzmann machines.<n>We implement the algorithm on a semi-quantum restricted Boltzmann machine, where quantum effects are confined to the hidden layer.
  arXiv  Detail & Related papers  (2025-07-29T07:59:22Z)
• GroverGPT-2: Simulating Grover's Algorithm via Chain-of-Thought Reasoning and Quantum-Native Tokenization [43.496857395654764]
  We introduce GroverGPT-2, an LLM-based method for simulating Grover's algorithm using Chain-of-Thought (CoT) reasoning and quantum-native tokenization.<n>Our results show that GroverGPT-2 can learn and internalize quantum circuit logic through efficient processing of quantum-native tokens.<n>We identify an empirical scaling law for GroverGPT-2 with increasing qubit numbers, suggesting a path toward scalable classical simulation.
  arXiv  Detail & Related papers  (2025-05-08T01:38:12Z)
• Quantum Graph Convolutional Networks Based on Spectral Methods [10.250921033123152]
  Graph Convolutional Networks (GCNs) are specialized neural networks for feature extraction from graph-structured data.<n>This paper introduces an enhancement to GCNs based on spectral methods by integrating quantum computing techniques.
  arXiv  Detail & Related papers  (2025-03-09T05:08:15Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Utilizing Quantum Processor for the Analysis of Strongly Correlated Materials [34.63047229430798]
  This study introduces a systematic approach for analyzing strongly correlated systems by adapting the conventional quantum cluster method to a quantum circuit model. We have developed a more concise formula for calculating the cluster's Green's function, requiring only real-number computations on the quantum circuit instead of complex ones.
  arXiv  Detail & Related papers  (2024-04-03T06:53:48Z)
• Disentangling quantum neural networks for unified estimation of quantum entropies and distance measures [2.14566083603001]
  We introduce the disentangling quantum neural network (DEQNN), designed to efficiently estimate various physical quantities in quantum information.<n>Our proposed DEQNN offers a unified dimensionality reduction methodology that can significantly reduce the size of the Hilbert space while preserving the values of diverse physical quantities.
  arXiv  Detail & Related papers  (2024-01-15T14:33:03Z)
• 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)
• Topological Quantum Programming in TED-K [0.0]
  We describe a fundamental and natural scheme that we are developing, for typed functional (hence verifiable) topological quantum programming. It reflects the universal fine technical detail of topological q-bits, namely of symmetry-protected (or enhanced) topologically ordered Laughlin-type anyon ground states. The language system is under development at the "Center for Quantum and Topological Systems" at the Research Institute of NYU, Abu Dhabi.
  arXiv  Detail & Related papers  (2022-09-17T14:00:37Z)
• Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
  Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task. Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate. The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
  arXiv  Detail & Related papers  (2021-06-06T13:15:25Z)

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.