Adam Holmes

Semistochastic Projector Monte Carlo Method

We introduce a semistochastic implementation of the power method to compute, for very large matrices, the dominant eigenvalue and expectation values involving the corresponding eigenvector. The method is semistochastic in that the matrix multiplication is partially implemented numerically exactly and partially stochastically with respect to expectation values only. Compared to a fully stochastic method, the semistochastic approach significantly reduces the computational time required to obtain the eigenvalue to a specified statistical uncertainty. This is demonstrated by the application of the semistochastic quantum Montexa0Carlo method to systems with a sign problem: the fermion Hubbard model and the carbon dimer.

Heat-Bath Configuration Interaction: An Efficient Selected Configuration Interaction Algorithm Inspired by Heat-Bath Sampling.

We introduce a new selected configuration interaction plus perturbation theory algorithm that is based on a deterministic analog of our recent efficient heat-bath sampling algorithm. This Heat-bath Configuration Interaction (HCI) algorithm makes use of two parameters that control the trade-off between speed and accuracy, one which controls the selection of determinants to add to a variational wave function and one which controls the selection of determinants used to compute the perturbative correction to the variational energy. We show that HCI provides an accurate treatment of both static and dynamic correlation by computing the potential energy curve of the multireference carbon dimer in the cc-pVDZ basis. We then demonstrate the speed and accuracy of HCI by recovering the full configuration interaction energy of both the carbon dimer in the cc-pVTZ basis and the strongly correlated chromium dimer in the Ahlrichs VDZ basis, correlating all electrons, to an accuracy of better than 1 mHa, in just a few minutes on a single core. These systems have full variational spaces of 3 × 10(14) and 2 × 10(22) determinants, respectively.

Semistochastic Heat-Bath Configuration Interaction Method: Selected Configuration Interaction with Semistochastic Perturbation Theory

We extend the recently proposed heat-bath configuration interaction (HCI) method [Holmes, Tubman, Umrigar, J. Chem. Theory Comput. 2016, 12, 3674], by introducing a semistochastic algorithm for performing multireference Epstein-Nesbet perturbation theory, in order to completely eliminate the severe memory bottleneck of the original method. The proposed algorithm has several attractive features. First, there is no sign problem that plagues several quantum Monte Carlo methods. Second, instead of using Metropolis-Hastings sampling, we use the Alias method to directly sample determinants from the reference wave function, thus avoiding correlations between consecutive samples. Third, in addition to removing the memory bottleneck, semistochastic HCI (SHCI) is faster than the deterministic variant for many systems if a stochastic error of 0.1 mHa is acceptable. Fourth, within the SHCI algorithm one can trade memory for a modest increase in computer time. Fifth, the perturbative calculation is embarrassingly parallel. The SHCI algorithm extends the range of applicability of the original algorithm, allowing us to calculate the correlation energy of very large active spaces. We demonstrate this by performing calculations on several first row dimers including F2 with an active space of (14e, 108o), Mn-Salen cluster with an active space of (28e, 22o), and Cr2 dimer with up to a quadruple-ζ basis set with an active space of (12e, 190o). For these systems we were able to obtain better than 1 mHa accuracy with a wall time of merely 55 s, 37 s, and 56 min on 1, 1, and 4 nodes, respectively.

Efficient Heat-Bath Sampling in Fock Space

We introduce an algorithm for sampling many-body quantum states in Fock space. The algorithm efficiently samples states with probability approximately proportional to an arbitrary function of the second-quantized Hamiltonian matrix element connecting the sampled state to the current state. We apply the new sampling algorithm to the recently developed semistochastic full configuration interaction quantum Monte Carlo (S-FCIQMC) method, a semistochastic implementation of the power method for projecting out the ground state energy in a basis of Slater determinants. Our new sampling method requires modest additional computational time and memory compared to uniform sampling but results in newly spawned weights that are approximately of the same magnitude, thereby greatly improving the efficiency of projection. A comparison in efficiency between our sampling algorithm and uniform sampling is performed on the all-electron nitrogen dimer at equilibrium in Dunnings cc-pVXZ basis sets with X ∈ {D, T, Q, 5}, demonstrating a large gain in efficiency that increases with basis set size. In addition, a comparison in efficiency is performed on three all-electron first-row dimers, B2, N2, and F2, in a cc-pVQZ basis, demonstrating that the gain in efficiency compared to uniform sampling also increases dramatically with the number of electrons.

Compiler Management of Communication and Parallelism for Quantum Computation

