arXiv subjects

Mihir Metkar

Publications and source records attributed to Mihir Metkar.

7 recordsLinked to original sources

arXiv2026

MultiStructRNA: a Python package for multi-algorithm RNA secondary structure prediction, ensemble analysis, and visualization

We introduce MultiStructRNA, a unified Python toolkit for RNA secondary structure prediction, ensemble analysis, and visualization. Although RNA secondary structure is central to RNA biology and therapeutic design, practical adoption is often hindered by fragmented tooling, incompatible input and output formats, and limited visualization support. MultiStructRNA addresses these challenges through a single high-level API that orchestrates multiple prediction algorithms, harmonizes results into a consistent schema, and provides reproducible, ensemble-aware metrics through an object model suited to both interactive notebooks and production pipelines. MultiStructRNA enables seamless switching between prediction methods without requiring workflow changes and supports both in-notebook and exportable visualizations. Designed for scalability, it supports high-throughput analyses and simplifies comparison across methods while standardizing downstream feature extraction. The current release also includes optional agent-readable workflow recipes that document dependency setup, backend-adapter conventions, SHAPE-data reconciliation, structure interpretation, and comparative sequence analyses. By integrating diverse RNA secondary structure packages within a common framework, MultiStructRNA streamlines structure analysis and facilitates its use in RNA design, optimization, and machine learning workflows.

q-bio.QM↗

arXiv2026

Pauli Correlation Encoding for mRNA Secondary Structure Prediction: Problem-Aware Decoding for Dense-Constraint QUBOs

Pauli Correlation Encoding (PCE) compresses $m$ binary variables onto $n=O(m^{1/k})$ qubits by mapping them to commuting Pauli correlators, but its continuous expectation values must be decoded into feasible binary solutions, a challenge for dense-constraint problems. We apply PCE to mRNA secondary-structure prediction, formulated as a densely constrained QUBO, and train with a QUBO-space sigmoid loss thatpreserves the QUBO penalty structure. For decoding, we introduce the Problem-Aware Guided Decoder (PAGD), which scores candidate variable commitments by combining marginal QUBO energy reduction with a trained expectation-value prior and constraint-aware feasibility pruning. On six benchmark mRNA sequences (30-60 nt, 50-240 variables, 7-14 qubits), PAGD with 100 restarts achieves 75-100 percent near-optimal recovery, defined as $P(\mathrm{gap}<1\%)$, for sequences up to 152 variables, compared with 0-30 percent for a sign-rounding plus local-search baseline. On the 240-variable instance, trained PAGD reaches 50 percent $P(\mathrm{gap}<1\%)$ at 200 restarts, outperforming untrained-circuit and random-expectation-value controls. Hardware-scale tests extend the pipeline to three 102-105 nt instances (694-745 variables, 172,000-193,000 pair constraints, 23 qubits) on IBM Heron processors. The circuits transpile SWAP-free into 480 native two-qubit gates at depth 256, and PAGD decoded gaps on QPU runs match or beat simulator means for all three instances, including exact CPLEX-optimum recovery for one sequence. These results show that PCE-trained priors can survive deployment to noisy superconducting hardware at biologically relevant scale.

quant-ph↗

arXiv2026

Cellular Automata: From Structural Principles to Transport and Correlation Methods

Cellular automata (CA) are discrete-time dynamical systems with local update rules on a lattice. Despite their elementary definition, CA support a wide spectrum of macroscopic phenomena central to statistical physics: equilibrium and nonequilibrium phase transitions, transport and hydrodynamic limits, kinetic roughening, self-organized criticality, and complex spatiotemporal correlations. This survey focuses on three tightly connected themes. \emph{(i)} We present a structural view of CA as shift-commuting maps on configuration spaces, emphasizing rule complexity, reversibility, and conservation laws (including discrete continuity equations). \emph{(ii)} We organize transport in CA into ballistic, diffusive, and anomalous regimes, and connect microscopic currents to macroscopic laws through Green--Kubo formulas, scaling theory, and universality classes. \emph{(iii)} We develop correlation-based methods -- from structure factors and response formulas to computational mechanics and data-driven inference -- that diagnose regimes and enable coarse-graining.

cond-mat.stat-mech↗

arXiv2025

Co-optimization of codon usage and mRNA secondary structure using quantum computing

