Searcharxiv⌕ Search

arXiv subjects

Xiaojie Wu

Publications and source records attributed to Xiaojie Wu.

18 recordsLinked to original sources

THEMol dataset: Torsion, Hessian, and Energy of Molecules

We present THEMol (Torsion, Hessian, Energy of Molecules), a massive open-source collection of quantum mechanical properties tailored for closed-shell organic molecules, with up to 50 heavy atoms. THEMol includes a Hessian subset with more than 3 million relaxed geometries with Hessian matrices, a TorsionScan subset with nearly 100 million constrained relaxed geometries with energies and forces, and relaxation-trajectory subsets (HessianRelax and TorsionScanRelax) that together comprise about 3 billion DFT calculations. The chemical space sampling is comprehensive, spanning twelve essential elements and diverse molecular architectures relevant to drug discovery, electrolytes, ionic liquids, and beyond. The dataset also features exhaustive conformational sampling through the TorsionScan and TorsionScanRelax subsets, including comprehensive in-ring and non-ring torsional scans. Furthermore, it contains an extensive library of Hessian matrices, computed at relaxed geometries, to capture critical second-derivative information of the potential energy landscape. Additionally, we supply electron density-derived atomic multipoles computed via the Minimal Basis Iterative Stockholder partition scheme. Organized into five distinct subsets (Hessian, TorsionScan, HessianRelax, TorsionScanRelax, and MBIS), the data encompasses optimized geometries, relaxation trajectories, and derived molecular properties. We anticipate that this massive and diverse dataset will significantly empower the development of highly accurate and transferable molecular potentials.

physics.chem-ph↗

The Python Simulations of Chemistry Framework: 10 years of an open-source quantum chemistry project

Over the past decade, the Python-based Simulations of Chemistry Framework (PySCF) has developed into a widely used open-source platform for electronic structure theory and quantum chemical method development. This article reviews the major advances since the previous overview in 2020, covering new modules and methodology, infrastructure changes, and performance benchmarks.

physics.chem-ph↗

GPU Accelerated Minimal Auxiliary Basis Approach TDDFT for Large Organic Molecules

We introduce a GPU-accelerated implementation of time-dependent density functional theory with the minimal auxiliary basis approach (TDDFT-risp) in GPU4PySCF, together with large system demonstrations carried out using the Tamm--Dancoff approximation (TDA-risp). The method combines GPU-accelerated three-center integral evaluation, tensor contractions, exchange-space truncation, omission of hydrogen atoms from the auxiliary basis, and a host memory assisted Davidson solver. On the EXTEST42 benchmark set, a conservative 40 eV exchange cutoff yields excitation-energy errors relative to standard TDA of about 0.03--0.05 eV for low-lying states. For systems of 300 to 3000 atoms, we demonstrate that TDA-risp calculations of 15 low-lying excited states with $ω$B97XD/def2-SVP complete on a single A100 GPU with wall times ranging from minutes to hours. These results position GPU-TDDFT-risp as a practical route toward excited-state calculations for large organic and biomolecular systems with thousands of atoms.

physics.chem-ph↗

Designing quantum chemistry algorithms with just-in-time compilation

We introduce just-in-time (JIT) compilation to the integral kernels for Gaussian-type orbitals (GTOs) to enhance the efficiency of electron repulsion integral computations. For Coulomb and exchange (JK) matrices, JIT-based algorithms yield a 2x speedup for the small 6-31G* basis set over GPU4PySCF v1.4 on an NVIDIA A100-80G GPU. By incorporating a novel algorithm designed for orbitals with high angular momentum, the efficiency of JK evaluations with the large def2-TZVPP basis set is improved by up to 4x. The core CUDA implementation is compact, comprising only ~1,000 lines of code, including support for single-precision arithmetic. Furthermore, the single-precision implementation achieves a 3x speedup over the previous state-of-the-art.

physics.comp-ph↗

Analytical Excited-State Gradients and Derivative Couplings in TDDFT with Minimal Auxiliary Basis Set Approximation and GPU Acceleration

Calculating excited-state gradients and derivative couplings using time-dependent density functional theory (TDDFT) remains a computationally demanding task. An efficient variant, TDDFT with resolution of the identity and a minimal auxiliary basis (TDDFT-ris), has been developed to accelerate excitation energy calculations. However, the formulation and implementation of analytical derivatives for this method have not yet been reported. In this work, we present an implementation of analytical excited-state gradients and derivative couplings within the TDDFT-ris framework. Benchmark calculations on medium-sized organic molecules demonstrate a two- to three-fold speedup for both gradients and derivative couplings compared to standard TDDFT. The accuracy of the TDDFT-ris approach is assessed for gradient-dependent applications, including geometry optimizations, emission energy calculations, and the localization of minimum-energy crossing points. Overall, the TDDFT-ris method provides reliable approximations for most cases, with noticeable errors mainly occurring in derivative couplings between nearly degenerate states.

