Pratibha | Searcharxiv

arXiv2023

Hybrid Quantum-Classical Machine Learning for Sentiment Analysis

The collaboration between quantum computing and classical machine learning offers potential advantages in natural language processing, particularly in the sentiment analysis of human emotions and opinions expressed in large-scale datasets. In this work, we propose a methodology for sentiment analysis using hybrid quantum-classical machine learning algorithms. We investigate quantum kernel approaches and variational quantum circuit-based classifiers and integrate them with classical dimension reduction techniques such as PCA and Haar wavelet transform. The proposed methodology is evaluated using two distinct datasets, based on English and Bengali languages. Experimental results show that after dimensionality reduction of the data, performance of the quantum-based hybrid algorithms were consistent and better than classical methods.

cs.CL↗

arXiv2019

Folded Graph Signals: Sensing with Unlimited Dynamic Range

Self-reset analog-to-digital converters (ADCs) are used to sample high dynamic range signals resulting in modulo-operation based folded signal samples. We consider the case where each vertex of a graph (e.g., sensors in a network) is equipped with a self-reset ADC and senses a time series. Graph sampling allows the graph time series to be represented by the signals at a subset of sampled vertices and time instances. We investigate the problem of recovering bandlimited continuous-time graph signals from folded signal samples. We derive sufficient conditions to achieve successful recovery of the graph signal from the folded signal samples, which can be achieved via integer programming. To resolve the scalability issue of integer programming, we propose a sparse optimization recovery method for graph signals satisfying certain technical conditions. Such an approach requires a novel graph sampling scheme that selects vertices with small signal variation. The proposed algorithm exploits the inherent relationship among the graph vertices in both the vertex and time domains to recover the graph signal. Simulations and experiments on images validate the feasibility of our proposed approach.

eess.SP↗