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:1805.07406 · The Journal of Chemical Physics

An efficient hybrid orbital representation for quantum Monte Carlo calculations

Ye Luo, Kenneth P. Esler, Paul R. C. Kent, Luke Shulenburger

Published Aug 28, 2018• 7 citations
arXivHTMLPDF

Abstract

The scale and complexity of the quantum system to which real-space quantum Monte Carlo (QMC) can be applied in part depends on the representation and memory usage of the trial wavefunction. B-splines, the computationally most efficient basis set, can have memory requirements exceeding the capacity of a single computational node. This situation has traditionally forced a difficult choice of either using slow internode communication or a potentially less accurate but smaller basis set such as Gaussians. Here, we introduce a hybrid representation of the single particle orbitals that combine a localized atomic basis set around atomic cores and B-splines in the interstitial regions to reduce the memory usage while retaining the high speed of evaluation and either retaining or increasing overall accuracy. We present a benchmark calculation for NiO demonstrating a superior accuracy while using only one eighth of the memory required for conventional B-splines. The hybrid orbital representation therefore expands the overall range of systems that can be practically studied with QMC.

DOI
10.1063/1.5037094

Related papers

Hybrid algorithms in quantum Monte Carlo

Jeongnim Kim, K. Esler, Jeremy McMinis +4 more

With advances in algorithms and growing computing powers, quantum Monte Carlo (QMC) methods have become a leading contender for high accuracy calculations for the electronic structure of realistic systems. The performance gain on recent HPC systems is largely driven by increasing parallelism: the number of compute cores of a SMP and the number of SMPs have been going up, as the Top500 list attests. However, the available memory as well as the communication and memory bandwidth per element has not kept pace with the increasing parallelism. This severely limits the applicability of QMC and the problem size it can handle. OpenMP/MPI hybrid programming provides applications with simple but effective solutions to overcome efficiency and scalability bottlenecks on large-scale clusters based on multi/many-core SMPs. We discuss the design and implementation of hybrid methods in QMCPACK and analyze its performance on current HPC platforms characterized by various memory and communication hierarchies.

Journal of Physics Conference Series•Dec 20, 2012•77 citations

Efficient localized basis set for quantum Monte Carlo calculations on condensed matter

Dario Alfè, Michael J. Gillan

We present an efficient scheme for representing many-body wave functions in quantum Monte Carlo (QMC) calculations. The scheme is based on $B$ splines (blip functions), which consist of localized cubic splines centered on the points of a regular grid. We show that blip functions are unbiased, systematically improvable, and conveniently obtained from any standard plane-wave density functional theory (PW-DFT) code, and therefore provide a convenient and natural interface between PW-DFT and QMC calculations. We present tests on a 16-atom system of $\mathrm{Si}$ in the $\ensuremath{\beta}$-tin structure, and on 2- and 8-atom systems of $\mathrm{MgO}$ in the $\mathrm{NaCl}$ structure. We show that already with such small systems the speed-up of blip functions with respect to plane waves is between one and two order of magnitudes, without compromising the accuracy.

arXiv:cond-mat/0407037•Physical Review B•Oct 11, 2004•155 citations

Quantum computing quantum Monte Carlo with hybrid tensor network for electronic structure calculations

Shu Kanno, Hajime Nakamura, T. Kobayashi +4 more

Abstract Quantum computers have a potential for solving quantum chemistry problems with higher accuracy than classical computers. Quantum computing quantum Monte Carlo (QC-QMC) is a QMC with a trial state prepared in quantum circuit, which is employed to obtain the ground state with higher accuracy than QMC alone. We propose an algorithm combining QC-QMC with a hybrid tensor network to extend the applicability of QC-QMC beyond a single quantum device size. In a two-layer quantum-quantum tree tensor, our algorithm for the larger trial wave function can be executed than preparable wave function in a device. Our algorithm is evaluated on the Heisenberg chain model, graphite-based Hubbard model, hydrogen plane model, and MonoArylBiImidazole using full configuration interaction QMC. Our algorithm can achieve energy accuracy (specifically, variance) several orders of magnitude higher than QMC, and the hybrid tensor version of QMC gives the same energy accuracy as QC-QMC when the system is appropriately decomposed. Moreover, we develop a pseudo-Hadamard test technique that enables efficient overlap calculations between a trial wave function and an orthonormal basis state. In a real device experiment by using the technique, we obtained almost the same accuracy as the statevector simulator, indicating the noise robustness of our algorithm. These results suggests that the present approach will pave the way to electronic structure calculation for large systems with high accuracy on current quantum devices.

arXiv:2303.18095•npj Quantum Information•Jun 6, 2024•20 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

Multideterminant Wave Functions in Quantum Monte Carlo

Miguel A. Morales, Jeremy McMinis, Bryan K. Clark +2 more

Quantum Monte Carlo (QMC) methods have received considerable attention over past decades due to their great promise for providing a direct solution to the many-body Schrodinger equation in electronic systems. Thanks to their low scaling with the number of particles, QMC methods present a compelling competitive alternative for the accurate study of large molecular systems and solid state calculations. In spite of such promise, the method has not permeated the quantum chemistry community broadly, mainly because of the fixed-node error, which can be large and whose control is difficult. In this Perspective, we present a systematic application of large scale multideterminant expansions in QMC and report on its impressive performance with first row dimers and the 55 molecules of the G1 test set. We demonstrate the potential of this strategy for systematically reducing the fixed-node error in the wave function and for achieving chemical accuracy in energy predictions. When compared to traditional quantum chemistry methods like MP2, CCSD(T), and various DFT approximations, the QMC results show a marked improvement over all of them. In fact, only the explicitly correlated CCSD(T) method with a large basis set produces more accurate results. Further developments in trial wave functions and algorithmic improvements appear promising for rendering QMC as the benchmark standard in large electronic systems.

