Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2404.14858 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917662420893696 |
|---|---|
| author | Zhang, Hongfeng Sarkar, Aritra Bertels, Koen |
| author_facet | Zhang, Hongfeng Sarkar, Aritra Bertels, Koen |
| contents | Optimizing the mRNA codon has an essential impact on gene expression for a specific target protein. It is an NP-hard problem; thus, exact solutions to such optimization problems become computationally intractable for realistic problem sizes on both classical and quantum computers. However, approximate solutions via heuristics can substantially impact the application they enable. Quantum approximate optimization is an alternative computation paradigm promising for tackling such problems. Recently, there has been some research in quantum algorithms for bioinformatics, specifically for mRNA codon optimization. This research presents a denser way to encode codons for implementing mRNA codon optimization via the variational quantum eigensolver algorithms on a gate-based quantum computer. This reduces the qubit requirement by half compared to the existing quantum approach, thus allowing longer sequences to be executed on existing quantum processors. The performance of the proposed algorithm is evaluated by comparing its results to exact solutions, showing well-matching results. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_14858 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A resource-efficient variational quantum algorithm for mRNA codon optimization Zhang, Hongfeng Sarkar, Aritra Bertels, Koen Quantum Physics Computational Engineering, Finance, and Science Optimizing the mRNA codon has an essential impact on gene expression for a specific target protein. It is an NP-hard problem; thus, exact solutions to such optimization problems become computationally intractable for realistic problem sizes on both classical and quantum computers. However, approximate solutions via heuristics can substantially impact the application they enable. Quantum approximate optimization is an alternative computation paradigm promising for tackling such problems. Recently, there has been some research in quantum algorithms for bioinformatics, specifically for mRNA codon optimization. This research presents a denser way to encode codons for implementing mRNA codon optimization via the variational quantum eigensolver algorithms on a gate-based quantum computer. This reduces the qubit requirement by half compared to the existing quantum approach, thus allowing longer sequences to be executed on existing quantum processors. The performance of the proposed algorithm is evaluated by comparing its results to exact solutions, showing well-matching results. |
| title | A resource-efficient variational quantum algorithm for mRNA codon optimization |
| topic | Quantum Physics Computational Engineering, Finance, and Science |
| url | https://arxiv.org/abs/2404.14858 |