Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2111.13655

ElVibRot-MPI: parallel quantum dynamics with Smolyak algorithm for general molecular simulation

Ahai Chen, André Nauts, David Lauvergnat

Published Nov 26, 2021• 9 citations
arXivHTMLPDF

Abstract

A parallelized quantum dynamics package using the Smolyak algorithm for general molecular simulation is introduced in this work. The program has no limitation of the Hamiltonian form and provides high flexibility on the simulation setup to adapt to different problems. Taking advantage of the Smolyak sparse grids formula, the simulation could be performed with high accuracy, and in the meantime, impressive parallel efficiency. The capability of the simulation could be up to tens of degrees of freedom. The implementation of the algorithm and the package usage are introduced, followed by typical examples and code test results.

DOI
10.48550/arxiv.2111.13655

Related papers

Unified MPI Parallelization of Wave Function Methods: iCIPT2 as a Showcase

Qingpeng Wang, Ning Zhang, Wenjian Liu

The integration of quantum chemical methods with high-performance computing is indispensable for handling large systems with modest accuracy or even small systems but with high accuracy. Continuing with the unified implementation of nonrelativistic and relativistic wave function methods within the MetaWave platform ( J. Phys. Chem. A 2025, 129, 5170), we present here a unified MPI parallelization of the methods by abstracting every computational step of a method as a dynamically scheduled loop via ghost process, followed by a global reduction of local results from each node. The algorithmic abstraction enables the use of a single MPI template in various steps of different methods. Taking iCIPT2 [ J. Chem. Theory Comput. 2021, 17, 949] as a showcase, the parallel efficiencies achieve 94% and 89% on 16 nodes (1024 cores) for the perturbation and whole calculations, respectively. Further combined with an improved algorithm for the matrix-vector product in the matrix diagonalization and an orbital-configuration-based semistochastic estimator for the perturbation correction, this renders large active space calculations possible, so as to obtain benchmarks for the automerization of cyclobutadiene, ground-state energy of benzene, and potential energy profile of ozone. It is also shown that the error of iCIPT2 follows a power law with respect to the number of configuration state functions.

arXiv:2602.04470•Journal of Chemical Theory and Computation•Mar 23, 2026•2 citations

Software for numerical simulations in the field of quantum technologies based on parallel programming

Hayk H. Adamyan, N. H. Adamyan, Narine Gevorgyan +2 more

We provide a software package for numerical simulations and modeling of complex quantum systems in the presence of dissipation and decoherence for a wider class of problems in the field of quantum technologies. This software is based on the method of quantum trajectories usually used for calculations of the density matrix. An important part of this Toolkit is the universal user interface, which is based on Tool Command Language (TCL) scripting language. It is elaborated in such a manner that the system description and system parameters should not be included in the source code. The core is implemented as a generic set of C++ classes, which can be efficiently reused for modeling of a wide range of photonic systems. The code has been written so as to facilitate optimization of the performance without breaking the object-orientedness of the design. We demonstrate that this software package is very useful for high performance parallel calculations on the Cluster.

Physics of Particles and Nuclei Letters•May 1, 2008•6 citations

Molecular Quantum Dynamics: A Quantum Computing Perspective

Pauline J. Ollitrault, Alexander Miessen, Ivano Tavernelli

