Skip to content
DraconiticResearch
Search Sources API
186,631 studies31 sourcesUpdated 31 min ago
PreprintCC BY 4.0arXiv

Feasibility and optimum recovery in warm-start quantum optimization for a drug-response model on a trapped-ion processor

Abstract

On a seven-compound drug-response model, warm-start quantum approximate optimization (QAOA) on IonQ Forte-1 returned valid assignments more often than random bitstrings, but this alone did not show effective optimization. Ideal QAOA raised optimum probability above uniform feasible sampling in only four of twelve reference circuits. Hardware often fell below its own noiseless circuits, while greedy search solved all hardware models within 200 objective evaluations. Expanded simulations showed a gain over feasible sampling in 28 of 35 CAMA-1 panels and none of four 647-V panels. Annealing solved all these panels in every seed. A Grover mixer preserved feasibility and improved optimum probability over feasible sampling in all ten tested models. We analyzed 25 completed tasks containing 5,300 shots from 18 circuits and 14 instances. The encodings use 6-35 qubits and at most 4,900 feasible assignments, which we enumerated to establish exact optima. Noiseless references now cover both the original six circuits and six wider circuits. At 35 qubits, with 4,900 feasible assignments, ideal feasibility was 35.85%, compared with 7 of 200 valid hardware outputs. Its ideal optimum probability was below both sampling controls. The circuits sample assignments in a model built from measured single-agent and pairwise responses.

Related

  1. Local optical feasibility maps for compound lens optimization under direct modulation transfer function constraints
    Chizhi Zhang, Yi Cui, Jian Jiang +2
    Optics ExpressPeer-reviewedLicence not statedOptics & photonicsCrossref
  2. Recovery of event boundaries and Brillouin frequency shift in STFT-BOTDR using variable projection with spatial response constraint
    Haoran Gao, Junxian Liu, Qirong Xu +6
    Optics ExpressPeer-reviewedPublisher termsOptics & photonicsCrossref
  3. Autonomous Thermal Switching Outperforms the Frozen Optimum with Vanishing Correlations
    Siyi Deng, Longxing Xu, Zhuolin Ye +2
    arXivPreprintarXiv licenceFull textStatistical & nonlinear physicsarXiv
  4. Piston-Like Information Engine II: Boundary-Controlled Optimum in Active Matter
    Laura Hoek, Neta Ben Ari, Rémi Goerlich +2
    arXivPreprintCC BY 4.0Full textCondensed matterStatistical & nonlinear physicsarXiv
  5. Optimum foraging area in a three-trophic food chain
    Lucas Massoni, Rafael Menezes, Marcus A. M. de Aguiar +1
    arXivPreprintarXiv licenceFull textEvolutionary biologyBiological & medical physicsarXiv
BibTeX
@misc{hossain2026feasibility,
  title = {{Feasibility and optimum recovery in warm-start quantum optimization for a drug-response model on a trapped-ion processor}},
  author = {Tanzir Hossain and Rajib Rana and Prabal Datta Barua and Abu Ali Ibn Sina and Niall Higgins and Pascal Elahi and Robert Sang and Bjorn W. Schuller},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.22748},
  eprint = {2609.22748},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.22748},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Feasibility and optimum recovery in warm-start quantum optimization for a drug-response model on a trapped-ion processor
AU  - Tanzir Hossain
AU  - Rajib Rana
AU  - Prabal Datta Barua
AU  - Abu Ali Ibn Sina
AU  - Niall Higgins
AU  - Pascal Elahi
AU  - Robert Sang
AU  - Bjorn W. Schuller
PY  - 2026
DA  - 2026/09/19
PB  - arXiv
DO  - 10.48550/arxiv.2609.22748
UR  - https://arxiv.org/abs/2609.22748
AB  - On a seven-compound drug-response model, warm-start quantum approximate optimization (QAOA) on IonQ Forte-1 returned valid assignments more often than random bitstrings, but this alone did not show effective optimization. Ideal QAOA raised optimum probability above uniform feasible sampling in only four of twelve reference circuits. Hardware often fell below its own noiseless circuits, while greedy search solved all hardware models within 200 objective evaluations. Expanded simulations showed a gain over feasible sampling in 28 of 35 CAMA-1 panels and none of four 647-V panels. Annealing solved all these panels in every seed. A Grover mixer preserved feasibility and improved optimum probability over feasible sampling in all ten tested models. We analyzed 25 completed tasks containing 5,300 shots from 18 circuits and 14 instances. The encodings use 6-35 qubits and at most 4,900 feasible assignments, which we enumerated to establish exact optima. Noiseless references now cover both the original six circuits and six wider circuits. At 35 qubits, with 4,900 feasible assignments, ideal feasibility was 35.85%, compared with 7 of 200 valid hardware outputs. Its ideal optimum probability was below both sampling controls. The circuits sample assignments in a model built from measured single-agent and pairwise responses.
ER  -