17 research outputs found

    Dynamical Mean-Field Theory Simulations with the Adaptive Sampling Configuration Interaction Method

    Get PDF
    In the pursuit of accurate descriptions of strongly correlated quantum many-body systems, dynamical mean-field theory (DMFT) has been an invaluable tool for elucidating the spectral properties and quantum phases of both phenomenological models and ab initio descriptions of real materials. Key to the DMFT process is the self-consistent map of the original system into an Anderson impurity model, the ground state of which is computed using an impurity solver. The power of the method is thus limited by the complexity of the impurity model the solver can handle. Simulating realistic systems generally requires many correlated sites. By adapting the recently proposed adaptive sampling configuration interaction (ASCI) method as an impurity solver, we enable much more efficient zero temperature DMFT simulations. The key feature of the ASCI method is that it selects only the most relevant Hilbert space degrees of freedom to describe the ground state. This reduces the numerical complexity of the calculation, which will allow us to pursue future DMFT simulations with more correlated impurity sites than in previous works. Here we present the ASCI-DMFT method and example calculations on the one-dimensional and two-dimensional Hubbard models that exemplify its efficient convergence and timing properties. We show that the ASCI approach is several orders of magnitude faster than the current best published ground state DMFT simulations, which allows us to study the bath discretization error in simulations with small clusters, as well as to address cluster sizes beyond the current state of the art. Our approach can also be adapted for other embedding methods such as density matrix embedding theory and self-energy embedding theory.Comment: 12 pages, 11 figures, supplemental informatio

    Quantum Eigenvector Continuation for Chemistry Applications

    Full text link
    A typical task for classical and quantum computing in chemistry is finding a potential energy surface (PES) along a reaction coordinate, which involves solving the quantum chemistry problem for many points along the reaction path. Developing algorithms to accomplish this task on quantum computers has been an active area of development, yet finding all the relevant eigenstates along the reaction coordinate remains a difficult problem, and determining PESs is thus a costly proposal. In this paper, we demonstrate the use of a eigenvector continuation -- a subspace expansion that uses a few eigenstates as a basis -- as a tool for rapidly exploring potential energy surfaces. We apply this to determining the binding PES or torsion PES for several molecules of varying complexity. In all cases, we show that the PES can be captured using relatively few basis states; suggesting that a significant amount of (quantum) computational effort can be saved by making use of already calculated ground states in this manner.Comment: 13 pages, 8 figures, 3 pages of appendi

    A Parallel, Distributed Memory Implementation of the Adaptive Sampling Configuration Interaction Method

    Full text link
    Many-body simulations of quantum systems is an active field of research that involves many different methods targeting various computing platforms. Many methods commonly employed, particularly coupled cluster methods, have been adapted to leverage the latest advances in modern high-performance computing.Selected configuration interaction (sCI) methods have seen extensive usage and development in recent years. However development of sCI methods targeting massively parallel resources has been explored only in a few research works. In this work, we present a parallel, distributed memory implementation of the adaptive sampling configuration interaction approach (ASCI) for sCI. In particular, we will address key concerns pertaining to the parallelization of the determinant search and selection, Hamiltonian formation, and the variational eigenvalue calculation for the ASCI method. Load balancing in the search step is achieved through the application of memory-efficient determinant constraints originally developed for the ASCI-PT2 method. Presented benchmarks demonstrate parallel efficiency exceeding 95\% for the variational ASCI calculation of Cr2_2 (24e,30o) with 106,10710^6, 10^7, and 3∗1083*10^8 variational determinants up to 16,384 CPUs. To the best of the authors' knowledge, this is the largest variational ASCI calculation to date.Comment: 32 pages, 4 figure
    corecore