CORTEXA
← Browse
arxivphysics.chem-phcs.LG2026-07-02

Q-Score: A Quantum-Native Scoring Function for Molecular Docking

Kangyu Zheng, Yidong Zhou, Ruihao Li, Zixin Ding, Zhiding Liang, Shaohua Li

Molecular docking predicts how a small molecule binds to a protein and is a key bottleneck in drug discovery. Classical scoring functions sum empirical pairwise contacts, blind to quantum-mechanical effects like orbital charge transfer that govern binding specificity. We introduce Q-Score, encoding GNN-predicted orbital donor-acceptor energies into a weighted graph and scoring binding by solving a maximum-weight vertex clique problem via Digitized-Counterdiabatic QAOA. Each interaction anchor maps to one qubit and compatibility constraints become edges. Across 11 protein targets, DC-QAOA recovers the exact optimum on 8 at 10 qubits. On 1000 AI-generated molecules, Q-Score is orthogonal to classical scoring with Spearman rho of 0.05, driven by orbital quality with rho of 0.90, and free of molecular-weight bias, enriching for strong orbital interactions at twice the random rate. DC-QAOA achieves a mean approximation ratio of 0.94 with 52 percent exact. Execution of 1000 circuits on IBM Eagle confirms 6-qubit solvability on NISQ hardware.

View free PDFSource page

Related papers

arxivquant-phcs.ETcs.LGphysics.chem-ph2026-07-23

An Analytically Trained Variational Surrogate for Quantum Phase Estimation on NISQ Hardware

Mousumi Kundu, Ashish Kumar Patra, Anurag K. S. V., Ruchika Bhat, Sai Shankar P., Alok Shukla, et al.

Quantum Phase Estimation (QPE) is a foundational algorithm for molecular ground-state energy estimation, but its deep circuit requirements make direct hardware execution impractical on Noisy Intermediate-Scale Quantum (NISQ) devices. We present an analytically grounded variationa…

View free PDFSource page
arxivcs.LGphysics.chem-phphysics.comp-ph2026-07-31

Frugal Bayesian Optimization: Scalable Surrogates for Data- and Resource-Limited Discovery

Panagiotis Krokidas, Christoforos Rekatsinas, Vassilis Sioros, Grigorios M. Chatziathanasiou, Efi-Maria Papia, George Giannakopoulos

Bayesian Optimization (BO) is widely adopted for data-efficient optimization in scientific and engineering applications, yet its computational cost is rarely evaluated alongside optimization performance. Here we present a systematic, compute-aware study of BO that evaluates surro…

View free PDFSource page
arxivcs.LGcs.AI2026-07-31

Implicit Machine Learning Force Fields Accelerate Molecular Dynamics Simulations

Johannes Maeß, Leon Werner, J. Thorben Frank, Winfried Ripken, Martin Michajlow, Joshua Futterer, et al.

We introduce implicit machine learning force fields (I-MLFFs), which replace explicit stacks of neural network layers with self-consistent fixed-point equations. In molecular simulations, this formulation enables intermediate representations to be reused across successive timeste…

View free PDFSource page
arxivcs.LGcs.AI2026-07-24

TriGlue: a Biology-Inspired Generative Model for Generating Molecular Glue-Induced Ternary Complex

Yuliang Yan, Shuo Yan, Haochun Tang, Yiqin Sun, Enyan Dai

Molecular glue degraders have emerged as a promising strategy for targeted protein degradation by inducing ternary complex formation between an E3 ubiquitin ligase and a target protein. Despite their therapeutic potential, computational design of molecular glues remains largely u…

View free PDFSource page
arxivcs.LGeess.SY2026-07-24

Variance-Reduced Q-Learning over Static and Time-Varying Networks

Sreejeet Maity, Feng Zhu, Aritra Mitra, Robert W. Heath

We investigate a decentralized reinforcement learning problem involving multiple agents that interact with the same Markov Decision Process (MDP). The agents can exchange information over a network to collectively learn the optimal state-action value function. For this setting, w…

View free PDFSource page