Search

Computations of chemical systems' equilibrium properties and non-equilibrium dynamics have been suspected of being a "killer app" for quantum computers. This review highlights the recent advancements of quantum algorithms tackling complex sampling tasks in the key areas of computational chemistry: ground state, thermal state properties, and quantum dynamics calculations. We review a broad range of quantum algorithms, from hybrid quantum-classical to fully quantum, focusing on the traditional Monte Carlo family, including Markov chain Monte Carlo, variational Monte Carlo, projector Monte Carlo, path integral Monte Carlo, etc. We also cover other relevant techniques involving complex sampling tasks, such as quantum-selected configuration interaction, minimally entangled typical thermal states, entanglement forging, and Monte Carlo-flavored Lindbladian dynamics. We provide a comprehensive overview of these algorithms' classical and quantum counterparts, detailing their theoretical frameworks and discussing the potentials and challenges in achieving quantum computational advantages., Comment: 35 pages, 12 figures

ipie is a Python-based auxiliary-field quantum Monte Carlo (AFQMC) package that has undergone substantial improvements since its initial release [J. Chem. Theory Comput., 2022, 19(1): 109-121]. This paper outlines the improved modularity and new capabilities implemented in ipie. We highlight the ease of incorporating different trial and walker types and the seamless integration of ipie with external libraries. We enable distributed Hamiltonian simulations, allowing for multi-GPU simulations of large systems. This development enabled us to compute the interaction energy of a benzene dimer with 84 electrons and 1512 orbitals, which otherwise would not have fit on a single GPU. We also support GPU-accelerated multi-slater determinant trial wavefunctions [arXiv:2406.08314] to enable efficient and highly accurate simulations of large-scale systems. This allows for near-exact ground state energies of multi-reference clusters, [Cu$_2$O$_2$]$^{2+}$ and [Fe$_2$S$_2$(SCH$_3$)]$^{2-}$. We also describe implementations of free projection AFQMC, finite temperature AFQMC, AFQMC for electron-phonon systems, and automatic differentiation in AFQMC for calculating physical properties. These advancements position ipie as a leading platform for AFQMC research in quantum chemistry, facilitating more complex and ambitious computational method development and their applications., Comment: 17 pages, 13 figures

While modern biotechnologies allow synthesizing new proteins and function measurements at scale, efficiently exploring a protein sequence space and engineering it remains a daunting task due to the vast sequence space of any given protein. Protein engineering is typically conducted through an iterative process of adding mutations to the wild-type or lead sequences, recombination of mutations, and running new rounds of screening. To enhance the efficiency of such a process, we propose a tree search-based bandit learning method, which expands a tree starting from the initial sequence with the guidance of a bandit machine learning model. Under simplified assumptions and a Gaussian Process prior, we provide theoretical analysis and a Bayesian regret bound, demonstrating that the combination of local search and bandit learning method can efficiently discover a near-optimal design. The full algorithm is compatible with a suite of randomized tree search heuristics, machine learning models, pre-trained embeddings, and bandit techniques. We test various instances of the algorithm across benchmark protein datasets using simulated screens. Experiment results demonstrate that the algorithm is both sample-efficient and able to find top designs using reasonably small mutation counts., Comment: AAAI 2024