Metraipolis › archive › dc_2ea9b1ddad2c

A Gate-Based Quantum Computing Framework for Codon Optimization — arXiv:2610.00887

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.00887
License (as archived)
CC0-1.0
Archived
2026-10-07T11:37:32.283Z
SHA-256 of the archived text
21c3784b0c88fa1327a82479bffd7d0edcb5b93b14fcccf2555ff9bb6d3fbf1e
Stable URL of this page
https://metraipolis.com/documento/dc_2ea9b1ddad2c

How to cite

A Gate-Based Quantum Computing Framework for Codon Optimization — arXiv:2610.00887 — arXiv (en), https://arxiv.org/abs/2610.00887 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2ea9b1ddad2c (Metraipolis archive dc_2ea9b1ddad2c, sha256 21c3784b0c88fa1327a82479bffd7d0edcb5b93b14fcccf2555ff9bb6d3fbf1e)
BibTeX
@misc{dc2ea9b1ddad2c,
  title = {A Gate-Based Quantum Computing Framework for Codon Optimization — arXiv:2610.00887},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.00887},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2ea9b1ddad2c; sha256 21c3784b0c88fa1327a82479bffd7d0edcb5b93b14fcccf2555ff9bb6d3fbf1e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.00887. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Codon optimization is a challenging combinatorial optimization problem with important applications in synthetic biology, protein expression, and biotechnology. While quantum annealing has previously been explored for this problem, the application of gate-based quantum algorithms remains largely unexplored. In this work, we present a gate-based quantum computing framework for codon optimization by formulating the optimization objective as an Ising Hamiltonian and expressing it in terms of Pauli operators suitable for gate-based quantum processors. The proposed framework is investigated using the Variational Quantum Eigensolver (VQE), Sampling Variational Quantum Eigensolver (SVQE), and the Quantum Approximate Optimization Algorithm (QAOA), with benchmarking against exact diagonalization, classical optimization, and quantum annealing. Using a three-amino-acid benchmark, the proposed implementations successfully reproduce the exact ground-state solutions while identifying optimized ansatz selections, optimization strategies, initialization schemes, and hardware execution settings that provide reproducible performance on current noisy quantum hardware. Hardware demonstrations are performed on IBM Quantum processors to evaluate the practical implementation of the proposed workflow. As a work in progress, this study establishes a reproducible computational framework for gate-based quantum codon optimization and provides the foundation for future investigations of larger protein sequences as quantum hardware and algorithms continue to advance.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-10-02 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2610.00887 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T11:19:01.663Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).