physics.chem-ph↗

ForgeDAN: An Evolutionary Framework for Jailbreaking Aligned Large Language Models

The rapid adoption of large language models (LLMs) has brought both transformative applications and new security risks, including jailbreak attacks that bypass alignment safeguards to elicit harmful outputs. Existing automated jailbreak generation approaches e.g. AutoDAN, suffer from limited mutation diversity, shallow fitness evaluation, and fragile keyword-based detection. To address these limitations, we propose ForgeDAN, a novel evolutionary framework for generating semantically coherent and highly effective adversarial prompts against aligned LLMs. First, ForgeDAN introduces multi-strategy textual perturbations across \textit{character, word, and sentence-level} operations to enhance attack diversity; then we employ interpretable semantic fitness evaluation based on a text similarity model to guide the evolutionary process toward semantically relevant and harmful outputs; finally, ForgeDAN integrates dual-dimensional jailbreak judgment, leveraging an LLM-based classifier to jointly assess model compliance and output harmfulness, thereby reducing false positives and improving detection effectiveness. Our evaluation demonstrates ForgeDAN achieves high jailbreaking success rates while maintaining naturalness and stealth, outperforming existing SOTA solutions.

cs.CR↗

A predictive machine learning force field framework for liquid electrolyte development

Despite the widespread applications of machine learning force fields (MLFF) in solids and small molecules, there is a notable gap in applying MLFF to simulate liquid electrolyte, a critical component of the current commercial lithium-ion battery. In this work, we introduce BAMBOO (\textbf{B}yteDance \textbf{A}I \textbf{M}olecular Simulation \textbf{Boo}ster), a predictive framework for molecular dynamics (MD) simulations, with a demonstration of its capability in the context of liquid electrolyte for lithium batteries. We design a physics-inspired graph equivariant transformer architecture as the backbone of BAMBOO to learn from quantum mechanical simulations. Additionally, we introduce an ensemble knowledge distillation approach and apply it to MLFFs to reduce the fluctuation of observations from MD simulations. Finally, we propose a density alignment algorithm to align BAMBOO with experimental measurements. BAMBOO demonstrates state-of-the-art accuracy in predicting key electrolyte properties such as density, viscosity, and ionic conductivity across various solvents and salt combinations. The current model, trained on more than 15 chemical species, achieves the average density error of 0.01 g/cm$^3$ on various compositions compared with experiment.

cond-mat.mtrl-sci↗

Data-Driven Parametrization of Molecular Mechanics Force Fields for Expansive Chemical Space Coverage

A force field is a critical component in molecular dynamics simulations for computational drug discovery. It must achieve high accuracy within the constraints of molecular mechanics' (MM) limited functional forms, which offers high computational efficiency. With the rapid expansion of synthetically accessible chemical space, traditional look-up table approaches face significant challenges. In this study, we address this issue using a modern data-driven approach, developing ByteFF, an Amber-compatible force field for drug-like molecules. To create ByteFF, we generated an expansive and highly diverse molecular dataset at the B3LYP-D3(BJ)/DZVP level of theory. This dataset includes 2.4 million optimized molecular fragment geometries with analytical Hessian matrices, along with 3.2 million torsion profiles. We then trained an edge-augmented, symmetry-preserving molecular graph neural network (GNN) on this dataset, employing a carefully optimized training strategy. Our model predicts all bonded and non-bonded MM force field parameters for drug-like molecules simultaneously across a broad chemical space. ByteFF demonstrates state-of-the-art performance on various benchmark datasets, excelling in predicting relaxed geometries, torsional energy profiles, and conformational energies and forces. Its exceptional accuracy and expansive chemical space coverage make ByteFF a valuable tool for multiple stages of computational drug discovery.

cs.LG↗

Enhancing GPU-acceleration in the Python-based Simulations of Chemistry Framework