Quantum computing (QC) offers huge promise to accelerate a range of computationally intensive benchmarks. Quantum computing is limited, however, by the challenges of decoherence: i.e., a quantum state can only be maintained for short windows of time before it decoheres. While quantum error correction codes can protect against decoherence, fast execution time is the best defense against decoherence, so efficient architectures and effective scheduling algorithms are necessary. This paper proposes the Multi-SIMD QC architecture and then proposes and evaluates effective schedulers to map benchmark descriptions onto Multi-SIMD architectures. The Multi-SIMD model consists of a small number of SIMD regions, each of which may support operations on up to thousands of qubits per cycle. Efficient Multi-SIMD operation requires efficient scheduling. This work develops schedulers to reduce communication requirements of qubits between operating regions, while also improving parallelism.We find that communication to global memory is a dominant cost in QC. We also note that many quantum benchmarks have long serial operation paths (although each operation may be data parallel). To exploit this characteristic, we introduce Longest-Path-First Scheduling (LPFS) which pins operations to SIMD regions to keep data in-place and reduce communication to memory. The use of small, local scratchpad memories also further reduces communication. Our results show a 3% to 308% improvement for LPFS over conventional scheduling algorithms, and an additional 3% to 64% improvement using scratchpad memories. Our work is the most comprehensive software-to-quantum toolflow published to date, with efficient and practical scheduling techniques that reduce communication and increase parallelism for full-scale quantum code executing up to a trillion quantum gate operations.

Cheap and Near Exact CASSCF with Large Active Spaces

We use the recently developed Heat-bath Configuration Interaction (HCI) algorithm as an efficient active space solver to perform multiconfiguration self-consistent field calculations (HCISCF) with large active spaces. We give a detailed derivation of the theory and show that difficulties associated with non-variationality of the HCI procedure can be overcome by making use of the Lagrangian formulation to calculate the HCI relaxed two-body reduced density matrix. HCISCF is then used to study the electronic structure of butadiene, pentacene, and Fe-porphyrin. One of the most striking results of our work is that the converged active space orbitals obtained from HCISCF are relatively insensitive to the accuracy of the HCI calculation. This allows us to obtain nearly converged CASSCF energies with an estimated error of less than 1 mHa using the orbitals obtained from the HCISCF procedure in which the integral transformation is the dominant cost. For example, an HCISCF calculation on the Fe-porphyrin model complex with an active space of (44e, 44o) took only 412 s per iteration on a single node containing 28 cores, out of which 185 s was spent in the HCI calculation and the remaining 227 s was used mainly for integral transformation. Finally, we also show that active space orbitals can be optimized using HCISCF to substantially speed up the convergence of the HCI energy to the Full CI limit because HCI is not invariant to unitary transformations within the active space.

Excited states using semistochastic heat-bath configuration interaction

We extend our recently developed heat-bath configuration interaction (HCI) algorithm, and our semistochastic algorithm for performing multireference perturbation theory, to calculate excited-state wavefunctions and energies. We employ time-reversal symmetry, which reduces the memory requirements by more than a factor of two. An extrapolation technique is introduced to reliably extrapolate HCI energies to the full CI limit. The resulting algorithm is used to compute fourteen low-lying potential energy surfaces of the carbon dimer using the cc-pV5Z basis set, with an estimated error in energy of 30-50 μHa compared to full CI. The excitation energies obtained using our algorithm have a mean absolute deviation of 0.02 eV compared to experimental values.

Excited States of Methylene, Polyenes, and Ozone from Heat-Bath Configuration Interaction

The electronically excited states of methylene (CH2), ethylene (C2H4), butadiene (C4H6), hexatriene (C6H8), and ozone (O3) have long proven challenging due to their complex mixtures of static and dynamic correlations. The semistochastic heat-bath configuration interaction (SHCI) algorithm, which efficiently and systematically approaches the full configuration interaction (FCI) limit, is used to provide close approximations to the FCI energies in these systems. This article presents the largest FCI-level calculation to date on hexatriene, using a polarized double-ζ basis (ANO-L-pVDZ), which gives rise to a Hilbert space containing more than 1038 determinants. These calculations give vertical excitation energies of 5.58 and 5.59 eV, respectively, for the 21Ag and 11Bu states, showing that they are nearly degenerate. The same excitation energies in butadiene/ANO-L-pVDZ were found to be 6.58 and 6.45 eV. In addition to these benchmarks, our calculations strongly support the presence of a previously hypothesized ring-minimum species of ozone that lies 1.3 eV higher than the open-ring-minimum energy structure and is separated from it by a barrier of 1.11 eV.

Optimized surface code communication in superconducting quantum computers

Quantum computing (QC) is at the cusp of a revolution. Machines with 100 quantum bits (qubits) are anticipated to be operational by 2020 [30, 73], and several-hundred-qubit machines are around the corner. Machines of this scale have the capacity to demonstrate quantum supremacy, the tipping point where QC is faster than the fastest classical alternative for a particular problem. Because error correction techniques will be central to QC and will be the most expensive component of quantum computation, choosing the lowest-overhead error correction scheme is critical to overall QC success. This paper evaluates two established quantum error correction codes-planar and double-defect surface codes-using a set of compilation, scheduling and network simulation tools. In considering scalable methods for optimizing both codes, we do so in the context of a full microarchitectural and compiler analysis. Contrary to previous predictions, we find that the simpler planar codes are sometimes more favorable for implementation on superconducting quantum computers, especially under conditions of high communication congestion.CCS CONCEPTS• Hardware

Charm: a language for closed-form high-level architecture modeling

rightarrow