Towards quantum topological data analysis: torsion detection

• URL: http://arxiv.org/abs/2508.19943v2
• Date: Wed, 05 Nov 2025 17:08:57 GMT
• Title: Towards quantum topological data analysis: torsion detection
• Authors: Nhat A. Nghiem,
• Abstract summary: We introduce a quantum algorithm for torsion detection, that is, determining whether a given simplicial complex contains torsion.<n>Our algorithm, assisted by a low complexity classical procedure, can succeed with high probability and potentially offer exponential speedup.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Topological data analysis (TDA) has become an attractive area for the application of quantum computing. Recent advances have uncovered many interesting connections between the two fields. On one hand, complexity theoretic results show that estimating Betti numbers, a central task in TDA, is NP hard, indicating that a generic quantum speedup is unlikely. On the other hand, several recent studies have explored structured, less generic settings and demonstrated that quantum algorithms can still achieve significant speedups under certain conditions. To date, most of these efforts have focused on Betti numbers, which are topological invariants capturing the intrinsic connectivity and holes in a dataset. However, there is another important feature of topological spaces: torsion. Torsion represents a distinct component of homology that can reveal richer structural information. In this work, we introduce a quantum algorithm for torsion detection, that is, determining whether a given simplicial complex contains torsion. Our algorithm, assisted by a low complexity classical procedure, can succeed with high probability and potentially offer exponential speedup over the classical counterpart.

Related papers

• Quartic quantum speedups for community detection [84.14713515477784]
  We develop a quantum algorithm for hypergraph community detection that achieves a quartic quantum speedup.<n>Our algorithm is based on the Kikuchi method, which we extend beyond previously considered problems such as PCA and $p$XORSAT.
  arXiv  Detail & Related papers  (2025-10-09T17:35:17Z)
• 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)
• New aspects of quantum topological data analysis: Betti number estimation, and testing and tracking of homology and cohomology classes [0.8988769052522807]
  We show that access to additional topological information enables improved quantum algorithms for estimating Betti numbers.<n>We introduce a new approach based on homology tracking, which avoids computing the kernel of Laplacians.<n>This yields a framework that remains efficient even when Betti numbers are small, offering substantial and sometimes exponential speedups.
  arXiv  Detail & Related papers  (2025-06-02T08:43:58Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum Walks on Simplicial Complexes and Harmonic Homology: Application to Topological Data Analysis with Superpolynomial Speedups [9.538251541300028]
  We introduce a novel quantum walk that encodes the Laplacian, a key mathematical object whose spectral properties reflect the underlying simplicial complex. Our results achieve superpolynomial quantum speedup with quantum walks without relying on quantum oracles for large datasets.
  arXiv  Detail & Related papers  (2024-04-23T18:00:17Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [88.57261102552016]
  The anticipated applications of quantum computers span across science and industry.<n>We present a survey of several potential application areas of quantum algorithms.<n>We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• 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)
• Complexity-Theoretic Limitations on Quantum Algorithms for Topological Data Analysis [59.545114016224254]
  Quantum algorithms for topological data analysis seem to provide an exponential advantage over the best classical approach. We show that the central task of TDA -- estimating Betti numbers -- is intractable even for quantum computers. We argue that an exponential quantum advantage can be recovered if the input data is given as a specification of simplices.
  arXiv  Detail & Related papers  (2022-09-28T17:53:25Z)
• A streamlined quantum algorithm for topological data analysis with exponentially fewer qubits [3.5707423185282665]
  We present an improved quantum algorithm for computing persistent Betti numbers.<n>We discuss whether quantum algorithms can achieve an exponential speedup for tasks of practical interest.
  arXiv  Detail & Related papers  (2022-09-26T17:56:11Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)

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.