ConspectusSimulating molecular dynamics (MD) within a comprehensive quantum framework has been a long-standing challenge in computational chemistry. An exponential scaling of computational cost renders solving the time dependent Schrödinger equation (TDSE) of a molecular Hamiltonian, including both electronic and nuclear degrees of freedom (DOFs), as well as their couplings, infeasible for more than a few DOFs. In the Born-Oppenheimer (BO), or adiabatic, picture, electronic and nuclear parts of the wave function are decoupled and treated separately. Within this framework, the nuclear wave function evolves along potential energy surfaces (PESs) computed as solutions to the electronic Schrödinger equation parametrized in the nuclear DOFs. This approximation, together with increasingly elaborate numerical approaches to solve the nuclear time dependent Schrödinger equation (TDSE), enabled the treatment of up to a few dozens of degrees of freedom (DOFs). However, for particular applications, such as photochemistry, the BO approximation breaks down. In this regime of non-adiabatic dynamics, solving the full molecular problem including electron-nuclear couplings becomes essential, further increasing the complexity of the numerical solution. Although valuable methods such as multiconfigurational time-dependent Hartree (MCTDH) have been proposed for the solution of the coupled electron-nuclear dynamics, they remain hampered by an exponential scaling in the number of nuclear DOFs and by the difficulty of finding universal variational forms.In this Account, we present a perspective on novel quantum computational algorithms, aiming to alleviate the exponential scaling inherent to the simulation of many-body quantum dynamics. In particular, we focus on the derivation and application of quantum algorithms for adiabatic and non-adiabatic quantum dynamics, which include efficient approaches for the calculation of the BO potential energy surfaces (PESs). Thereafter, we study the time-evolution of a model system consisting of two coupled PESs in first and second quantization. In a first application, we discuss a recently introduced quantum algorithm for the evolution of a wavepacket in first quantization and exploit the potential quantum advantage of mapping its spatial grid representation to logarithmically many qubits. For the second demonstration, we move to the second quantization framework and review the scaling properties of two alternative time-evolution algorithms, namely, a variational quantum algorithm (VQA) (based on the McLachlan variational principle) and conventional Trotter-type evolution (based on a Lie-Trotter-Suzuki formula). Both methods clearly demonstrate the potential of quantum algorithms and their favorable scaling compared to the available classical approaches. However, a clear demonstration of quantum advantage in the context of molecular quantum dynamics may require the implementation of these algorithms in fault-tolerant quantum computers, while their application in near-term, noisy quantum devices is still unclear and deserves further investigation.

Accounts of Chemical Research•Nov 17, 2021•127 citations

Parallel quantum computer simulation on the GPU

Andrei Amariutei, Simona Caraiman

Simulation of quantum computers using classical computers is a hard problem with high memory and computational requirements. Parallelization can alleviate this problem, allowing the simulation of more qubits at the same time or the same number of qubits to be simulated in less time. A promising approach is to exploit the high performance computing capabilities provided by the latest graphical processing units. In this paper we present a parallel implementation of the QC-lib quantum computer simulator on the GPU using the CUDA programming model. The proposed scheme for partitioning the terms that describe the state of a quantum register takes advantage of the specific characteristics of the CUDA memory spaces and allows for an efficient parallelization of the general singe qubit operator. Experimental results indicate that very good speed-ups can be obtained in contrast with the sequential implementation.

•Nov 28, 2011•17 citations

Implementation Possibility of Quantum Simulation for Quantum Molecular Dynamics

Xingyu Zhang, Weijia Guo, Jinke Yu +1 more

In this work, we explore the implementation possibility of quantum simulation for quantum molecular dynamics, in particular for reaction dynamics, though several implementations have already reported through quantum-classical mixed simulations ({\it Acc. Chem. Res.} {\bf 54} (2021), 4229 and {\it J. Phys. Chem. Lett.} {\bf xx} (2026), XXXX). To analyze this aspect, we examine (1) the conjugacy relation between quantum simulator and the target molecular system, (2) the wave function correspondence in quantum algorithm and classical algorithm for multi-dimensional dynamics, (3) problems arisen from real-valued classical algorithms, and finally (4) geometric phase arisen from the separation among the degrees of freedom (DOFs). As is well known, the aforementioned first and second points play fundamental roles in quantum simulation of quantum many-body systems, and the third and fourth points are theoretical issues that might introduce problems in classical and quantum computing. In this work, we mainly focus on the third and fourth points by analysis of the first two points by reviewing previously reported quantum-classical mixed implementations of quantum simulation. We also consider gauge freedom in high-dimensional quantum molecular dynamics that has been introduced recently, and then discuss possibility of advantages and disadvantages of quantum simulation for molecular reaction dynamics.

physics.chem-phCross-listedarXiv:2608.17261•Aug 19, 2026•0 citations

Quantum Monte Carlo for large chemical systems: Implementing efficient strategies for petascale platforms and beyond

Anthony Scemama, Michel Caffarel, Emmanuel Oseret +1 more

