Accelerating De Novo Genome Assembly via Quantum-Assisted Graph Optimization with Bitstring Recovery
Jaya Vasavi Pamidimukkala, Himanshu Sahu, Ashwini Kannan, Janani Ananthanarayanan, Kalyan Dasgupta, Sanjib Senapati

TL;DR
This paper introduces a hybrid quantum-classical method for de novo genome assembly, leveraging quantum optimization algorithms to potentially improve speed and accuracy in constructing genomes from scratch.
Contribution
It presents a novel quantum-assisted approach using HOBO and VQE to solve assembly graph problems, with a new bitstring recovery mechanism for enhanced solution traversal.
Findings
Quantum approach shows promise in reducing assembly time.
Potential for improved accuracy with advancing quantum hardware.
Demonstrates feasibility of quantum algorithms in complex genomic tasks.
Abstract
Genome sequencing is essential to decode genetic information, identify organisms, understand diseases and advance personalized medicine. A critical step in any genome sequencing technique is genome assembly. However, de novo genome assembly, which involves constructing an entire genome sequence from scratch without a reference genome, presents significant challenges due to its high computational complexity, affecting both time and accuracy. In this study, we propose a hybrid approach utilizing a quantum computing-based optimization algorithm integrated with classical pre-processing to expedite the genome assembly process. Specifically, we present a method to solve the Hamiltonian and Eulerian paths within the genome assembly graph using gate-based quantum computing through a Higher-Order Binary Optimization (HOBO) formulation with the Variational Quantum Eigensolver algorithm (VQE), in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Genomics and Phylogenetic Studies · Genome Rearrangement Algorithms