arXiv:1303.6676•Journal of Chemical Theory and Computation•Jun 15, 2012•128 citations

A sparse algorithm for the evaluation of the local energy in quantum Monte Carlo

Alán Aspuru‐Guzik, Romelia Salomón–Ferrer, Brian M. Austin +1 more

A new algorithm is presented for the sparse representation and evaluation of Slater determinants in the quantum Monte Carlo (QMC) method. The approach, combined with the use of localized orbitals in a Slater-type orbital basis set, significantly extends the size molecule that can be treated with the QMC method. Application of the algorithm to systems containing up to 390 electrons confirms that the cost of evaluating the Slater determinant scales linearly with system size.

Journal of Computational Chemistry•Mar 10, 2005•27 citations
The scale and complexity of the quantum system to which real-space quantum Monte Carlo (QMC) can be applied in part depends on the representation and memory usage of the trial wavefunction. B-splines, the computationally most efficient basis set, can have memory requirements exceeding the capacity of a single computational node. This situation has traditionally forced a difficult choice of either using slow internode communication or a potentially less accurate but smaller basis set such as Gaussians. Here, we introduce a hybrid representation of the single particle orbitals that combine a localized atomic basis set around atomic cores and B-splines in the interstitial regions to reduce the memory usage while retaining the high speed of evaluation and either retaining or increasing overall accuracy. We present a benchmark calculation for NiO demonstrating a superior accuracy while using only one eighth of the memory required for conventional B-splines. The hybrid orbital representation therefore expands the overall range of systems that can be practically studied with QMC.
With advances in algorithms and growing computing powers, quantum Monte Carlo (QMC) methods have become a leading contender for high accuracy calculations for the electronic structure of realistic systems. The performance gain on recent HPC systems is largely driven by increasing parallelism: the number of compute cores of a SMP and the number of SMPs have been going up, as the Top500 list attests. However, the available memory as well as the communication and memory bandwidth per element has not kept pace with the increasing parallelism. This severely limits the applicability of QMC and the problem size it can handle. OpenMP/MPI hybrid programming provides applications with simple but effective solutions to overcome efficiency and scalability bottlenecks on large-scale clusters based on multi/many-core SMPs. We discuss the design and implementation of hybrid methods in QMCPACK and analyze its performance on current HPC platforms characterized by various memory and communication hierarchies.
We present an efficient scheme for representing many-body wave functions in quantum Monte Carlo (QMC) calculations. The scheme is based on BBB splines (blip functions), which consist of localized cubic splines centered on the points of a regular grid. We show that blip functions are unbiased, systematically improvable, and conveniently obtained from any standard plane-wave density functional theory (PW-DFT) code, and therefore provide a convenient and natural interface between PW-DFT and QMC calculations. We present tests on a 16-atom system of Si\mathrm{Si}Si in the $\ensuremath{\beta}$-tin structure, and on 2- and 8-atom systems of MgO\mathrm{MgO}MgO in the NaCl\mathrm{NaCl}NaCl structure. We show that already with such small systems the speed-up of blip functions with respect to plane waves is between one and two order of magnitudes, without compromising the accuracy.
Abstract Quantum computers have a potential for solving quantum chemistry problems with higher accuracy than classical computers. Quantum computing quantum Monte Carlo (QC-QMC) is a QMC with a trial state prepared in quantum circuit, which is employed to obtain the ground state with higher accuracy than QMC alone. We propose an algorithm combining QC-QMC with a hybrid tensor network to extend the applicability of QC-QMC beyond a single quantum device size. In a two-layer quantum-quantum tree tensor, our algorithm for the larger trial wave function can be executed than preparable wave function in a device. Our algorithm is evaluated on the Heisenberg chain model, graphite-based Hubbard model, hydrogen plane model, and MonoArylBiImidazole using full configuration interaction QMC. Our algorithm can achieve energy accuracy (specifically, variance) several orders of magnitude higher than QMC, and the hybrid tensor version of QMC gives the same energy accuracy as QC-QMC when the system is appropriately decomposed. Moreover, we develop a pseudo-Hadamard test technique that enables efficient overlap calculations between a trial wave function and an orthonormal basis state. In a real device experiment by using the technique, we obtained almost the same accuracy as the statevector simulator, indicating the noise robustness of our algorithm. These results suggests that the present approach will pave the way to electronic structure calculation for large systems with high accuracy on current quantum devices.
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.
Quantum Monte Carlo (QMC) methods have received considerable attention over past decades due to their great promise for providing a direct solution to the many-body Schrodinger equation in electronic systems. Thanks to their low scaling with the number of particles, QMC methods present a compelling competitive alternative for the accurate study of large molecular systems and solid state calculations. In spite of such promise, the method has not permeated the quantum chemistry community broadly, mainly because of the fixed-node error, which can be large and whose control is difficult. In this Perspective, we present a systematic application of large scale multideterminant expansions in QMC and report on its impressive performance with first row dimers and the 55 molecules of the G1 test set. We demonstrate the potential of this strategy for systematically reducing the fixed-node error in the wave function and for achieving chemical accuracy in energy predictions. When compared to traditional quantum chemistry methods like MP2, CCSD(T), and various DFT approximations, the QMC results show a marked improvement over all of them. In fact, only the explicitly correlated CCSD(T) method with a large basis set produces more accurate results. Further developments in trial wave functions and algorithmic improvements appear promising for rendering QMC as the benchmark standard in large electronic systems.