SearcharxivSearch

arXiv subjects

Laxmi Parida

Publications and source records attributed to Laxmi Parida.

At least 19 recordsLinked to original sources

Quantum Kernel Estimation for the Discovery of Early Lung Cancer Detection

Lung cancer screening with low-dose chest computed tomography reduces mortality, but its impact is limited by uptake, adherence, and management challenges. Blood-based cell-free DNA (cfDNA) biomarkers offer a complementary approach, although early detection remains difficult because of lung cancer heterogeneity and high-dimensional, nonlinear molecular signals. We evaluated quantum-classical hybrid machine learning for lung cancer detection using DNA fragmentomics and DNA methylation. After feature selection, models were trained using 20- and 40-feature subsets. Features were encoded into quantum Hilbert space using angle and dense-angle feature maps with multiple entanglement strategies. Fidelity-based quantum kernels were computed with exact statevector simulation and integrated with precomputed-kernel SVM and kernel-PCA logistic regression and compared with an SVM model trained on the original features. This framework enabled systematic evaluation of how encoding and entanglement design affect classification. Across repeated held-out evaluations, quantum-kernel models achieved competitive performance on both datasets. For fragmentomics, several 20-feature configurations improved AUC relative to a classical SVM baseline, suggesting effective capture of nonlinear cfDNA fragmentation structure. For methylation, the classical SVM achieved the highest AUC, although selected quantum models remained competitive and improved specificity in some cases. Increasing features from 20 to 40 did not consistently improve performance and often increased variability. Overall, these results support quantum kernel methods as a promising approach for cfDNA-based lung cancer detection.

cs.LG

A Quantum Reservoir for Neurodynamical Forecasting

Forecasting neural activity from short recordings remains a fundamental challenge. Reservoir computing may offer an efficient paradigm for temporal prediction, however classical reservoirs typically underperform in small-data regimes. Here we investigate whether quantum reservoir computing (QRC) can help overcome this limitation. Building on recent advances, we introduce a quantum reservoir based on a transverse-field Ising model, combined with heterogeneous quantum measurements and polynomial ridge regression. On a standard benchmark task, results show that the quantum reservoir outperforms a classical counterpart overall, with prediction accuracy strongly dependent on reservoir parameters. We further demonstrate feasibility by running the same task on quantum hardware. To assess performance on biological signals, we evaluate QRC on simulated human electroencephalography (EEG) data with a parallel reservoir architecture. On this challenging task, the tested quantum reservoir did not match the performance of the classical one, but it produced stable, convergent predictions. This is a meaningful first step toward forecasting of biologically realistic neural data using a quantum reservoir. Overall, our findings indicate that although current quantum hardware and parallel reservoir architectures do not yet surpass classical methods on complex neural signals, QRC can be executed on near-term devices and does converge with realistic EEG-like data. This work establishes a practical baseline for future algorithmic and hardware developments aimed at clinical time-series forecasting with quantum systems.

quant-ph

Essential Simplices Dominate in Harmonic Representatives of One-Dimensional Persistent Classes

Persistent homology summarizes the birth and death of topological features, but it does not by itself specify where a feature is located in the underlying complex. Harmonic persistent homology addresses this by assigning canonical harmonic cycle representatives to bars. In earlier work, Basu and Cox showed that harmonic representatives of simple bars maximize the total relative weight placed on essential simplices, the simplices that are forced to appear in representatives of the corresponding class. In this paper we prove that, for generic one-dimensional bars, this preference is stronger than an aggregate maximization statement. Every essential edge has strictly larger coefficient, in absolute value, than every non-essential edge in the harmonic representative, and the absolute values of the coefficients of all essential edges are equal. The key argument is a finite-dimensional variational characterization of the harmonic representative as a minimum-norm chain with prescribed boundary, combined with an elementary graph-theoretic cut argument. We then prove that the result is special to dimension one. In higher dimensions, the analogous coefficient-wise dominance statement fails. We give examples to show that harmonic representatives can place larger coefficients on non-essential higher-dimensional simplices than on essential ones. These results clarify both the power and the limitations of using harmonic representatives to assign geometric significance to simplices in persistent homology.

math.AT

Experimental implementation of a discrete-time quantum walk on biological networks

