Skip to content
DraconiticResearch
Search Sources API
203,948 studies31 sourcesUpdated 20 min ago
PreprintarXiv licencearXiv

A Gate-Based Quantum Computing Framework for Codon Optimization

Abstract

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.

Related

  1. On Revolutionizing Power Systems: Suitability of Quantum Computing-Ready Pipelines for Stochastic Unit Commitment Optimization
    Ying-Yi Hong, Dylan Josh Domingo Lopez
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  2. Beyond QAOA: A Review of AI and Quantum Computing for Adaptive Combinatorial Optimization
    Hoong Chuin Lau
    arXivPreprintCC BY 4.0Full textOptimisation & controlQuantum physics & quantum informationarXiv
  3. SynDebug: A Framework to Debug Logic Bugs in Fault-Tolerant Quantum Computing Programs
    Nicholas S. DiBrita, Jack Lange, Tirthak Patel
    arXivPreprintCC BY-NC-ND 4.0Full textQuantum physics & quantum informationarXiv
  4. NAQsim: Full-Stack Architecture Simulation Framework for Fast and Space-Efficient Neutral Atom Quantum Computing
    Yosuke Ueno, Shinichi Sunami, Toshihide Hinokuma +5
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  5. Low-cost algorithm-to-execution framework for surface-code quantum computing
    Yunxin Tang, Zixuan Huo, Junxiang Huang +14
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
BibTeX
@misc{ghasemi2026gatebased,
  title = {{A Gate-Based Quantum Computing Framework for Codon Optimization}},
  author = {Fatemeh Ghasemi and Kion Kim},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.00887},
  eprint = {2610.00887},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.00887},
}
RIS
TY  - UNPB
TI  - A Gate-Based Quantum Computing Framework for Codon Optimization
AU  - Fatemeh Ghasemi
AU  - Kion Kim
PY  - 2026
DA  - 2026/10/01
PB  - arXiv
DO  - 10.48550/arxiv.2610.00887
UR  - https://arxiv.org/abs/2610.00887
AB  - 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.
ER  -