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

• URL: http://arxiv.org/abs/2505.05782v1
• Date: Fri, 09 May 2025 04:53:40 GMT
• Title: Towards secondary structure prediction of longer mRNA sequences using a quantum-centric optimization scheme
• Authors: Vaibhaw Kumar, Dimitris Alevras, Mihir Metkar, Eline Welling, Chris Cade, Ido Niesen, Triet Friedhoff, Jae-Eun Park, Saurabh Shivpuje, Mariana LaDue, Wade Davis, Alexey Galda,
• Abstract summary: We propose a scalable, quantum-centric optimization framework that integrates quantum sampling with classical post-processing to tackle this problem.<n>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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Co-optimization of codon usage and mRNA secondary structure using quantum computing [0.0]
  We introduce a novel variational framework that simultaneously optimize codon usage and secondary structure.<n>Our method employs a dual-objective function that balances the codon adaptation index (CAI) and minimum free energy (MFE)<n>We demonstrate the feasibility of executing this end-to-end workflow on real quantum hardware, using IBM's 127-qubit Eagle processor.
  arXiv  Detail & Related papers  (2025-07-24T21:32:44Z)
• Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
  Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
  arXiv  Detail & Related papers  (2025-05-24T02:51:34Z)
• Evaluating Mutation Techniques in Genetic Algorithm-Based Quantum Circuit Synthesis [6.122499977051124]
  Genetic algorithms (GAs) provide a promising approach for efficient quantum circuit synthesis.<n>This work examines the impact of various mutation strategies within a GA framework for quantum circuit synthesis.
  arXiv  Detail & Related papers  (2025-04-08T20:14:35Z)
• 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)
• mRNA secondary structure prediction using utility-scale quantum computers [0.0]
  We study the feasibility of solving mRNA secondary structures on a quantum computer with sequence length up to 60 nucleotides. Our results provide sufficient evidence for the viability of solving mRNA structure prediction problems on a quantum computer.
  arXiv  Detail & Related papers  (2024-05-30T17:58:17Z)
• A resource-efficient variational quantum algorithm for mRNA codon optimization [0.5120567378386615]
  optimizing the mRNA codon has an essential impact on gene expression for a specific target protein. This research presents a way to encode codons for implementing mRNA codon optimization via the variational quantum eigensolver algorithms on a gate-based quantum computer.
  arXiv  Detail & Related papers  (2024-04-23T09:23:22Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Predicting RNA Secondary Structure on Universal Quantum Computer [2.277461161767121]
  It is the first step for understanding how RNA structure folds from base sequences that to know how its secondary structure is formed. Traditional energy-based algorithms are short of precision, particularly for non-nested sequences. Gate model algorithms for universal quantum computing are not available.
  arXiv  Detail & Related papers  (2023-05-16T15:57:38Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)

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.