Quantum walks provide a versatile framework for probing the structural and dynamical properties of complex systems ranging from biological networks to synthetic materials. However, their realization on current noisy pre-fault-tolerant quantum computers is fundamentally limited by decoherence. Conventional dense encodings of graph structures require prohibitively deep circuits, making them incompatible with existing hardware. Here we introduce an algorithm that leverages symmetry-sector encoding and trades circuit depth for the number of qubits, while integrating symmetry-respecting postselection as an effective noise-mitigation strategy. This combination enables us to execute practical quantum-walk circuits for biological network motifs on actual quantum hardware. We benchmark the proposed methodology against known state-of-the-art circuit architectures, highlighting significant reduction of circuit depth in our approach at the cost of moderate qubit overhead. Utilizing 40 qubits, we implement quantum walks on complex graphs containing up to 17 nodes and 20 edges -- the largest experiment on superconducting hardware to date, with the Hellinger fidelity exceeding 87% throughout 7 steps. We present a proof-of-principle case study that illustrates how experimentally obtained quantum-walk dynamics on a protein-protein-interaction network can be applied to prioritizing disease-associated genes. We discuss the framework scalability in the pre-fault-tolerant era and its potential for studying larger biological networks.

quant-ph

Data complexity signature predicts quantum projected learning benefit for antibiotic resistance

This study presents the first large-scale empirical evaluation of quantum machine learning for predicting antibiotic resistance in clinical urine cultures. Antibiotic resistance is amongst the top threats to humanity, and inappropriate antibiotic use is a main driver of resistance. We developed a Quantum Projective Learning (QPL) approach and executed 60 qubit experiments on IBM Eagle and Heron quantum processing units. While QPL did not consistently outperform classical baselines, potentially reflecting current quantum hardware limitations, it did achieve parity or superiority in specific scenarios, notably for the antibiotic nitrofurantoin and selected data splits, revealing that quantum advantage may be data-dependent. Analysis of data complexity measures uncovered a multivariate signature, which comprised Shannon entropy, Fisher Discriminant Ratio, standard deviation of kurtosis, number of low-variance features, and total correlations. The multivariate model accurately (AUC = 0.88, $p$-value = 0.03) distinguished cases wherein QPL executed on quantum hardware would outperform classical models. This signature suggests that quantum kernels excel in feature spaces with high entropy and structural complexity. These findings point to complexity-driven adaptive model selection as a promising strategy for optimizing hybrid quantum-classical workflows in healthcare. Overall, this investigation marks the first application of quantum machine learning in urology, and in antibiotic resistance prediction. Further, this work highlights conditional quantum utility and introduces a principled approach for leveraging data complexity signatures to guide quantum machine learning deployment in biomedical applications.

q-bio.OT

Enhanced Prediction of CAR T-Cell Cytotoxicity with Quantum-Kernel Methods

Chimeric antigen receptor (CAR) T-cells are T-cells engineered to recognize and kill specific tumor cells. Through their extracellular domains, CAR T-cells bind tumor cell antigens which triggers CAR T activation and proliferation. These processes are regulated by co-stimulatory domains present in the intracellular region of the CAR T-cell. Through integrating novel signaling components into the co-stimulatory domains, it is possible to modify CAR T-cell phenotype. Identifying and experimentally testing new CAR constructs based on libraries of co-stimulatory domains is nontrivial given the vast combinatorial space defined by such libraries. This leads to a highly data constrained, poorly explored combinatorial problem, where the experiments undersample all possible combinations. We propose a quantum approach using a Projected Quantum Kernel (PQK) to address this challenge. PQK operates by embedding classical data into a high dimensional Hilbert space and employs a kernel method to measure sample similarity. Using 61 qubits on a gate-based quantum computer, we demonstrate the largest PQK application to date and an enhancement in the classification performance over purely classical machine learning methods for CAR T cytotoxicity prediction. Importantly, we show improved learning for specific signaling domains and domain positions, particularly where there was lower information highlighting the potential for quantum computing in data-constrained problems.

cs.LG

On Quantum Random Walks in Biomolecular Networks

Biomolecular networks, such as protein-protein interactions, gene-gene associations, and cell-cell interactions, offer valuable insights into the complex organization of biological systems. These networks are key to understanding cellular functions, disease mechanisms, and identifying therapeutic targets. However, their analysis is challenged by the high dimensionality, heterogeneity, and sparsity of multi-omics data. Random walk algorithms are widely used to propagate information through disease modules, helping to identify disease-associated genes and uncover relevant biological pathways. In this work, we investigate the limitations of classical random walks and explore the potential of quantum random walks (QRWs) for biomolecular network analysis. We evaluate QRWs in two network-based applications. First, in a gene-gene interaction network associated with asthma, autism, and schizophrenia, QRWs more accurately rank disease-associated genes compared to classical methods. Second, in a structured multi-partite cell-cell interaction network derived from mouse brown adipose tissue, QRWs identify key driver genes in malignant cells that are overlooked by classical random walks. Our findings suggest that quantum random walks offer a promising alternative to classical approaches, with improved sensitivity to network structure and better performance in identifying biologically relevant features. This highlights their potential in advancing network medicine and systems biology.

quant-ph

Quantum Ensembling Methods for Healthcare and Life Science

