arXiv subjects

Lee Huntington

Publications and source records attributed to Lee Huntington.

6 recordsLinked to original sources

arXiv2024

Parallel implementation of the Density Matrix Renormalization Group method achieving a quarter petaFLOPS performance on a single DGX-H100 GPU node

We report cutting edge performance results for a hybrid CPU-multi GPU implementation of the spin adapted ab initio Density Matrix Renormalization Group (DMRG) method on current state-of-the-art NVIDIA DGX-H100 architectures. We evaluate the performance of the DMRG electronic structure calculations for the active compounds of the FeMoco and cytochrome P450 (CYP) enzymes with complete active space (CAS) sizes of up to 113 electrons in 76 orbitals [CAS(113, 76)] and 63 electrons in 58 orbitals [CAS(63, 58)], respectively. We achieve 246 teraFLOPS of sustained performance, an improvement of more than 2.5x compared to the performance achieved on the DGX-A100 architectures and an 80x acceleration compared to an OpenMP parallelized implementation on a 128-core CPU architecture. Our work highlights the ability of tensor network algorithms to efficiently utilize high-performance GPU hardware and shows that the combination of tensor networks with modern large-scale GPU accelerators can pave the way towards solving some of the most challenging problems in quantum chemistry and beyond.

physics.chem-ph↗

arXiv2023

Massively parallel quantum chemistry: PFAS on over 1 million cloud vCPUs

Accurate solutions to the electronic Schrödinger equation can provide valuable insight for electron interactions within molecular systems, accelerating the molecular design and discovery processes in many different applications. However, the availability of such accurate solutions are limited to small molecular systems due to both the extremely high computational complexity and the challenge of operating and executing these workloads on high-performance compute clusters. This work presents a massively scalable cloud-based quantum chemistry platform by implementing a highly parallelizable quantum chemistry method that provides a polynomial-scaling approximation to full configuration interaction (FCI). Our platform orchestrates more than one million virtual CPUs on the cloud to analyze the bond-breaking behaviour of carbon-fluoride bonds of per- and polyfluoroalkyl substances (PFAS) with near-exact accuracy within the chosen basis set. This is the first quantum chemistry calculation utilizing more than one million virtual CPUs on the cloud and is the most accurate electronic structure computation of PFAS bond breaking to date.

physics.chem-ph↗

arXiv2022

Tangelo: An Open-source Python Package for End-to-end Chemistry Workflows on Quantum Computers

Tangelo [link: https://github.com/goodchemistryco/Tangelo] is an open-source Python software package for the development of end-to-end chemistry workflows on quantum computers, released under Apache 2.0 license. It aims to support the design of successful experiments on quantum hardware, and to facilitate advances in quantum algorithm development. The software enables quick exploration of different approaches by assembling reusable building blocks and algorithms, with the flexibility to let users introduce their own. Tangelo is backend-agnostic and enables switching between various backends (Braket, Qiskit, Qulacs, Azure Quantum, QDK, Cirq...) with minimal changes in the code. The package can be used to explore quantum computing applications such as open-shell systems, excited states, or more industrially-relevant systems by leveraging problem decomposition at scale. This paper outlines the design choices, philosophy, and main features of Tangelo.

quant-ph↗

arXiv2021

Optimizing Electronic Structure Simulations on a Trapped-ion Quantum Computer using Problem Decomposition

Quantum computers have the potential to advance material design and drug discovery by performing costly electronic structure calculations. A critical aspect of this application requires optimizing the limited resources of the quantum hardware. Here, we experimentally demonstrate an end-to-end pipeline that focuses on minimizing quantum resources while maintaining accuracy. Using density matrix embedding theory as a problem decomposition technique, and an ion-trap quantum computer, we simulate a ring of 10 hydrogen atoms without freezing any electrons. The originally 20-qubit system is decomposed into 10 two-qubit problems, making it amenable to currently available hardware. Combining this decomposition with a qubit coupled cluster circuit ansatz, circuit optimization, and density matrix purification, we accurately reproduce the potential energy curve in agreement with the full configuration interaction energy in the minimal basis set. Our experimental results are an early demonstration of the potential for problem decomposition to accurately simulate large molecules on quantum hardware.

quant-ph↗

arXiv2021

Scaling Up Electronic Structure Calculations on Quantum Computers: The Frozen Natural Orbital Based Method of Increments

The method of increments and frozen natural orbital (MI-FNO) framework is introduced to help expedite the application of noisy, intermediate-scale quantum~(NISQ) devices for quantum chemistry simulations. The MI-FNO framework provides a systematic reduction of the occupied and virtual orbital spaces for quantum chemistry simulations. The correlation energies of the resulting increments from the MI-FNO reduction can then be solved by various algorithms, including quantum algorithms such as the phase estimation algorithm and the variational quantum eigensolver (VQE). The unitary coupled-cluster singles and doubles VQE framework is used to obtain correlation energies for the case of small molecules (i.e., BeH$_2$, CH$_4$, NH$_3$, H$_2$O, and HF) using the cc-pVDZ basis set. The quantum resource requirements are estimated for a constrained geometry complex (CGC) catalyst that is utilized in industrial settings for the polymerization of $α$-olefins. We show that the MI-FNO approach provides a significant reduction in the qubit requirements relative to the full system simulations. We propose that the MI-FNO framework can create scalable examples of quantum chemistry problems that are appropriate for assessing the progress of NISQ devices.

quant-ph↗

arXiv2019

VanQver: The Variational and Adiabatically Navigated Quantum Eigensolver

The accelerated progress in manufacturing noisy intermediate-scale quantum (NISQ) computing hardware has opened the possibility of exploring its application in transforming approaches to solving computationally challenging problems. The important limitations common among all NISQ computing technologies are the absence of error correction and the short coherence time, which limit the computational power of these systems. Shortening the required time of a single run of a quantum algorithm is essential for reducing environment-induced errors and for the efficiency of the computation. We have investigated the ability of a variational version of adiabatic quantum computation (AQC) to generate an accurate state more efficiently compared to existing adiabatic methods. The standard AQC method uses a time-dependent Hamiltonian, connecting the initial Hamiltonian with the final Hamiltonian. In the current approach, a navigator Hamiltonian is introduced which has a non-zero amplitude only in the middle of the annealing process. Both the initial and navigator Hamiltonians are determined using variational methods. A hermitian cluster operator, inspired by coupled-cluster theory and truncated to single and double excitations/de-excitations, is used as a navigator Hamiltonian. A comparative study of our variational algorithm (VanQver) with that of standard AQC, starting with a Hartree--Fock Hamiltonian, is presented. The results indicate that the introduction of the navigator Hamiltonian significantly improves the annealing time required to achieve chemical accuracy by two to three orders of magnitude. The efficiency of the method is demonstrated in the ground-state energy estimation of molecular systems, namely, H$_2$, P4, and LiH.

quant-ph↗