Time-dependent Hartree–Fock frequency-dependent polarizability calculation applied to divide-and-conquer electronic structure method

Excitation configuration analysis for divide-and-conquer excited-state calculation method using dynamical polarizability

The authors previously developed a divide-and-conquer (DC)-based non-local excited-state calculation method for large systems using dynamical polarizability [Nakai and Yoshikawa, J. Chem. Phys. 146, 124123 (2017)]. This method evaluates the excitation energies and oscillator strengths using information on the dynamical polarizability poles. This article proposes a novel analysis of the previously developed method to obtain further configuration information on excited states, including excitation and de-excitation coefficients of each excitation configuration. Numerical applications to simple molecules, such as ethylene, hydrogen molecule, ammonia, and pyridazine, confirmed that the proposed analysis could accurately reproduce the excitation and de-excitation coefficients. The combination with the DC scheme enables both the local and non-local excited states of large systems with an excited nature to be treated.

Divide-and-Conquer Linear-Scaling Quantum Chemical Computations

Fragmentation and embedding schemes are of great importance when applying quantum-chemical calculations to more complex and attractive targets. The divide-and-conquer (DC)-based quantum-chemical model is a fragmentation scheme that can be connected to embedding schemes. This feature article explains several DC-based schemes developed by the authors over the last two decades, which was inspired by the pioneering study of DC self-consistent field (SCF) method by Yang and Lee (J. Chem. Phys. 1995, 103, 5674-5678). First, the theoretical aspects of the DC-based SCF, electron correlation, excited-state, and nuclear orbital methods are described, followed by the two-component relativistic theory, quantum-mechanical molecular dynamics simulation, and the introduction of three programs, including DC-based schemes. Illustrative applications confirmed the accuracy and feasibility of the DC-based schemes.

Quantum Algorithm of the Divide-and-Conquer Unitary Coupled Cluster Method with a Variational Quantum Eigensolver

The variational quantum eigensolver (VQE) with shallow or constant-depth quantum circuits is one of the most pursued approaches in the noisy intermediate-scale quantum (NISQ) devices with incoherent errors. In this study, the divide-and-conquer (DC) linear scaling technique, which divides the entire system into several fragments, is applied to the VQE algorithm based on the unitary coupled cluster (UCC) method, denoted as DC-qUCC/VQE, to reduce the number of required qubits. The unitarity of the UCC ansatz that enables the evaluation of the total energy as well as various molecular properties as expectation values can be easily implemented on quantum devices because the quantum gates are unitary operators themselves. Based on this feature, the present DC-qUCC/VQE algorithm is designed to conserve the total number of electrons in the entire system using the density matrix evaluated on a quantum computer. Numerical assessments clarified that the energy errors of the DC-qUCC/VQE calculations decrease by using the constraint of the total number of electrons. Furthermore, the DC-qUCC/VQE algorithm could reduce the number of quantum gates and shows the possibility of decreasing incoherent errors.

Large-scale excited-state calculation using dynamical polarizability evaluated by divide-and-conquer based coupled cluster linear response method

This study attempted to propose an efficient scheme at the coupled cluster linear response (CCLR) level to perform large-scale excited-state calculations of not only local excitations but also nonlocal ones such as charge transfers and transitions between delocalized orbitals. Although standard applications of fragmentation techniques to the excited-state calculations brought about the limitations that could only deal with local excitations, this study solved the problem by evaluating the excited states as the poles of dynamical polarizability. Because such an approach previously succeeded at the time-dependent density functional theory level [H. Nakai and T. Yoshikawa, J. Chem. Phys. 146, 124123 (2017)], this study was considered as an extension to the CCLR level. To evaluate the dynamical polarizability at the CCLR level, we revisited three equivalent formulas, namely, coupled-perturbed self-consistent field (CPSCF), random phase approximation (RPA), and Green's function (GF). We further extended these formulas to the linear-scaling methods based on the divide-and-conquer (DC) technique. We implemented the CCLR with singles and doubles (CCSDLR) program for the six schemes, i.e., the standard and DC-type CPSCF, RPA, and GF. Illustrative applications of the present methods demonstrated the accuracy and efficiency. Although the standard three treatments could exactly reproduced the conventional frequency-domain CCSDLR results, their computational costs were commonly higher than that of the conventional ones due to large amount of computations for individual frequencies of the external electric field. The DC-type treatments, which approximately reproduced the conventional results, could achieve quasilinear scaling computational costs. Among them, DC-GF was found to exhibit the best performance.

GPU-Accelerated Large-Scale Excited-State Simulation Based on Divide-and-Conquer Time-Dependent Density-Functional Tight-Binding

The present study implemented the divide-and-conquer time-dependent density-functional tight-binding (DC-TDDFTB) code on a graphical processing unit (GPU). The DC method, which is a linear-scaling scheme, divides a total system into several fragments. By separately solving local equations in individual fragments, the DC method could reduce slow central processing unit (CPU)-GPU memory access, as well as computational cost, and avoid shortfalls of GPU memory. Numerical applications confirmed that the present code on GPU significantly accelerated the TDDFTB calculations, while maintaining accuracy. Furthermore, the DC-TDDFTB simulation of 2-acetylindan-1,3-dione displays excited-state intramolecular proton transfer and provides reasonable absorption and fluorescence energies with the corresponding experimental values. © 2019 Wiley Periodicals, Inc.

Efficient pole-search algorithm for dynamic polarizability: Toward alternative excited-state calculation for large systems

This study presents an efficient algorithm to search for the poles of dynamic polarizability to obtain excited states of large systems with nonlocal excitation nature. The present algorithm adopts a homogeneous search with a constant frequency interval and a bisection search to achieve high accuracy. Furthermore, the subtraction process of the information about the detected poles from the total dynamic polarizability is used to extract the undetected pole contributions. Numerical assessments confirmed the accuracy and efficiency of the present algorithm in obtaining the excitation energies and oscillator strengths of all dipole-allowed excited states. A combination of the present pole-search algorithm and divide-and-conquer-based dynamic polarizability calculations was found to be promising to treat nonlocal excitations of large systems. © 2016 Wiley Periodicals, Inc.

Divide-and-conquer quantum mechanical material simulations with exascale supercomputers

Recent developments in large-scale materials science simulations, especially under the divide-and-conquer method, are reviewed. The pros and cons of the divide-and-conquer method are discussed. It is argued that the divide-and-conquer method, such as the linear-scaling 3D fragment method, is an ideal approach to take advantage of the heterogeneous architectures of modern-day supercomputers despite their relatively large prefactors among linear-scaling methods. Some developments in graphics processing unit (GPU) electronic structure calculations are also reviewed. The accelerators like GPU could be an essential part for the future exascale supercomputing.