Srinivasan Sesha Iyengar
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Srinivasan Sesha Iyengar has a total of 80 co-authors. Here are the top co-authors by number of shared publications:
Gregory A. Voth
University of Utah Department of Chemistry and Center for Biophysical Modeling and Simulation 315 South 1400 East, Room 2020, Salt Lake City, Utah 84112-0850
9 shared publications- Isaiah Sumner
James Madison University
8 shared publications Timothy C. Ricard
Department of Chemistry, Department of Physics, and the Indiana University Quantum Science and Engineering Center (IU-QSEC), Indiana University, 800 E. Kirkwood Avenue, Bloomington, Indiana 47405, United States
8 shared publicationsH. Bernhard Schlegel
Wayne State University Department of Chemistry Detroit, Michigan 48202-3489
7 shared publicationsJunjie Li
Texas Advanced Computing Center, The University of Texas at Austin, Austin 78758, Texas, United States
7 shared publicationsMichael J. Frisch
Gaussian, Inc. , Wallingford, Connecticut 06492
7 shared publications
Latest Publications
- Open Access
- 14 October 2026
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 11 (4) , 045071
Half the interference, most of the answer: approximate quantum simulation via path-sum pruning
Classical simulation of quantum circuits is expensive for two distinct reasons. The obvious one is state-space size: an n -qubit system requires exponentially many amplitudes. The less obvious one is interference: useful output distributions emerge only after many computational histories have been coherently combined at common endpoints, and this aggregation step is itself a substantial source of cost. We introduce statistical interference sampling , a framework that makes this second bottleneck explicit by treating endpoint interference as a separately schedulable computation. Using the Chemical Abstract Machine as our model, weighted path contributions evolve as concurrent molecular species, and interference reactions combine contributions that share a common output state. A threshold rule terminates the process once an endpoint accumulates sufficient amplitude, discarding the remaining reactions. The method does not improve worst-case complexity and is not intended as a general-purpose simulator. Its purpose is to ask a more targeted question: how much of the interference calculation can be skipped while still recovering a useful output distribution? Across repeated independent executions at each threshold, we observe a circuit-dependent tradeoff among endpoint-interference work, task-level success, and distributional fidelity. We use Deutsch–Jozsa as a worked illustration and evaluate the method on Grover search, Simon’s problem, and Shor period-finding. We find that thresholding omits substantial endpoint-interference work while attaining high observed task success. An early-termination policy can attain 100% observed task success on several Grover, Simon, and Shor configurations while omitting up to 65% of the interference work. Circuits with strong amplitude separation, where a large gap exists between the amplitude accumulated at the correct endpoint and the maximum amplitude attainable at any incorrect endpoint, benefit most from thresholding; circuits with flatter output distributions, where valid outputs share comparable amplitudes across many endpoints rather than concentrating probability on a single marked state, are less amenable to this strategy. These results suggest that interference arithmetic is a structured resource that admits meaningful approximation, and that exposing it explicitly opens new opportunities for pruning strategies across path-sum, Pauli-path, and tensor-network simulation methods.
- 14 October 2026
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 11 (4) , 045071
Open AccessHalf the interference, most of the answer: approximate quantum simulation via path-sum pruning
Classical simulation of quantum circuits is expensive for two distinct reasons. The obvious one is state-space size: an n -qubit system requires exponentially many amplitudes. The less obvious one is interference: useful output distributions emerge only after many computational histories have been coherently combined at common endpoints, and this aggregation step is itself a substantial source of cost. We introduce statistical interference sampling , a framework that makes this second bottleneck explicit by treating endpoint interference as a separately schedulable computation. Using the Chemical Abstract Machine as our model, weighted path contributions evolve as concurrent molecular species, and interference reactions combine contributions that share a common output state. A threshold rule terminates the process once an endpoint accumulates sufficient amplitude, discarding the remaining reactions. The method does not improve worst-case complexity and is not intended as a general-purpose simulator. Its purpose is to ask a more targeted question: how much of the interference calculation can be skipped while still recovering a useful output distribution? Across repeated independent executions at each threshold, we observe a circuit-dependent tradeoff among endpoint-interference work, task-level success, and distributional fidelity. We use Deutsch–Jozsa as a worked illustration and evaluate the method on Grover search, Simon’s problem, and Shor period-finding. We find that thresholding omits substantial endpoint-interference work while attaining high observed task success. An early-termination policy can attain 100% observed task success on several Grover, Simon, and Shor configurations while omitting up to 65% of the interference work. Circuits with strong amplitude separation, where a large gap exists between the amplitude accumulated at the correct endpoint and the maximum amplitude attainable at any incorrect endpoint, benefit most from thresholding; circuits with flatter output distributions, where valid outputs share comparable amplitudes across many endpoints rather than concentrating probability on a single marked state, are less amenable to this strategy. These results suggest that interference arithmetic is a structured resource that admits meaningful approximation, and that exposing it explicitly opens new opportunities for pruning strategies across path-sum, Pauli-path, and tensor-network simulation methods.
- 10 March 2026
- Published by American Chemical Society (ACS) in The Journal of Physical Chemistry A
- Vol. 130 (12) , 2507-2522
Vibrational Properties of Hydroperoxyl Radical–Water Clusters Using Quantum Algorithms for Wavepacket Dynamics
We present the first quantum computing simulation of wavepacket dynamics in an HO2–water cluster. These systems are of great interest in atmospheric chemistry and, due to anharmonicity, can display multidimensional quantum nuclear effects arising from delocalized hydrogen bond networks. Here, we utilize the Quantum Shannon Decomposition (QSD) method to represent a quantum propagator for the nuclear degrees of freedom of the HO2 radical interacting with one and two water molecules, in the presence of an electronic potential energy surface, and in terms of the Ry, Rz, and CNOT quantum gates. The resultant time evolution of the quantum wavepacket, constructed by using the Qiskit quantum simulation tool, with a Python driver, yields a vibrational spectrum that is in very good agreement with the classically obtained result. The numerical demonstration here is restricted to one- and two-nuclear dimensions and hence is a proof of principle, but future implementations will include novel tensor network strategies to reduce quantum circuit depth and expand to higher dimensions.
- 10 March 2026
- Published by American Chemical Society (ACS) in The Journal of Physical Chemistry A
- Vol. 130 (12) , 2507-2522
Vibrational Properties of Hydroperoxyl Radical–Water Clusters Using Quantum Algorithms for Wavepacket Dynamics
We present the first quantum computing simulation of wavepacket dynamics in an HO2–water cluster. These systems are of great interest in atmospheric chemistry and, due to anharmonicity, can display multidimensional quantum nuclear effects arising from delocalized hydrogen bond networks. Here, we utilize the Quantum Shannon Decomposition (QSD) method to represent a quantum propagator for the nuclear degrees of freedom of the HO2 radical interacting with one and two water molecules, in the presence of an electronic potential energy surface, and in terms of the Ry, Rz, and CNOT quantum gates. The resultant time evolution of the quantum wavepacket, constructed by using the Qiskit quantum simulation tool, with a Python driver, yields a vibrational spectrum that is in very good agreement with the classically obtained result. The numerical demonstration here is restricted to one- and two-nuclear dimensions and hence is a proof of principle, but future implementations will include novel tensor network strategies to reduce quantum circuit depth and expand to higher dimensions.
- Open Access
- 22 January 2026
- Published by American Physical Society (APS) in Physical Review X
- Vol. 16 (1)
Large Language Model-Type Architecture for High-Dimensional Molecular Potential Energy Surfaces
Computing high-dimensional potential energy surfaces for molecular systems and materials is considered to be a great challenge in computational chemistry with potential impact in a range of areas including the fundamental prediction of reaction rates. In this paper, we design and discuss an algorithm that has similarities to large language models in generative AI and natural language processing. Specifically, we represent a molecular system as a graph which contains a set of nodes, edges, faces, etc. Interactions between these sets, which represent molecular subsystems in our case, are used to construct the potential energy surface for a reasonably sized chemical system with 51 nuclear dimensions. For this purpose, a family of neural networks that pertain to the graph-theoretically obtained subsystems get the job done for this 51 nuclear dimensional system. We then ask if this same family of lower-dimensional graph-based neural networks can be transformed to provide accurate predictions for a 186-dimensional potential energy surface. We find that our algorithm does provide accurate results for this larger-dimensional problem with sub-kcal/mol accuracy for the higher-dimensional potential energy surface problem. Indeed, as a result of these developments, here we produce efforts toward a full-dimensional potential energy surface for the protonated 21-water cluster (186 nuclear dimensions) at coupled-cluster single and double level accuracy.
- 22 January 2026
- Published by American Physical Society (APS) in Physical Review X
- Vol. 16 (1)
Open AccessLarge Language Model-Type Architecture for High-Dimensional Molecular Potential Energy Surfaces
Computing high-dimensional potential energy surfaces for molecular systems and materials is considered to be a great challenge in computational chemistry with potential impact in a range of areas including the fundamental prediction of reaction rates. In this paper, we design and discuss an algorithm that has similarities to large language models in generative AI and natural language processing. Specifically, we represent a molecular system as a graph which contains a set of nodes, edges, faces, etc. Interactions between these sets, which represent molecular subsystems in our case, are used to construct the potential energy surface for a reasonably sized chemical system with 51 nuclear dimensions. For this purpose, a family of neural networks that pertain to the graph-theoretically obtained subsystems get the job done for this 51 nuclear dimensional system. We then ask if this same family of lower-dimensional graph-based neural networks can be transformed to provide accurate predictions for a 186-dimensional potential energy surface. We find that our algorithm does provide accurate results for this larger-dimensional problem with sub-kcal/mol accuracy for the higher-dimensional potential energy surface problem. Indeed, as a result of these developments, here we produce efforts toward a full-dimensional potential energy surface for the protonated 21-water cluster (186 nuclear dimensions) at coupled-cluster single and double level accuracy.
- 2 April 2025
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 21 (8) , 3814-3831
Quantum Circuit and Mapping Algorithms for Wavepacket Dynamics: Case Study of Anharmonic Hydrogen Bonds in Protonated and Hydroxide Water Clusters
The accurate computational study of wavepacket nuclear dynamics is considered to be a classically intractable problem, particularly with increasing dimensions. Here, we present two algorithms that, in conjunction with other methods developed by us, may result in one set of contributions for performing quantum nuclear dynamics in arbitrary dimensions. For one of the two algorithms discussed here, we present a direct map between the Born-Oppenheimer Hamiltonian describing the nuclear wavepacket time evolution and the control parameters of a spin-lattice Hamiltonian that describes the dynamics of qubit states in an ion-trap quantum computer. This map is exact for three qubits, and when implemented, the dynamics of the spin states emulates those of the nuclear wavepacket in a continuous representation. However, this map becomes approximate as the number of qubits grows. In a second algorithm, we present a general quantum circuit decomposition formalism for such problems using a method called the Quantum Shannon Decomposition. This algorithm is more robust and is exact for any number of qubits at the cost of increased circuit complexity. The resultant circuit is implemented on IBM's quantum simulator (QASM) for 3-7 qubits, without using a noise model so as to test the intrinsic accuracy of the method. In both cases, the wavepacket dynamics is found to be in good agreement with the classical propagation result and the corresponding vibrational frequencies obtained from the wavepacket density time evolution are in agreement to within a few tenths of a wavenumber.
- 2 April 2025
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 21 (8) , 3814-3831
Quantum Circuit and Mapping Algorithms for Wavepacket Dynamics: Case Study of Anharmonic Hydrogen Bonds in Protonated and Hydroxide Water Clusters
The accurate computational study of wavepacket nuclear dynamics is considered to be a classically intractable problem, particularly with increasing dimensions. Here, we present two algorithms that, in conjunction with other methods developed by us, may result in one set of contributions for performing quantum nuclear dynamics in arbitrary dimensions. For one of the two algorithms discussed here, we present a direct map between the Born-Oppenheimer Hamiltonian describing the nuclear wavepacket time evolution and the control parameters of a spin-lattice Hamiltonian that describes the dynamics of qubit states in an ion-trap quantum computer. This map is exact for three qubits, and when implemented, the dynamics of the spin states emulates those of the nuclear wavepacket in a continuous representation. However, this map becomes approximate as the number of qubits grows. In a second algorithm, we present a general quantum circuit decomposition formalism for such problems using a method called the Quantum Shannon Decomposition. This algorithm is more robust and is exact for any number of qubits at the cost of increased circuit complexity. The resultant circuit is implemented on IBM's quantum simulator (QASM) for 3-7 qubits, without using a noise model so as to test the intrinsic accuracy of the method. In both cases, the wavepacket dynamics is found to be in good agreement with the classical propagation result and the corresponding vibrational frequencies obtained from the wavepacket density time evolution are in agreement to within a few tenths of a wavenumber.
- 16 October 2024
- Published by American Chemical Society (ACS) in Journal of the American Chemical Society
- Vol. 146 (43) , 29355-29363
Quantum Nuclear Dynamics on a Distributed Set of Ion-Trap Quantum Computing Systems
Quantum nuclear dynamics with wavepacket time evolution is classically intractable and viewed as a promising avenue for quantum information processing. Here, we use IonQ, Inc.'s 11-qubit trapped-ion quantum computer, Harmony, to study the quantum wavepacket dynamics of a shared-proton within a short-strong hydrogen-bonded system. We also provide the first application of distributed quantum computing for chemical dynamics problems, where a distributed set of quantum processes is constructed using a tensor network formalism. For a range of initial states, we experimentally drive the ion-trap system to emulate the quantum nuclear wavepacket as it evolves along the potential surface generated from the electronic structure. Following the experimental creation of the nuclear wavepacket, we extract measurement observables such as its time-dependent spatial projection and its characteristic vibrational frequencies to good agreement with classical results. Vibrational eigenenergies obtained from quantum computation are in agreement with those obtained from classical simulations to within a fraction of a kilocalorie per mole, thus suggesting chemical accuracy. Our approach opens a new paradigm for studying the quantum chemical dynamics and vibrational spectra of molecules and also provides the first demonstration of parallel quantum computation on a distributed set of ion-trap quantum computers.
- 16 October 2024
- Published by American Chemical Society (ACS) in Journal of the American Chemical Society
- Vol. 146 (43) , 29355-29363
Quantum Nuclear Dynamics on a Distributed Set of Ion-Trap Quantum Computing Systems
Quantum nuclear dynamics with wavepacket time evolution is classically intractable and viewed as a promising avenue for quantum information processing. Here, we use IonQ, Inc.'s 11-qubit trapped-ion quantum computer, Harmony, to study the quantum wavepacket dynamics of a shared-proton within a short-strong hydrogen-bonded system. We also provide the first application of distributed quantum computing for chemical dynamics problems, where a distributed set of quantum processes is constructed using a tensor network formalism. For a range of initial states, we experimentally drive the ion-trap system to emulate the quantum nuclear wavepacket as it evolves along the potential surface generated from the electronic structure. Following the experimental creation of the nuclear wavepacket, we extract measurement observables such as its time-dependent spatial projection and its characteristic vibrational frequencies to good agreement with classical results. Vibrational eigenenergies obtained from quantum computation are in agreement with those obtained from classical simulations to within a fraction of a kilocalorie per mole, thus suggesting chemical accuracy. Our approach opens a new paradigm for studying the quantum chemical dynamics and vibrational spectra of molecules and also provides the first demonstration of parallel quantum computation on a distributed set of ion-trap quantum computers.
- 5 August 2024
- Published by American Chemical Society (ACS) in The Journal of Physical Chemistry A
- Vol. 128 (32) , 6774-6797
Resource Optimization for Quantum Dynamics with Tensor Networks: Quantum and Classical Algorithms
The exponential scaling of the quantum degrees of freedom with the size of the system is one of the biggest challenges in computational chemistry and particularly in quantum dynamics. We present a tensor network approach for the time-evolution of the nuclear degrees of freedom of multiconfigurational chemical systems at a reduced storage and computational complexity. We also present quantum algorithms for the resultant dynamics. To preserve the compression advantage achieved via tensor network decompositions, we present an adaptive algorithm for the regularization of nonphysical bond dimensions, preventing the potentially exponential growth of these with time. While applicable to any quantum dynamical problem, our method is particularly valuable for dynamical simulations of nuclear chemical systems. Our algorithm is demonstrated using ab initio potentials obtained for a symmetric hydrogen-bonded system, namely, the protonated 2,2'-bipyridine, and compared to exact diagonalization numerical results.
- 5 August 2024
- Published by American Chemical Society (ACS) in The Journal of Physical Chemistry A
- Vol. 128 (32) , 6774-6797
Resource Optimization for Quantum Dynamics with Tensor Networks: Quantum and Classical Algorithms
The exponential scaling of the quantum degrees of freedom with the size of the system is one of the biggest challenges in computational chemistry and particularly in quantum dynamics. We present a tensor network approach for the time-evolution of the nuclear degrees of freedom of multiconfigurational chemical systems at a reduced storage and computational complexity. We also present quantum algorithms for the resultant dynamics. To preserve the compression advantage achieved via tensor network decompositions, we present an adaptive algorithm for the regularization of nonphysical bond dimensions, preventing the potentially exponential growth of these with time. While applicable to any quantum dynamical problem, our method is particularly valuable for dynamical simulations of nuclear chemical systems. Our algorithm is demonstrated using ab initio potentials obtained for a symmetric hydrogen-bonded system, namely, the protonated 2,2'-bipyridine, and compared to exact diagonalization numerical results.
- 1 July 2024
- Published by American Chemical Society (ACS) in The Journal of Physical Chemistry A
- Vol. 128 (27) , 5386-5397
Rare Events Sampling Methods for Quantum and Classical Ab Initio Molecular Dynamics
We provide an approach to sample rare events during classical ab initio molecular dynamics and quantum wavepacket dynamics. For classical AIMD, a set of fictitious degrees of freedom are introduced that may harmonically interact with the electronic and nuclear degrees of freedom to steer the dynamics in a conservative fashion toward energetically forbidden regions. A similar approach when introduced for quantum wavepacket dynamics has the effect of biasing the trajectory of the wavepacket centroid toward the regions of the potential surface that are difficult to sample. The approach is demonstrated for a phenol-amine system, which is a prototypical problem for condensed phase-proton transfer, and for model potentials undergoing wavepacket dynamics. In all cases, the approach yields trajectories that conserve energy while sampling rare events.
- 1 July 2024
- Published by American Chemical Society (ACS) in The Journal of Physical Chemistry A
- Vol. 128 (27) , 5386-5397
Rare Events Sampling Methods for Quantum and Classical Ab Initio Molecular Dynamics
We provide an approach to sample rare events during classical ab initio molecular dynamics and quantum wavepacket dynamics. For classical AIMD, a set of fictitious degrees of freedom are introduced that may harmonically interact with the electronic and nuclear degrees of freedom to steer the dynamics in a conservative fashion toward energetically forbidden regions. A similar approach when introduced for quantum wavepacket dynamics has the effect of biasing the trajectory of the wavepacket centroid toward the regions of the potential surface that are difficult to sample. The approach is demonstrated for a phenol-amine system, which is a prototypical problem for condensed phase-proton transfer, and for model potentials undergoing wavepacket dynamics. In all cases, the approach yields trajectories that conserve energy while sampling rare events.
- 5 January 2024
- Published by American Chemical Society (ACS) in The Journal of Physical Chemistry A
- Vol. 128 (2) , 466-478
Reformulation of All ONIOM-Type Molecular Fragmentation Approaches and Many-Body Theories Using Graph-Theory-Based Projection Operators: Applications to Dynamics, Molecular Potential Surfaces, Machine Learning, and Quantum Computing
We present a graph-theory-based reformulation of all ONIOM-based molecular fragmentation methods. We discuss applications to (a) accurate post-Hartree-Fock AIMD that can be conducted at DFT cost for medium-sized systems, (b) hybrid DFT condensed-phase studies at the cost of pure density functionals, (c) reduced cost on-the-fly large basis gas-phase AIMD and condensed-phase studies, (d) post-Hartree-Fock-level potential surfaces at DFT cost to obtain quantum nuclear effects, and (e) novel transfer machine learning protocols derived from these measures. Additionally, in previous work, the unifying strategy discussed here has been used to construct new quantum computing algorithms. Thus, we conclude that this reformulation is robust and accurate.
- 5 January 2024
- Published by American Chemical Society (ACS) in The Journal of Physical Chemistry A
- Vol. 128 (2) , 466-478
Reformulation of All ONIOM-Type Molecular Fragmentation Approaches and Many-Body Theories Using Graph-Theory-Based Projection Operators: Applications to Dynamics, Molecular Potential Surfaces, Machine Learning, and Quantum Computing
We present a graph-theory-based reformulation of all ONIOM-based molecular fragmentation methods. We discuss applications to (a) accurate post-Hartree-Fock AIMD that can be conducted at DFT cost for medium-sized systems, (b) hybrid DFT condensed-phase studies at the cost of pure density functionals, (c) reduced cost on-the-fly large basis gas-phase AIMD and condensed-phase studies, (d) post-Hartree-Fock-level potential surfaces at DFT cost to obtain quantum nuclear effects, and (e) novel transfer machine learning protocols derived from these measures. Additionally, in previous work, the unifying strategy discussed here has been used to construct new quantum computing algorithms. Thus, we conclude that this reformulation is robust and accurate.
- 29 November 2023
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 19 (23) , 8541-8556
Capturing Weak Interactions in Surface Adsorbate Systems at Coupled Cluster Accuracy: A Graph-Theoretic Molecular Fragmentation Approach Improved through Machine Learning
The accurate and efficient study of the interactions of organic matter with the surface of water is critical to a wide range of applications. For example, environmental studies have found that acidic polyfluorinated alkyl substances, especially perfluorooctanoic acid (PFOA), have spread throughout the environment and bioaccumulate into human populations residing near contaminated watersheds, leading to many systemic maladies. Thus, the study of the interactions of PFOA with water surfaces became important for the mitigation of their activity as pollutants and threats to public health. However, theoretical study of the interactions of such organic adsorbates on the surface of water, and their bulk concerted properties, often necessitates the use of ab initio methods to properly incorporate the long-range electronic properties that govern these extended systems. Notable theoretical treatments of "on-water" reactions thus far have employed hybrid DFT and semilocal DFT, but the interactions involved are weak interactions that may be best described using post-Hartree-Fock theory. Here, we aim to demonstrate the utility of a graph-theoretic approach to molecular fragmentation that accurately captures the critical "weak" interactions while maintaining an efficient ab initio treatment of the long-range periodic interactions that underpin the physics of extended systems. We apply this graph-theoretical treatment to study PFOA on the surface of water as a model system for the study of weak interactions seen in the wide range of surface interactions and reactions. The approach divides a system into a set of vertices, that are then connected through edges, faces, and higher order graph theoretic objects known as simplexes, to represent a collection of locally interacting subsystems. These subsystems are then used to construct ab initio molecular dynamics simulations and for computing multidimensional potential energy surfaces. To further improve the computational efficiency of our graph theoretic fragmentation method, we use a recently developed transfer learning protocol to construct the full system potential energy from a family of neural networks each designed to accurately model the behavior of individual simplexes. We use a unique multidimensional clustering algorithm, based on the k-means clustering methodology, to define our training space for each separate simplex. These models are used to extrapolate the energies for molecular dynamics trajectories at PFOA water interfaces, at less than one-tenth the cost as compared to a regular molecular fragmentation-based dynamics calculation with excellent agreement with couple cluster level of full system potential energies.
- 29 November 2023
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 19 (23) , 8541-8556
Capturing Weak Interactions in Surface Adsorbate Systems at Coupled Cluster Accuracy: A Graph-Theoretic Molecular Fragmentation Approach Improved through Machine Learning
The accurate and efficient study of the interactions of organic matter with the surface of water is critical to a wide range of applications. For example, environmental studies have found that acidic polyfluorinated alkyl substances, especially perfluorooctanoic acid (PFOA), have spread throughout the environment and bioaccumulate into human populations residing near contaminated watersheds, leading to many systemic maladies. Thus, the study of the interactions of PFOA with water surfaces became important for the mitigation of their activity as pollutants and threats to public health. However, theoretical study of the interactions of such organic adsorbates on the surface of water, and their bulk concerted properties, often necessitates the use of ab initio methods to properly incorporate the long-range electronic properties that govern these extended systems. Notable theoretical treatments of "on-water" reactions thus far have employed hybrid DFT and semilocal DFT, but the interactions involved are weak interactions that may be best described using post-Hartree-Fock theory. Here, we aim to demonstrate the utility of a graph-theoretic approach to molecular fragmentation that accurately captures the critical "weak" interactions while maintaining an efficient ab initio treatment of the long-range periodic interactions that underpin the physics of extended systems. We apply this graph-theoretical treatment to study PFOA on the surface of water as a model system for the study of weak interactions seen in the wide range of surface interactions and reactions. The approach divides a system into a set of vertices, that are then connected through edges, faces, and higher order graph theoretic objects known as simplexes, to represent a collection of locally interacting subsystems. These subsystems are then used to construct ab initio molecular dynamics simulations and for computing multidimensional potential energy surfaces. To further improve the computational efficiency of our graph theoretic fragmentation method, we use a recently developed transfer learning protocol to construct the full system potential energy from a family of neural networks each designed to accurately model the behavior of individual simplexes. We use a unique multidimensional clustering algorithm, based on the k-means clustering methodology, to define our training space for each separate simplex. These models are used to extrapolate the energies for molecular dynamics trajectories at PFOA water interfaces, at less than one-tenth the cost as compared to a regular molecular fragmentation-based dynamics calculation with excellent agreement with couple cluster level of full system potential energies.
- 31 October 2023
- Published by American Chemical Society (ACS) in The Journal of Physical Chemistry A
- Vol. 127 (44) , 9334-9345
Graph-|Q⟩⟨C|: A Quantum Algorithm with Reduced Quantum Circuit Depth for Electronic Structure
The accurate determination of chemical properties is known to have a critical impact on multiple fundamental chemical problems but is deeply hindered by the steep algebraic scaling of electron correlation calculations and the exponential scaling of quantum nuclear dynamics. With the advent of new quantum computing hardware and associated developments in creating new paradigms for quantum software, this avenue has been recognized as perhaps one way to address exponentially complex challenges in quantum chemistry and molecular dynamics. In this paper, we discuss a new approach to drastically reduce the quantum circuit depth (by several orders of magnitude) and help improve the accuracy in the quantum computation of electron correlation energies for large molecular systems. The method is derived from a graph-theoretic approach to molecular fragmentation and enables us to create a family of projection operators that decompose quantum circuits into separate unitary processes. Some of these processes can be treated on quantum hardware and others on classical hardware in a completely asynchronous and parallel fashion. Numerical benchmarks are provided through the computation of unitary coupled-cluster singles and doubles (UCCSD) energies for medium-sized protonated and neutral water clusters using the new quantum algorithms presented here.
- 31 October 2023
- Published by American Chemical Society (ACS) in The Journal of Physical Chemistry A
- Vol. 127 (44) , 9334-9345
Graph-|Q⟩⟨C|: A Quantum Algorithm with Reduced Quantum Circuit Depth for Electronic Structure
The accurate determination of chemical properties is known to have a critical impact on multiple fundamental chemical problems but is deeply hindered by the steep algebraic scaling of electron correlation calculations and the exponential scaling of quantum nuclear dynamics. With the advent of new quantum computing hardware and associated developments in creating new paradigms for quantum software, this avenue has been recognized as perhaps one way to address exponentially complex challenges in quantum chemistry and molecular dynamics. In this paper, we discuss a new approach to drastically reduce the quantum circuit depth (by several orders of magnitude) and help improve the accuracy in the quantum computation of electron correlation energies for large molecular systems. The method is derived from a graph-theoretic approach to molecular fragmentation and enables us to create a family of projection operators that decompose quantum circuits into separate unitary processes. Some of these processes can be treated on quantum hardware and others on classical hardware in a completely asynchronous and parallel fashion. Numerical benchmarks are provided through the computation of unitary coupled-cluster singles and doubles (UCCSD) energies for medium-sized protonated and neutral water clusters using the new quantum algorithms presented here.