Various strategies to implement efficiently quantum Monte Carlo (QMC) simulations for large chemical systems are presented. These include: (i) the introduction of an efficient algorithm to calculate the computationally expensive Slater matrices. This novel scheme is based on the use of the highly localized character of atomic Gaussian basis functions (not the molecular orbitals as usually done), (ii) the possibility of keeping the memory footprint minimal, (iii) the important enhancement of single-core performance when efficient optimization tools are used, and (iv) the definition of a universal, dynamic, fault-tolerant, and load-balanced framework adapted to all kinds of computational platforms (massively parallel machines, clusters, or distributed grids). These strategies have been implemented in the QMC=Chem code developed at Toulouse and illustrated with numerical applications on small peptides of increasing sizes (158, 434, 1056, and 1731 electrons). Using 10-80 k computing cores of the Curie machine (GENCI-TGCC-CEA, France), QMC=Chem has been shown to be capable of running at the petascale level, thus demonstrating that for this machine a large part of the peak performance can be achieved. Implementation of large-scale QMC simulations for future exascale platforms with a comparable level of efficiency is expected to be feasible.

arXiv:1209.6630•Journal of Computational Chemistry•Jan 3, 2013•36 citations
A parallelized quantum dynamics package using the Smolyak algorithm for general molecular simulation is introduced in this work. The program has no limitation of the Hamiltonian form and provides high flexibility on the simulation setup to adapt to different problems. Taking advantage of the Smolyak sparse grids formula, the simulation could be performed with high accuracy, and in the meantime, impressive parallel efficiency. The capability of the simulation could be up to tens of degrees of freedom. The implementation of the algorithm and the package usage are introduced, followed by typical examples and code test results.
The integration of quantum chemical methods with high-performance computing is indispensable for handling large systems with modest accuracy or even small systems but with high accuracy. Continuing with the unified implementation of nonrelativistic and relativistic wave function methods within the MetaWave platform ( J. Phys. Chem. A 2025, 129, 5170), we present here a unified MPI parallelization of the methods by abstracting every computational step of a method as a dynamically scheduled loop via ghost process, followed by a global reduction of local results from each node. The algorithmic abstraction enables the use of a single MPI template in various steps of different methods. Taking iCIPT2 [ J. Chem. Theory Comput. 2021, 17, 949] as a showcase, the parallel efficiencies achieve 94% and 89% on 16 nodes (1024 cores) for the perturbation and whole calculations, respectively. Further combined with an improved algorithm for the matrix-vector product in the matrix diagonalization and an orbital-configuration-based semistochastic estimator for the perturbation correction, this renders large active space calculations possible, so as to obtain benchmarks for the automerization of cyclobutadiene, ground-state energy of benzene, and potential energy profile of ozone. It is also shown that the error of iCIPT2 follows a power law with respect to the number of configuration state functions.
We provide a software package for numerical simulations and modeling of complex quantum systems in the presence of dissipation and decoherence for a wider class of problems in the field of quantum technologies. This software is based on the method of quantum trajectories usually used for calculations of the density matrix. An important part of this Toolkit is the universal user interface, which is based on Tool Command Language (TCL) scripting language. It is elaborated in such a manner that the system description and system parameters should not be included in the source code. The core is implemented as a generic set of C++ classes, which can be efficiently reused for modeling of a wide range of photonic systems. The code has been written so as to facilitate optimization of the performance without breaking the object-orientedness of the design. We demonstrate that this software package is very useful for high performance parallel calculations on the Cluster.
ConspectusSimulating molecular dynamics (MD) within a comprehensive quantum framework has been a long-standing challenge in computational chemistry. An exponential scaling of computational cost renders solving the time dependent Schrödinger equation (TDSE) of a molecular Hamiltonian, including both electronic and nuclear degrees of freedom (DOFs), as well as their couplings, infeasible for more than a few DOFs. In the Born-Oppenheimer (BO), or adiabatic, picture, electronic and nuclear parts of the wave function are decoupled and treated separately. Within this framework, the nuclear wave function evolves along potential energy surfaces (PESs) computed as solutions to the electronic Schrödinger equation parametrized in the nuclear DOFs. This approximation, together with increasingly elaborate numerical approaches to solve the nuclear time dependent Schrödinger equation (TDSE), enabled the treatment of up to a few dozens of degrees of freedom (DOFs). However, for particular applications, such as photochemistry, the BO approximation breaks down. In this regime of non-adiabatic dynamics, solving the full molecular problem including electron-nuclear couplings becomes essential, further increasing the complexity of the numerical solution. Although valuable methods such as multiconfigurational time-dependent Hartree (MCTDH) have been proposed for the solution of the coupled electron-nuclear dynamics, they remain hampered by an exponential scaling in the number of nuclear DOFs and by the difficulty of finding universal variational forms.In this Account, we present a perspective on novel quantum computational algorithms, aiming to alleviate the exponential scaling inherent to the simulation of many-body quantum dynamics. In particular, we focus on the derivation and application of quantum algorithms for adiabatic and non-adiabatic quantum dynamics, which include efficient approaches for the calculation of the BO potential energy surfaces (PESs). Thereafter, we study the time-evolution of a model system consisting of two coupled PESs in first and second quantization. In a first application, we discuss a recently introduced quantum algorithm for the evolution of a wavepacket in first quantization and exploit the potential quantum advantage of mapping its spatial grid representation to logarithmically many qubits. For the second demonstration, we move to the second quantization framework and review the scaling properties of two alternative time-evolution algorithms, namely, a variational quantum algorithm (VQA) (based on the McLachlan variational principle) and conventional Trotter-type evolution (based on a Lie-Trotter-Suzuki formula). Both methods clearly demonstrate the potential of quantum algorithms and their favorable scaling compared to the available classical approaches. However, a clear demonstration of quantum advantage in the context of molecular quantum dynamics may require the implementation of these algorithms in fault-tolerant quantum computers, while their application in near-term, noisy quantum devices is still unclear and deserves further investigation.
Simulation of quantum computers using classical computers is a hard problem with high memory and computational requirements. Parallelization can alleviate this problem, allowing the simulation of more qubits at the same time or the same number of qubits to be simulated in less time. A promising approach is to exploit the high performance computing capabilities provided by the latest graphical processing units. In this paper we present a parallel implementation of the QC-lib quantum computer simulator on the GPU using the CUDA programming model. The proposed scheme for partitioning the terms that describe the state of a quantum register takes advantage of the specific characteristics of the CUDA memory spaces and allows for an efficient parallelization of the general singe qubit operator. Experimental results indicate that very good speed-ups can be obtained in contrast with the sequential implementation.
In this work, we explore the implementation possibility of quantum simulation for quantum molecular dynamics, in particular for reaction dynamics, though several implementations have already reported through quantum-classical mixed simulations ({\it Acc. Chem. Res.} {\bf 54} (2021), 4229 and {\it J. Phys. Chem. Lett.} {\bf xx} (2026), XXXX). To analyze this aspect, we examine (1) the conjugacy relation between quantum simulator and the target molecular system, (2) the wave function correspondence in quantum algorithm and classical algorithm for multi-dimensional dynamics, (3) problems arisen from real-valued classical algorithms, and finally (4) geometric phase arisen from the separation among the degrees of freedom (DOFs). As is well known, the aforementioned first and second points play fundamental roles in quantum simulation of quantum many-body systems, and the third and fourth points are theoretical issues that might introduce problems in classical and quantum computing. In this work, we mainly focus on the third and fourth points by analysis of the first two points by reviewing previously reported quantum-classical mixed implementations of quantum simulation. We also consider gauge freedom in high-dimensional quantum molecular dynamics that has been introduced recently, and then discuss possibility of advantages and disadvantages of quantum simulation for molecular reaction dynamics.
Various strategies to implement efficiently quantum Monte Carlo (QMC) simulations for large chemical systems are presented. These include: (i) the introduction of an efficient algorithm to calculate the computationally expensive Slater matrices. This novel scheme is based on the use of the highly localized character of atomic Gaussian basis functions (not the molecular orbitals as usually done), (ii) the possibility of keeping the memory footprint minimal, (iii) the important enhancement of single-core performance when efficient optimization tools are used, and (iv) the definition of a universal, dynamic, fault-tolerant, and load-balanced framework adapted to all kinds of computational platforms (massively parallel machines, clusters, or distributed grids). These strategies have been implemented in the QMC=Chem code developed at Toulouse and illustrated with numerical applications on small peptides of increasing sizes (158, 434, 1056, and 1731 electrons). Using 10-80 k computing cores of the Curie machine (GENCI-TGCC-CEA, France), QMC=Chem has been shown to be capable of running at the petascale level, thus demonstrating that for this machine a large part of the peak performance can be achieved. Implementation of large-scale QMC simulations for future exascale platforms with a comparable level of efficiency is expected to be feasible.