Related papers: An efficient algorithm for electronic-structure ca…
We present an efficient computational approach to perform real-space electronic structure calculations using an adaptive higher-order finite-element discretization of Kohn-Sham density-functional theory (DFT). To this end, we develop an…
Quantum chemistry has been viewed as one of the potential early applications of quantum computing. Two techniques have been proposed for electronic structure calculations: (i) the variational quantum eigensolver and (ii) the…
A myriad of phenomena in materials science and chemistry rely on quantum-level simulations of the electronic structure in matter. While moving to larger length and time scales has been a pressing issue for decades, such large-scale…
Second-order optimization methods have desirable convergence properties. However, the exact Newton method requires expensive computation for the Hessian and its inverse. In this paper, we propose SPAN, a novel approximate and fast Newton…
We present an efficient quasi-Newton orbital solver optimized to reduce the number of gradient (Fock matrix) evaluations. The solver optimizes orthogonal orbitals by sequences of unitary rotations generated by the (preconditioned)…
A novel low complexity method to perform self-consistent electronic-structure calculations using the Kohn-Sham formalism of density functional theory is presented. Localization constraints are neither imposed nor required thereby allowing…
Quasi-Newton methods are widely used in practise for convex loss minimization problems. These methods exhibit good empirical performance on a wide variety of tasks and enjoy super-linear convergence to the optimal solution. For large-scale…
We show here that the Hamiltonian for an electronic system may be written exactly in terms of fluctuation operators that transition constituent fragments between internally correlated states, accounting rigorously for inter-fragment…
In this work, we present the hitherto most efficient and accurate method for the numerical integration of post-Newtonian equations of motion. We first transform the Poisson system as given by the post-Newtonian approximation to canonically…
Finding the ground state of a Hamiltonian system is of great significance in many-body quantum physics and quantum chemistry. We propose an improved iterative quantum algorithm to prepare the ground state of a Hamiltonian. The crucial point…
The exact solution of Schrodinger equation for atoms, molecules and extended systems continues to be a "Holy Grail" problem that the entire field has been striving to solve since its inception. Recently, breakthroughs have been made in the…
Electronic structure calculation of atoms and molecules, in the past few decades has largely been dominated by density functional methods. This is primarily due to the fact that this can account for electron correlation effects in a…
A collision-based hybrid algorithm for the discrete ordinates approximation of the neutron transport equation is extended to the multigroup setting. The algorithm uses discrete energy and angle grids at two different resolutions and…
A representation without explicit use of the isospin formalism is developed for the precise study of few-nucleon systems, and the advantages of the proposed approach are demonstrated. Using the example of three-nucleon systems with central…
As physical implementations of quantum architectures emerge, it is increasingly important to consider the cost of algorithms for practical connectivities between qubits. We show that by using an arrangement of gates that we term the…
Multicomponent methods are a conceptually simple way to include nuclear quantum effects into quantum chemistry calculations. In multicomponent methods, the electronic molecular orbitals are described using the linear combination of atomic…
The authors present SHarmonic, a new implementation of the spherical harmonics targeted for electronic-structure calculations. Their approach is to use explicit formulas for the harmonics written in terms of normalized Cartesian…
We introduce an inertial quasi-Newton Forward-Backward Splitting Algorithm to solve a class of monotone inclusion problems. While the inertial step is computationally cheap, in general, the bottleneck is the evaluation of the resolvent…
We develop a discontinuous Galerkin (DG) framework for automatically constructing adaptive basis sets for electronic structure calculations. By allowing basis functions to be discontinuous across element interfaces, our approach supports…
We have developed a set of techniques for performing large scale ab initio calculations using multigrid accelerations and a real-space grid as a basis. The multigrid methods permit efficient calculations on ill-conditioned systems with long…