An official website of the United States government
Quantum simulations of electronic structure with a transformed Hamiltonian that includes some electron correlation effects are demonstrated. The transcorrelated Hamiltonian used in this work is efficiently constructed classically, at polynomial cost, by an approximate similarity transformation with an explicitly correlated two-body unitary operator. This Hamiltonian is Hermitian, includes no more than two-particle interactions, and is free of electron–electron singularities. We investigate the effect of such a transformed Hamiltonian on the accuracy and computational cost of quantum simulations by focusing on a widely used solver for the Schrödinger equation, namely the variational quantum eigensolver method, based on the unitary coupled cluster with singles and doubles (q-UCCSD) Ansatz. Nevertheless, the formalism presented here translates straightforwardly to other quantum algorithms for chemistry. Our results demonstrate that a transcorrelated Hamiltonian, paired with extremely compact bases, produces explicitly correlated energies comparable to those from much larger bases. For the chemical species studied here, explicitly correlated energies based on an underlying 6-31G basis had cc-pVTZ quality. The use of the very compact transcorrelated Hamiltonian reduces the number of CNOT gates required to achieve cc-pVTZ quality by up to two orders of magnitude, and the number of qubits by a factor of three.
more »
« less
Diagrammatic Coupled Cluster Monte Carlo
We propose a modified coupled cluster Monte Carlo algorithm that stochastically samples connected terms within the truncated Baker–Campbell–Hausdorff expansion of the similarity-transformed Hamiltonian by construction of coupled cluster diagrams on the fly. Our new approach—diagCCMC—allows propagation to be performed using only the connected components of the similarity-transformed Hamiltonian, greatly reducing the memory cost associated with the stochastic solution of the coupled cluster equations. We show that for perfectly local, noninteracting systems diagCCMC is able to represent the coupled cluster wavefunction with a memory cost that scales linearly with system size. The favorable memory cost is observed with the only assumption of fixed stochastic granularity and is valid for arbitrary levels of coupled cluster theory. Significant reduction in memory cost is also shown to smoothly appear with dissociation of a finite chain of helium atoms. This approach is also shown not to break down in the presence of strong correlation through the example of a stretched nitrogen molecule. Our novel methodology moves the theoretical basis of coupled cluster Monte Carlo closer to deterministic approaches.
more »
« less
- PAR ID:
- 10137040
- Date Published:
- Journal Name:
- Journal of chemical theory and computation
- Volume:
- 10
- Issue:
- 5
- ISSN:
- 1549-9626
- Page Range / eLocation ID:
- 925-935
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
We recently proposed a semi-stochastic approach to converging high-level coupled-cluster (CC) energetics, such as those obtained in the CC calculations with singles, doubles, and triples (CCSDT), in which the deterministic CC(P;Q) framework is merged with the stochastic configuration interaction Quantum Monte Carlo propagations [J. E. Deustua, J. Shen, and P. Piecuch, Phys. Rev. Lett. 119, 223003 (2017)]. In this work, we investigate the ability of the semi-stochastic CC(P;Q) methodology to recover the CCSDT energies of the lowest singlet and triplet states and the corresponding singlet–triplet gaps of biradical systems using methylene, (HFH)−, cyclobutadiene, cyclopentadienyl cation, and trimethylenemethane as examples.more » « less
-
State-of-the-art many-body wave function techniques rely on heuristics to achieve high accuracy at an attainable computational cost to solve the many-body Schrödinger equation. By far, the most common property used to assess accuracy has been the total energy; however, total energies do not give a complete picture of electron correlation. In this work, we assess the von Neumann entropy of the one-particle reduced density matrix (1-RDM) to compare selected configuration interaction (CI), coupled cluster, variational Monte Carlo, and fixed-node diffusion Monte Carlo for benchmark hydrogen chains. A new algorithm, the circle reject method, is presented, which improves the efficiency of evaluating the von Neumann entropy using quantum Monte Carlo by several orders of magnitude. The von Neumann entropy of the 1-RDM and the eigenvalues of the 1-RDM are shown to distinguish between the dynamic correlation introduced by the Jastrow and the static correlation introduced by determinants with large weights, confirming some of the lore in the field concerning the difference between the selected CI and Slater–Jastrow wave functions.more » « less
-
Stochastic gradient Hamiltonian Monte Carlo (SGHMC) is a variant of stochastic gradients with momentum where a controlled and properly scaled Gaussian noise is added to the stochastic gradients to steer the iterates toward a global minimum. Many works report its empirical success in practice for solving stochastic nonconvex optimization problems; in particular, it has been observed to outperform overdamped Langevin Monte Carlo–based methods, such as stochastic gradient Langevin dynamics (SGLD), in many applications. Although the asymptotic global convergence properties of SGHMC are well known, its finite-time performance is not well understood. In this work, we study two variants of SGHMC based on two alternative discretizations of the underdamped Langevin diffusion. We provide finite-time performance bounds for the global convergence of both SGHMC variants for solving stochastic nonconvex optimization problems with explicit constants. Our results lead to nonasymptotic guarantees for both population and empirical risk minimization problems. For a fixed target accuracy level on a class of nonconvex problems, we obtain complexity bounds for SGHMC that can be tighter than those available for SGLD.more » « less
-
Li, J.; Spanos, P. D.; Chen, J. B.; Peng, Y. B. (Ed.)Infrastructure networks offer critical services to modern society. They dynamically interact with the environment, operators, and users. Infrastructure networks are unique engineered systems, large in scale and high in complexity. One fundamental issue for their reliability assessment is the uncertainty propagation from stochastic disturbances across interconnected components. Monte Carlo simulation (MCS) remains approachable to quantify stochastic dynamics from components to systems. Its application depends on time efficiency along with the capability of delivering reliable approximations. In this paper, we introduce Quasi Monte Carlo (QMC) sampling techniques to improve modeling efficiency. Also, we suggest a principled Monte Carlo (PMC) method that equips the crude MCS with Probably Approximately Correct (PAC) approaches to deliver guaranteed approximations. We compare our proposed schemes with a competitive approach for stochastic dynamic analysis, namely the Probability Density Evolution Method (PDEM). Our computational experiments are on ideal but complex enough source-terminal (S-T) dynamic network reliability problems. We endow network links with oscillators so that they can jump across safe and failed states allowing us to treat the problem from a stochastic process perspective. We find that QMC alone can yield practical accuracy, and PMC with a PAC algorithm can deliver accuracy guarantees. Also, QMC is more versatile and efficient than the PDEM for network reliability assessment. The QMC and PMC methods provide advanced uncertainty propagation techniques to support decision makers with their reliability problems.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/https://doi.org/10.1021/acs.jpclett.9b00067