We describe our contribution as industrial stakeholders to the existing open-source GPU4PySCF project (https: //github.com/pyscf/gpu4pyscf), a GPU-accelerated Python quantum chemistry package. We have integrated GPU acceleration into other PySCF functionality including Density Functional Theory (DFT), geometry optimization, frequency analysis, solvent models, and density fitting technique. Through these contributions, GPU4PySCF v1.0 can now be regarded as a fully functional and industrially relevant platform which we demonstrate in this work through a range of tests. When performing DFT calculations on modern GPU platforms, GPU4PySCF delivers 30 times speedup over a 32-core CPU node, resulting in approximately 90% cost savings for most DFT tasks. The performance advantages and productivity improvements have been found in multiple industrial applications, such as generating potential energy surfaces, analyzing molecular properties, calculating solvation free energy, identifying chemical reactions in lithium-ion batteries, and accelerating neural-network methods. With the improved design that makes it easy to integrate with the Python and PySCF ecosystem, GPU4PySCF is natural choice that we can now recommend for many industrial quantum chemistry applications.

physics.comp-ph↗

Towards the ground state of molecules via diffusion Monte Carlo on neural networks

Diffusion Monte Carlo (DMC) based on fixed-node approximation has enjoyed significant developments in the past decades and become one of the go-to methods when accurate ground state energy of molecules and materials is needed. The remaining bottleneck is the limitations of the inaccurate nodal structure, prohibiting more challenging electron correlation problems to be tackled with DMC. In this work, we apply the neural-network based trial wavefunction in fixed-node DMC, which allows accurate calculation of a broad range of atomic and molecular systems of different electronic characteristics. Our method is superior in both accuracy and efficiency compared to state-of-the-art neural network methods using variational Monte Carlo. Overall, this computational framework provides a new benchmark for accurate solution of correlated electronic wavefunction and also shed light on the chemical understanding of molecules.

physics.chem-ph↗

Discontinuous Galerkin method with Voronoi partitioning for Quantum Simulation of Chemistry

Molecular orbitals based on the linear combination of Gaussian type orbitals are arguably the most employed discretization in quantum chemistry simulations, both on quantum and classical devices. To circumvent a potentially dense two-body interaction tensor and obtain lower asymptotic costs for quantum simulations of chemistry, the discontinuous Galerkin (DG) procedure using a rectangular partitioning strategy was recently piloted [McClean et al, New J. Phys. 22, 093015, 2020]. The DG approach interpolates in a controllable way between a compact description of the two-body interaction tensor through molecular orbitals and a diagonal characterization through primitive basis sets, such as a planewave dual basis set. The DG procedure gives rise to a block-diagonal representation of the two-body interaction with reduced number of two-electron repulsion integrals, which in turn reduces the cost of quantum simulations. In the present work we extend this approach to be applicable to molecular and crystalline systems of arbitrary geometry. We take advantage of the flexibility of the planewave dual basis set, and combine the discontinuous Galerkin procedure with a general partitioning strategy based on the Voronoi decomposition. We numerically investigate the performance, at the mean-field and correlated levels, with quasi-1D, 2D and 3D partitions using hydrogen chains, H$_4$, CH$_4$ as examples, respectively. We also apply the method to graphene as a prototypical example of crystalline systems.

physics.comp-ph↗

Enhancing robustness and efficiency of density matrix embedding theory via semidefinite programming and local correlation potential fitting

Density matrix embedding theory (DMET) is a powerful quantum embedding method for solving strongly correlated quantum systems. Theoretically, the performance of a quantum embedding method should be limited by the computational cost of the impurity solver. However, the practical performance of DMET is often hindered by the numerical stability and the computational time of the correlation potential fitting procedure, which is defined on a single-particle level. Of particular difficulty are cases in which the effective single-particle system is gapless or nearly gapless. To alleviate these issues, we develop a semidefinite programming (SDP) based approach that can significantly enhance the robustness of the correlation potential fitting procedure compared to the traditional least squares fitting approach. We also develop a local correlation potential fitting approach, which allows one to identify the correlation potential from each fragment independently in each self-consistent field iteration, avoiding any optimization at the global level. We prove that the self-consistent solutions of DMET using this local correlation potential fitting procedure are equivalent to those of the original DMET with global fitting. We find that our combined approach, called L-DMET, in which we solve local fitting problems via semidefinite programming, can significantly improve both the robustness and the efficiency of DMET calculations. We demonstrate the performance of L-DMET on the 2D Hubbard model and the hydrogen chain. We also demonstrate with theoretical and numerical evidence that the use of a large fragment size can be a fundamental source of numerical instability in the DMET procedure.

physics.comp-ph↗

Numerical solution of large scale Hartree-Fock-Bogoliubov equations

The Hartree-Fock-Bogoliubov (HFB) theory is the starting point for treating superconducting systems. However, the computational cost for solving large scale HFB equations can be much larger than that of the Hartree-Fock equations, particularly when the Hamiltonian matrix is sparse, and the number of electrons $N$ is relatively small compared to the matrix size $N_{b}$. We first provide a concise and relatively self-contained review of the HFB theory for general finite sized quantum systems, with special focus on the treatment of spin symmetries from a linear algebra perspective. We then demonstrate that the pole expansion and selected inversion (PEXSI) method can be particularly well suited for solving large scale HFB equations. For a Hubbard-type Hamiltonian, the cost of PEXSI is at most $\Or(N_b^2)$ for both gapped and gapless systems, which can be significantly faster than the standard cubic scaling diagonalization methods. We show that PEXSI can solve a two-dimensional Hubbard-Hofstadter model with $N_b$ up to $2.88\times 10^6$, and the wall clock time is less than $100$ s using $17280$ CPU cores. This enables the simulation of physical systems under experimentally realizable magnetic fields, which cannot be otherwise simulated with smaller systems.

physics.comp-ph↗

Absorbing boundary conditions for the time-dependent Schrödinger-type equations in $\mathbb R^3$

Absorbing boundary conditions are presented for three-dimensional time-dependent Schrödinger-type of equations as a means to reduce the cost of the quantum-mechanical calculations. The boundary condition is first derived from a semi-discrete approximation of the Schrödinger equation with the advantage that the resulting formulas are automatically compatible with the finite-difference scheme and no further discretization is needed in space. The absorbing boundary condition is expressed as a discrete Dirichlet-to-Neumann (DtN) map, which can be further approximated in time by using rational approximations of the Laplace transform to enable a more efficient implementation. This approach can be applied to domains with arbitrary geometry. The stability of the zeroth order and first order absorbing boundary conditions is proved. We tested the boundary conditions on benchmark problems. The effectiveness is further verified by a time-dependent Hartree-Fock model with Skyrme interactions. The accuracy in terms of energy and nucleon density is examined as well.

math.NA↗

Projected Density Matrix Embedding Theory with Applications to the Two-Dimensional Hubbard Model

Density matrix embedding theory (DMET) is a quantum embedding theory for strongly correlated systems. From a computational perspective, one bottleneck in DMET is the optimization of the correlation potential to achieve self-consistency, especially for heterogeneous systems of large size. We propose a new method, called projected density matrix embedding theory (p-DMET), which achieves self-consistency without needing to optimize a correlation potential. We demonstrate the performance of p-DMET on the two-dimensional Hubbard model.

physics.chem-ph↗

Stable absorbing boundary conditions for molecular dynamics in general domains

A new type of absorbing boundary conditions for molecular dynamics simulations are presented. The exact boundary conditions for crystalline solids with harmonic approximation are expressed as a dynamic Dirichlet- to-Neumann (DtN) map. It connects the displacement of the atoms at the boundary to the traction on these atoms. The DtN map is valid for a domain with general geometry. To avoid evaluating the time convo- lution of the dynamic DtN map, we approximate the associated kernel function by rational functions in the Laplace domain. The parameters in the approximations are determined by interpolations. The explicit forms of the zeroth, first, and second order approximations will be presented. The stability of the molecular dynamics model, supplemented with these absorbing boundary conditions is established. Two numerical simulations are performed to demonstrate the effectiveness of the methods.

physics.comp-ph↗

On Consistent Definitions of Momentum and Energy Fluxes for Molecular Dynamics Models with Multi-body Interatomic Potentials

In this paper, we propose a two-level criteria to check the consistency of the definitions of continuum quantities in Molecular Dynamics. As examples, we follow the control- volume approach, derive the definitions of the tractions and energy fluxes for EAM potential and Tersoff potential, and provide the pseudo code the computing. Then, we verify the consistency of the definitions by analytical and numerical methods.

cond-mat.mtrl-sci↗

Accurate Evaluations of Strain and Stress in Atomistic Simulations of Crystalline Solids

In this paper, we study the accuracy of Irving-Kirkwood type of formulas for the approximation of continuum quantities from atomistic simulations. Such formulas are derived by expressing the displacement, deformation gradient and stress in terms of certain kernel functions. We propose two criteria for choosing the kernel functions to significantly improve the sampling accuracy. We present a simple procedure to construct kernel functions that meet these criteria. Further, numerical tests on homogeneous and non-homogeneous systems provide validations for our analysis.

physics.comp-ph↗