Co-optimizing mRNA sequences for both codon optimality and secondary structure is crucial for producing stable and efficacious mRNA therapeutics. Codon optimization, which adjusts nucleotide sequences to enhance translational efficiency, inherently influences mRNA secondary structure - a key determinant of molecular stability both in-vial and in-cell. Because both properties are governed by the same underlying sequence, optimizing one directly impacts the other. To address this interdependence, we introduce a novel variational framework that simultaneously optimizes codon usage and secondary structure. Our method employs a dual-objective function that balances the codon adaptation index (CAI) and minimum free energy (MFE), incorporating variational parameters for codon selection. Leveraging a hybrid quantum-classical computational strategy and building on prior advancements in quantum algorithms for secondary structure prediction, we effectively navigate this complex optimization space. We demonstrate the feasibility of executing this end-to-end workflow on real quantum hardware, using IBM's 127-qubit Eagle processor. We validate our approach through both simulations and quantum hardware experiments on sequences of up to 30 nucleotides. These results highlight the potential of our framework to accelerate the design of optimal mRNA constructs for therapeutic and research applications.

quant-ph↗

arXiv2025

Towards secondary structure prediction of longer mRNA sequences using a quantum-centric optimization scheme

Accurate prediction of mRNA secondary structure is critical for understanding gene expression, translation efficiency, and advancing mRNA-based therapeutics. However, the combinatorial complexity of possible foldings, especially in long sequences, poses significant computational challenges for classical algorithms. In this work, we propose a scalable, quantum-centric optimization framework that integrates quantum sampling with classical post-processing to tackle this problem. Building on a Quadratic Unconstrained Binary Optimization (QUBO) formulation of the mRNA folding task, we develop two complementary workflows: a Conditional Value at Risk (CVaR)-based variational quantum algorithm enhanced with gauge transformations and local search, and an Instantaneous Quantum Polynomial (IQP) circuit-based scheme where training is done classically and sampling is delegated to quantum hardware. We demonstrate the effectiveness of these approaches using IBM quantum processors, solving problem instances with up to 156 qubits and circuits containing up to 950 nonlocal gates, corresponding to mRNA sequences of up to 60 nucleotides. Additionally, we validate scalability of the CVaR algorithm on a tensor network simulator, reaching up to 354 qubits in noiseless settings. These results demonstrate the growing practical capabilities of hybrid quantum-classical methods for tackling large-scale biological optimization problems.

quant-ph↗

arXiv2025

mRNA Folding Algorithms for Structure and Codon Optimization

mRNA technology has revolutionized vaccine development, protein replacement therapies, and cancer immunotherapies, offering rapid production and precise control over sequence and efficacy. However, the inherent instability of mRNA poses significant challenges for drug storage and distribution, particularly in resource-limited regions. Co-optimizing RNA structure and codon choice has emerged as a promising strategy to enhance mRNA stability while preserving efficacy. Given the vast sequence and structure design space, specialized algorithms are essential to achieve these qualities. Recently, several effective algorithms have been developed to tackle this challenge that all use similar underlying principles. We call these specialized algorithms "mRNA folding" algorithms as they generalize classical RNA folding algorithms. A comprehensive analysis of their underlying principles, performance, and limitations is lacking. This review aims to provide an in-depth understanding of these algorithms, identify opportunities for improvement, and benchmark existing software implementations in terms of scalability, correctness, and feature support.

q-bio.BM↗

arXiv2024

mRNA secondary structure prediction using utility-scale quantum computers

Recent advancements in quantum computing have opened new avenues for tackling long-standing complex combinatorial optimization problems that are intractable for classical computers. Predicting secondary structure of mRNA is one such notoriously difficult problem that can benefit from the ever-increasing maturity of quantum computing technology. Accurate prediction of mRNA secondary structure is critical in designing RNA-based therapeutics as it dictates various steps of an mRNA life cycle, including transcription, translation, and decay. The current generation of quantum computers have reached utility-scale, allowing us to explore relatively large problem sizes. In this paper, we examine the feasibility of solving mRNA secondary structures on a quantum computer with sequence length up to 60 nucleotides representing problems in the qubit range of 10 to 80. We use Conditional Value at Risk (CVaR)-based VQE algorithm to solve the optimization problems, originating from the mRNA structure prediction problem, on the IBM Eagle and Heron quantum processors. To our encouragement, even with ``minimal'' error mitigation and fixed-depth circuits, our hardware runs yield accurate predictions of minimum free energy (MFE) structures that match the results of the classical solver CPLEX. Our results provide sufficient evidence for the viability of solving mRNA structure prediction problems on a quantum computer and motivate continued research in this direction.

quant-ph↗