Learning on small data is a challenge frequently encountered in many real-world applications. In this work we study how effective quantum ensemble models are when trained on small data problems in healthcare and life sciences. We constructed multiple types of quantum ensembles for binary classification using up to 26 qubits in simulation and 56 qubits on quantum hardware. Our ensemble designs use minimal trainable parameters but require long-range connections between qubits. We tested these quantum ensembles on synthetic datasets and gene expression data from renal cell carcinoma patients with the task of predicting patient response to immunotherapy. From the performance observed in simulation and initial hardware experiments, we demonstrate how quantum embedding structure affects performance and discuss how to extract informative features and build models that can learn and generalize effectively. We present these exploratory results in order to assist other researchers in the design of effective learning on small data using ensembles. Incorporating quantum computing in these data constrained problems offers hope for a wide range of studies in healthcare and life sciences where biological samples are relatively scarce given the feature space to be explored.

cs.LG

Quantum machine learning framework for longitudinal biomedical studies

Longitudinal biomedical studies play a vital role in tracking disease progression, treatment response, and the emergence of resistance mechanisms, particularly in complex disorders such as cancer and neurodegenerative diseases. However, the high dimensionality of biological data, combined with the limited size of longitudinal cohorts, presents significant challenges for traditional machine learning approaches. In this work, we explore the potential of quantum machine learning (QML) for longitudinal biomarker discovery. We propose a novel modification to the instantaneous quantum polynomial time (IQP) feature map, designed to encode temporal dependencies across multiple time points in biomedical datasets. Through numerical simulations on both synthetic and real-world datasets - including studies on follicular lymphoma and Alzheimer's disease - we demonstrate that our longitudinal IQP feature map improves the ability of quantum kernels to capture intra-subject temporal patterns, offering a promising direction for QML in clinical research.

q-bio.QM

Towards Quantum Tensor Decomposition in Biomedical Applications

Tensor decomposition has emerged as a powerful framework for feature extraction in multi-modal biomedical data. In this review, we present a comprehensive analysis of tensor decomposition methods such as Tucker, CANDECOMP/PARAFAC, spiked tensor decomposition, etc. and their diverse applications across biomedical domains such as imaging, multi-omics, and spatial transcriptomics. To systematically investigate the literature, we applied a topic modeling-based approach that identifies and groups distinct thematic sub-areas in biomedicine where tensor decomposition has been used, thereby revealing key trends and research directions. We evaluated challenges related to the scalability of latent spaces along with obtaining the optimal rank of the tensor, which often hinder the extraction of meaningful features from increasingly large and complex datasets. Additionally, we discuss recent advances in quantum algorithms for tensor decomposition, exploring how quantum computing can be leveraged to address these challenges. Our study includes a preliminary resource estimation analysis for quantum computing platforms and examines the feasibility of implementing quantum-enhanced tensor decomposition methods on near-term quantum devices. Collectively, this review not only synthesizes current applications and challenges of tensor decomposition in biomedical analyses but also outlines promising quantum computing strategies to enhance its impact on deriving actionable insights from complex biomedical data.

q-bio.QM

Bounds on the realizations of zero-nonzero patterns and sign conditions of polynomials restricted to varieties and applications

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$ of affine or projective space. The bounds depend only on $\mathrm{card}(\mathcal P)$ and the degrees of the polynomials in $\mathcal P$, together with $\mathrm{deg}(V)$ and $\dim(V)$, and not on the dimension of the space in which $V$ is embedded. This feature is particularly useful when $V$ has small intrinsic dimension but is presented in a very high-dimensional ambient space. We describe several applications. First, we extend existing results on bounding the $\varepsilon$-entropy of real algebraic varieties. Second, we derive lower bounds (in terms of the number of connected components) for membership testing in semi-algebraic sets in the algebraic computation tree model. Finally, motivated by quantum complexity theory, we introduce additive and multiplicative notions of \emph{relative rank} in finite-dimensional vector spaces and algebras with respect to a fixed algebraic subset, generalizing the classical notion of tensor rank. We prove a general lower bound on the maximum relative rank of finite subsets with respect to algebraic sets of bounded degree and dimension that is again independent of the ambient dimension. As an illustration, we obtain a quantum analogue of Shannon's classical lower bound: almost all Boolean functions require classical circuits of size $\Omega(2^n/n)$, even in the presence of a quantum oracle specified by an algebraic subset of fixed degree and dimension.

math.CO

How quantum computing can enhance biomarker discovery

Biomarkers play a central role in medicine's gradual progress towards proactive, personalized precision diagnostics and interventions. However, finding biomarkers that provide very early indicators of a change in health status, for example for multi-factorial diseases, has been challenging. Discovery of such biomarkers stands to benefit significantly from advanced information processing and means to detect complex correlations, which quantum computing offers. In this perspective paper, quantum algorithms, particularly in machine learning, are mapped to key applications in biomarker discovery. The opportunities and challenges associated with the algorithms and applications are discussed. The analysis is structured according to different data types - multi-dimensional, time series, and erroneous data - and covers key data modalities in healthcare - electronic health records (EHRs), omics, and medical images. An outlook is provided concerning open research challenges.

