The Learnable Graph Network Model (LGNM) is introduced, a heterogeneous ENM in which per-edge spring constants θij = fi · fj · (dc/rij)2 are parameterised by per-residue flexibility coefficients {fi} predicted by a physics-constrained Graph Neural Network (GNN).
Abstract
Elastic Network Models (ENMs), particularly the Gaussian Network Model (GNM) and its distance-weighted variant (mENM), predict per-residue protein flexibility from Cα contact graphs at low computational cost. Their central limitation is the assumption of uniform spring constants, which ignores the chemical identity, burial depth, and evolutionary conservation of individual residue contacts. We introduce the Learnable Graph Network Model (LGNM), a heterogeneous ENM in which per-edge spring constants θij = fi · fj · (dc/rij)2 are parameterised by per-residue flexibility coefficients {fi} predicted by a physics-constrained Graph Neural Network (GNN). The GNN is trained on molecular dynamics (MD)-derived root-mean-square fluctuation (RMSF) profiles from 413 proteins in the ATLAS database, using fold-disjoint CATH superfamily splits. The learning objective is an instance of the Quantum Neural PDE (QNPDE) Hamiltonian learning framework, with K = 3 operator types enabling an O(K) quantum gradient versus O (N3) classical pseudo-inversion. On 91 held-out test proteins, LGNM achieves mean per-protein Pearson correlation r = 0.8549± 0.1055, versus r = 0.8024 ± 0.1167 for mENM (Δr = +0.0525; 77/91 proteins improved). The implementation of this methedology is aviliable at https://lgnm.compbiosysnbu.in/ allowing researchers to evaluate flexibility and downstream processses.
Mandala is a modular software framework for learning block-sparse electronic-structure matrices with E(3)-equivariant graph neural networks that connects electronic-structure learning and observable-guided modeling while retaining a representation tied to quantum-mechanical operators rather than only scalar or vector targets as in MLIPs.
B. Brzoza, Wiktoria Szopa, Z. Elabid et al.· 0 citations
A GNN based on Continuous-Time Quantum Walks (CTQW) and exploiting two properties of the CTQW propagator, preserving mid- and high-frequency signals for heterophilic graphs while preventing Dirichlet-energy collapse.
Yu-Liang Zhan, Ze-Feng Gao, Jian Li et al.· 0 citations
Graph neural networks (GNNs) have demonstrated strong capabilities in graph representation learning but still face limitations in efficiency and scalability. Quantum GNNs (QGNNs) offer a promising alternative. However, existing approaches often fail to fully exploit edge information, require substantial quantum resources, and insufficiently account for permutation invariance in graph learning. To address these challenges, this article proposes a permutation-invariant quantum GNN (PIQGNN). The proposed model introduces a low-qubit-cost quantum encoding strategy that jointly embeds node features, edge features, and graph topology into entangled quantum states using only $n$ qubits, where $n$ denotes the number of nodes, while explicitly enforcing permutation invariance. Furthermore, a symmetry-aware variational quantum neural network (QNN) is designed to enable end-to-end permutation-invariant learning. Its hyperparameters are optimized via Bayesian optimization to alleviate barren plateau (BP) effects and enhance training stability. Experimental results on multiple graph binary classification benchmark datasets demonstrate that, compared with classical GNNs, PIQGNN achieves competitive performance with a significantly reduced number of trainable parameters. Compared with existing QGNNs, PIQGNN attains higher accuracy with lower quantum resource requirements and exhibits stronger robustness under noisy conditions. These results indicate that PIQGNN provides an efficient, scalable, and noise-resilient quantum framework for graph learning, highlighting its practical potential in the noisy intermediate-scale quantum (NISQ) era.
Maoduo Li, Wen Liu, Lei Shi et al.· IEEE Transactions on Neural...· 0 citations
Graph Circuit Learning is introduced, a supervised, amortized framework that trains a GNN across multiple model--task pairs and applies it to unseen cases and preliminary results suggest that graph machine learning offers a natural and potentially powerful perspective on circuit localization.
Chester Tan, Moritz Lampert, Courtney Maynard et al.· 0 citations
The proposed Coordination Polyhedron Graph Network (CPGN) is a multi-scale GNN that jointly learns atomic, bond, and coordination-polyhedron representations and outperforms existing state-of-the-art GNN models.
S. Chakraborty· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.