Molecular Dynamics Simulation

Glassy silica is a foundational material in optics and electronics, yet accurately predicting its medium-range order (MRO) remains a major challenge for machine-learning interatomic potentials (MLIPs). While local MLIPs reproduce the short-range SiO4 tetrahedral network well, it remains unclear whether locality alone is sufficient to recover the first sharp diffraction peak (FSDP), the principal experimental signature of MRO. Here, we combine neutron and X-ray diffraction measurements with large-scale molecular dynamics driven by two MACE-based models: a short-range (SR) potential and a long-range (LR) extension incorporating reciprocal-space gated attention. The SR model systematically over-structures the network, producing an overly intense FSDP in both the liquid and glassy states. Incorporating long-range interactions improves agreement with experiment for the liquid structure by reducing this excess ordering, but the LR model still fails to recover the experimental amorphous MRO after quenching. Ring-statistics and bond-angle analyses reveal that SR model exhibits an artificially narrow distribution dominated by six-membered rings, while the LR model produces a broader but still biased ring population. Despite preserving the correct tetrahedral geometry, both models show limited variability in Si-O-Si angles, indicating constrained network flexibility. These structural signatures demonstrate that both models retain excessive memory of the parent liquid network, leading to kinetically trapped and nonphysical medium-range configurations during vitrification. These results show that explicit long-range interactions are necessary but not sufficient for predictive modelling of disordered silica and suggest that accurate MRO further requires training data and sampling strategies that adequately represent the liquid-to-glass transition.

All-atom molecular dynamics (MD) simulations can predict polymer properties from molecular structure, yet their execution requires specialized expertise in force field selection, system construction, equilibration, and property extraction. We present PolyJarvis, a platform in which a planning agent produces a validated run plan that deterministic stage scripts execute through established simulation toolkits, Enhanced Monte Carlo (EMC) for system construction and LAMMPS for molecular dynamics, exposed as Model Context Protocol (MCP) servers, with a recovery agent consulted only on structured failures and within a fixed decision budget. Given a repeat-unit SMILES string and target properties, PolyJarvis constructs the amorphous cell, equilibrates it under a mechanized convergence gate, and computes target properties. Validation is conducted on seven amorphous homopolymers, each run as three replicates that share a protocol frozen per system and use independent random seeds, namely polyethylene (PE), atactic polystyrene (aPS), syndiotactic poly(vinyl chloride) (sPVC), poly(L-lactic acid) (PLLA), poly(ethylene glycol) (PEG), poly(ether ether ketone) (PEEK), and polysulfone (PSU). Against experimental references, 13 of 19 graded comparisons meet the acceptance criteria (density 5 of 7, glass transition 4 of 7, bulk modulus 4 of 5). The failures are concentrated in the PCFF systems: under-density of aPS and PEG, overestimated glass transitions of the stiff PLLA and PEEK backbones, and an overstiff PEG bulk modulus.

The rare-event sampling problem has long been the central limiting factor in molecular dynamics (MD), especially in biomolecular simulation. Recently, diffusion models such as BioEmu have emerged as powerful equilibrium samplers that generate independent samples from complex molecular distributions, eliminating the cost of sampling rare transition events. However, a sampling problem remains when computing observables that rely on states which are rare in equilibrium, for example folding free energies. Here, we introduce enhanced diffusion sampling, enabling efficient exploration of rare-event regions while preserving unbiased thermodynamic estimators. The key idea is to perform quantitatively accurate steering protocols to generate biased ensembles and subsequently recover equilibrium statistics via exact reweighting. We instantiate our framework in three algorithms: UmbrellaDiff (umbrella sampling with diffusion models), MetaDiff (a batchwise analogue for metadynamics), and $Δ$G-Diff (free-energy differences via tilted ensembles). Across toy systems, protein folding landscapes and folding free energies, our methods achieve fast, accurate, and scalable estimation of equilibrium properties within GPU-minutes to hours per system-closing the rare-event sampling gap that remained after the advent of diffusion-model equilibrium samplers.

Simulating the long-time evolution of Hamiltonian systems is limited by the small timesteps required for stable numerical integration. To overcome this constraint, we introduce a framework to learn Hamiltonian Flow Maps by predicting the mean phase-space evolution over a chosen time span, enabling stable large-timestep updates far beyond the stability limits of classical integrators. To this end, we impose a Mean Flow consistency condition for time-averaged Hamiltonian dynamics. Unlike prior approaches, this allows training on independent phase-space samples without access to future states, avoiding expensive trajectory generation. Validated across diverse Hamiltonian systems, our method in particular improves upon molecular dynamics simulations using machine-learned force fields (MLFF). Our models maintain comparable training and inference cost, but support significantly larger integration timesteps while trained directly on widely-available trajectory-free MLFF datasets.

Molecular dynamics (MD) simulations are a principled but computationally expensive approach for studying protein conformational variability, making it challenging to generate large ensembles of structures or characterize transitions between metastable conformations. AI methods for upsampling MD simulations have been developed recently but struggle due to difficulties of sampling complex, high-dimensional molecular distributions. One avenue these methods overlook is to learn a latent space where such sampling becomes easier. To address this, we introduce ProtScape, a generative geometric deep learning framework that learns structure and energy-aware representations of protein conformational landscapes from MD simulations. ProtScape represents protein conformations using an equivariant graph neural network and a multiscale deep wavelet transform that captures local geometric interactions and nonlocal collective motions. This latent representation is dual-organized: 1) by structure captured by wavelet transform layers, via reconstruction error; 2) by energy using a Laplacian energy smoothness penalty. This structured latent space enables meaningful generation and exploration of protein conformations. ProtScape supports multiple generative modes: 1) ensemble generation, which upsamples ensembles given limited MD trajectories flow matching from noise to the organized manifold of conformations, 2) minimum-energy path generation between two high-energy conformations, guided by energy using a nudged elastic band, and 3) energy-descent, which generates trajectories toward lower energies from a high-energy conformation using gradient descent, thereby hypothesizing folding or other stabilizing trajectories. Organizing a latent space by structure and energy lets one representation support ensemble sampling, minimum-energy path finding and energy-guided descent on the same conformational landscape.