q-bio.OT

Towards quantum computing for clinical trial design and optimization: A perspective on new opportunities and challenges

Clinical trials are pivotal in the drug discovery process to determine the safety and efficacy of a drug candidate. The high failure rates of these trials are attributed to deficiencies in clinical model development and protocol design. Improvements in the clinical drug design process could therefore yield significant benefits for all stakeholders involved. This paper examines the current challenges faced in clinical trial design and optimization, reviews established classical computational approaches, and introduces quantum algorithms aimed at enhancing these processes. Specifically, the focus is on three critical aspects: clinical trial simulations, site selection, and cohort identification. This study aims to provide a comprehensive framework that leverages quantum computing to innovate and refine the efficiency and effectiveness of clinical trials.

quant-ph

Probing omics data via harmonic persistent homology

Identifying molecular signatures from complex disease patients with underlying symptomatic similarities is a significant challenge in the analysis of high dimensional multi-omics data. Topological data analysis (TDA) provides a way of extracting such information from the geometric structure of the data and identifying multiway higher-order relationships. Here, we propose an application of Harmonic persistent homology, which overcomes the limitations of ambiguous assignment of the topological information to the original elements in a representative topological cycle from the data. When applied to multi-omics data, this leads to the discovery of hidden patterns highlighting the relationships between different omic profiles, while allowing for common tasks in multi-omics analyses, such as disease subtyping, and most importantly biomarker identification for similar latent biological pathways that are associated with complex diseases. Our experiments on multiple cancer data show that harmonic persistent homology effectively dissects multi-omics data to identify biomarkers by detecting representative cycles predictive of disease subtypes.

q-bio.GN

Quantum Analog of Shannon's Lower Bound Theorem

Shannon proved that almost all Boolean functions require a circuit of size $\Theta(2^n/n)$. We prove a quantum analog of this classical result. Unlike in the classical case the number of quantum circuits of any fixed size that we allow is uncountably infinite. Our main tool is a classical result in real algebraic geometry bounding the number of realizable sign conditions of any finite set of real polynomials in many variables.

quant-ph

Towards quantum-enabled cell-centric therapeutics

In recent years, there has been tremendous progress in the development of quantum computing hardware, algorithms and services leading to the expectation that in the near future quantum computers will be capable of performing simulations for natural science applications, operations research, and machine learning at scales mostly inaccessible to classical computers. Whereas the impact of quantum computing has already started to be recognized in fields such as cryptanalysis, natural science simulations, and optimization among others, very little is known about the full potential of quantum computing simulations and machine learning in the realm of healthcare and life science (HCLS). Herein, we discuss the transformational changes we expect from the use of quantum computation for HCLS research, more specifically in the field of cell-centric therapeutics. Moreover, we identify and elaborate open problems in cell engineering, tissue modeling, perturbation modeling, and bio-topology while discussing candidate quantum algorithms for research on these topics and their potential advantages over classical computational approaches.

quant-ph

Sequents, barcodes, and homology

We consider the problem of generating hypothesis from data based on ideas from logic. We introduce a notion of barcodes, which we call sequent barcodes, that mirrors the barcodes in persistent homology theory in topological data analysis. We prove a theoretical result on the stability of these barcodes in analogy with similar results in persistent homology theory. Additionally we show that our new notion of barcodes can be interpreted in terms of a persistent homology of a particular filtration of topological spaces induced by the data. Finally, we discuss a concrete application of the sequent barcodes in a discovery problem arising from the area of cancer genomics.

math.AT

Inferring COVID-19 Biological Pathways from Clinical Phenotypes via Topological Analysis

COVID-19 has caused thousands of deaths around the world and also resulted in a large international economic disruption. Identifying the pathways associated with this illness can help medical researchers to better understand the properties of the condition. This process can be carried out by analyzing the medical records. It is crucial to develop tools and models that can aid researchers with this process in a timely manner. However, medical records are often unstructured clinical notes, and this poses significant challenges to developing the automated systems. In this article, we propose a pipeline to aid practitioners in analyzing clinical notes and revealing the pathways associated with this disease. Our pipeline relies on topological properties and consists of three steps: 1) pre-processing the clinical notes to extract the salient concepts, 2) constructing a feature space of the patients to characterize the extracted concepts, and finally, 3) leveraging the topological properties to distill the available knowledge and visualize the result. Our experiments on a publicly available dataset of COVID-19 clinical notes testify that our pipeline can indeed extract meaningful pathways.

cs.CL