2021/08/05 by Shashanka Ubaru, Ubaru, Shashanka, Ismail Yunus Akhalwaya +7 · 7 citations
Computer Science · Mathematics · Physics and Astronomy · #FOS: Computer and information sciences #FOS: Mathematics #FOS: Physical sciences #Homotopy and Cohomology in Algebraic Topology #Machine Learning (cs.LG) #Markov Chains and Monte Carlo Methods #Numerical Analysis (math.NA) #Quantum Physics (quant-ph) #Topological and Geometric Data Analysis #cs.LG #cs.NA #math.NA #quant-ph
paper · pdf · doi:10.48550/arxiv.2108.02811
27 pages
arxiv created 2021/08/05 · openalex publication_date 2021/08/05 · arxiv updated 2021/08/09 · openalex created_date 2021/08/16 · openalex updated_date 2026/07/28
Quantum computing offers the potential of exponential speedups for certain classical computations. Over the last decade, many quantum machine learning (QML) algorithms have been proposed as candidates for such exponential improvements. However, two issues unravel the hope of exponential speedup for some of these QML algorithms: the data-loading problem and, more recently, the stunning dequantization results of Tang et al. A third issue, namely the fault-tolerance requirements of most QML algorithms, has further hindered their practical realization. The quantum topological data analysis (QTDA) algorithm of Lloyd, Garnerone and Zanardi was one of the first QML algorithms that convincingly offered an expected exponential speedup. From the outset, it did not suffer from the data-loading problem. A recent result has also shown that the generalized problem solved by this algorithm is likely classically intractable, and would therefore be immune to any dequantization efforts. However, the QTDA algorithm of Lloyd et~al. has a time complexity of O(n4/(ε2 δ)) (where n is the number of data points, ε is the error tolerance, and δ is the smallest nonzero eigenvalue of the restricted Laplacian) and requires fault-tolerant quantum computing, which has not yet been achieved. In this paper, we completely overhaul the QTDA algorithm to achieve an improved exponential speedup and depth complexity of O(nlog(1/(δε))). Our approach includes three key innovations: (a) an efficient realization of the combinatorial Laplacian as a sum of Pauli operators; (b) a quantum rejection sampling approach to restrict the superposition to the simplices in the complex; and (c) a stochastic rank estimation method to estimate the Betti numbers. We present a theoretical error analysis, and the circuit and computational time and depth complexities for Betti number estimation.