Higher-order topological kernels via quantum computation
- URL: http://arxiv.org/abs/2307.07383v1
- Date: Fri, 14 Jul 2023 14:48:52 GMT
- Title: Higher-order topological kernels via quantum computation
- Authors: Massimiliano Incudini, Francesco Martini, Alessandra Di Pierro
- Abstract summary: 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.
- Score: 68.8204255655161
- License: http://creativecommons.org/licenses/by/4.0/
- 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.
Related papers
- 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) - Neural auto-designer for enhanced quantum kernels [59.616404192966016]
We present a data-driven approach that automates the design of problem-specific quantum feature maps.
Our work highlights the substantial role of deep learning in advancing quantum machine learning.
arXiv Detail & Related papers (2024-01-20T03:11:59Z) - Quantum topological data analysis via the estimation of the density of
states [17.857341127079305]
We develop a quantum topological data analysis protocol based on the estimation of the density of states (DOS) of the Laplacian.
We test our protocol on noiseless and noisy quantum simulators and run examples on IBM quantum processors.
arXiv Detail & Related papers (2023-12-12T09:43:04Z) - Quantum-Enhanced Topological Data Analysis: A Peep from an
Implementation Perspective [22.137388773023854]
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.
arXiv Detail & Related papers (2023-02-19T12:18:13Z) - 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) - Understanding the Mapping of Encode Data Through An Implementation of
Quantum Topological Analysis [0.7106986689736827]
We show the difference in encoding techniques can be visualized by investigating the topology of the data embedded in complex Hilbert space.
Our results suggest the encoding method needs to be considered carefully within different quantum machine learning models.
arXiv Detail & Related papers (2022-09-21T18:46:08Z) - Noisy Quantum Kernel Machines [58.09028887465797]
An emerging class of quantum learning machines is that based on the paradigm of quantum kernels.
We study how dissipation and decoherence affect their performance.
We show that decoherence and dissipation can be seen as an implicit regularization for the quantum kernel machines.
arXiv Detail & Related papers (2022-04-26T09:52:02Z) - Inducing Gaussian Process Networks [80.40892394020797]
We propose inducing Gaussian process networks (IGN), a simple framework for simultaneously learning the feature space as well as the inducing points.
The inducing points, in particular, are learned directly in the feature space, enabling a seamless representation of complex structured domains.
We report on experimental results for real-world data sets showing that IGNs provide significant advances over state-of-the-art methods.
arXiv Detail & Related papers (2022-04-21T05:27:09Z) - Efficient construction of tensor-network representations of many-body
Gaussian states [59.94347858883343]
We present a procedure to construct tensor-network representations of many-body Gaussian states efficiently and with a controllable error.
These states include the ground and thermal states of bosonic and fermionic quadratic Hamiltonians, which are essential in the study of quantum many-body systems.
arXiv Detail & Related papers (2020-08-12T11:30:23Z)
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.