Quantum-Enhanced Topological Data Analysis: A Peep from an
Implementation Perspective
- URL: http://arxiv.org/abs/2302.09553v1
- Date: Sun, 19 Feb 2023 12:18:13 GMT
- Title: Quantum-Enhanced Topological Data Analysis: A Peep from an
Implementation Perspective
- Authors: Ankit Khandelwal and M Girish Chandra
- Abstract summary: This 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.
- Score: 22.137388773023854
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: 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.
Related papers
- 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) - A didactic approach to quantum machine learning with a single qubit [68.8204255655161]
We focus on the case of learning with a single qubit, using data re-uploading techniques.
We implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK.
arXiv Detail & Related papers (2022-11-23T18:25:32Z) - 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) - Analyzing Prospects for Quantum Advantage in Topological Data Analysis [35.423446067065576]
We analyze and optimize an improved quantum algorithm for topological data analysis.
We show that super-quadratic quantum speedups are only possible when targeting a multiplicative error approximation.
We argue that quantum circuits with tens of billions of Toffoli can solve seemingly classically intractable instances.
arXiv Detail & Related papers (2022-09-27T17:56:15Z) - A streamlined quantum algorithm for topological data analysis with
exponentially fewer qubits [5.478764356647437]
We present an improved quantum algorithm for computing persistent Betti numbers.
We discuss whether quantum algorithms can achieve an exponential speedup for tasks of practical interest.
arXiv Detail & Related papers (2022-09-26T17:56:11Z) - Topological data analysis on noisy quantum computers [11.975008559320875]
Topological data analysis (TDA) is a powerful technique for extracting complex and valuable shape-related summaries of high-dimensional data.
The computational demands of classical algorithms for computing TDA are exorbitant, and quickly become impractical for high-order characteristics.
We present a fully implemented end-to-end quantum machine learning algorithm that is applicable to high-dimensional classical data.
arXiv Detail & Related papers (2022-09-19T22:45:00Z) - From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions.
For its practicability and wide-applicability, we give a brief review of typical graph learning techniques.
We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
arXiv Detail & Related papers (2022-02-19T02:56:47Z) - Benchmarking Small-Scale Quantum Devices on Computing Graph Edit
Distance [52.77024349608834]
Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical.
In this paper we present a comparative study of two quantum approaches to computing GED.
arXiv Detail & Related papers (2021-11-19T12:35:26Z) - Quantum Algorithms for Data Representation and Analysis [68.754953879193]
We provide quantum procedures that speed-up the solution of eigenproblems for data representation in machine learning.
The power and practical use of these subroutines is shown through new quantum algorithms, sublinear in the input matrix's size, for principal component analysis, correspondence analysis, and latent semantic analysis.
Results show that the run-time parameters that do not depend on the input's size are reasonable and that the error on the computed model is small, allowing for competitive classification performances.
arXiv Detail & Related papers (2021-04-19T00:41:43Z)
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.