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:2303.18095 · npj Quantum Information

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

Shu Kanno, Hajime Nakamura, T. Kobayashi, Shigeki Gocho, Miho Hatanaka, Naoki Yamamoto, Qi Gao

Published Jun 6, 2024• 20 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1038/s41534-024-00851-8

Related papers

Quantum computing quantum Monte Carlo algorithm

Yukun Zhang, Yifei Huang, Jinzhao Sun +2 more

Quantum computing and quantum Monte Carlo (QMC) are respectively the state-of-the-art quantum and classical computing methods for understanding many-body quantum systems. Here, we propose a hybrid quantum-classical algorithm that integrates these two methods, inheriting their distinct features in efficient representation and manipulation of quantum states and overcoming their limitations. We first introduce non-stoquasticity indicators (NSIs) and their upper bounds, which measure the sign problem, the most notable limitation of QMC. We show that our algorithm could greatly mitigate the sign problem, which decreases NSIs with the assistance of quantum computing. Meanwhile, the use of quantum Monte Carlo also increases the expressivity of shallow quantum circuits, allowing more accurate computation that is conventionally achievable only with much deeper circuits. We numerically test and verify the method for the N$_2$ molecule (12 qubits) and the Hubbard model (16 qubits). Our work paves the way to solving practical problems with intermediate-scale and early-fault tolerant quantum computers, with potential applications in chemistry, condensed matter physics, materials, high energy physics, etc.

arXiv:2206.10431•Physical Review A•Jul 21, 2025•11 citations

Quantum Computing Approach to Fixed-Node Monte Carlo Using Classical Shadows

Nick S. Blunt, Laura Caune, Javiera Quiroz-Fernandez

High Resolution Image Download MS PowerPoint Slide Quantum Monte Carlo (QMC) methods are powerful approaches for solving electronic structure problems. Although they often provide high-accuracy solutions, the precision of most QMC methods is ultimately limited by the trial wave function that must be used. Recently, an approach has been demonstrated to allow the use of trial wave functions prepared on a quantum computer [Huggins et al., Unbiasing fermionic quantum Monte Carlo with a quantum computer. Nature 2022, 603, 416] in the auxiliary-field QMC (AFQMC) method using classical shadows to estimate the required overlaps. However, this approach has an exponential post-processing step to construct these overlaps when performing classical shadows obtained using random Clifford circuits. Here, we study an approach to avoid this exponential scaling step by using a fixed-node Monte Carlo method based on full configuration interaction quantum Monte Carlo. This method is applied to the local unitary cluster Jastrow ansatz. We consider H 4, ferrocene, and benzene molecules using up to 12 qubits as examples. Circuits are compiled to native gates for typical near-term architectures, and we assess the impact of circuit-level depolarizing noise on the method. We also provide a comparison of AFQMC and fixed-node approaches, demonstrating that AFQMC is more robust to errors, although extrapolations of the fixed-node energy reduce this discrepancy. Although the method can be used to reach chemical accuracy, the sampling cost to achieve this is high even for small active spaces, suggesting caution about the prospect of outperforming conventional QMC approaches.

arXiv:2410.18901•Journal of Chemical Theory and Computation•Feb 5, 2025•3 citations

Electronic structure quantum Monte Carlo

Michal Bajdich, Luboš Mitáš

Electronic structure quantum Monte Carlo Quantum Monte Carlo (QMC) is an advanced simulation methodology for studies of manybody quantum systems. The QMC approaches combine analytical insights with stochastic computational techniques for efficient solution of several classes of important many-body problems such as the stationary Schrödinger equation. QMC methods of various flavors have been applied to a great variety of systems spanning continuous and lattice quantum models, molecular and condensed systems, BEC-BCS ultracold condensates, nuclei, etc. In this review, we focus on the electronic structure QMC, i.e., methods relevant for systems described by the electron-ion Hamiltonians. Some of the key QMC achievements include direct treatment of electron correlation, accuracy in predicting energy differences and favorable scaling in the system size. Calculations of atoms, molecules, clusters and solids have demonstrated QMC applicability to real systems with hundreds of electrons while providing 90-95% of the correlation energy and energy differences typically within a few percent of experiments. Advances in accuracy beyond these limits are hampered by the so-called fixed-node approximation which is used to circumvent the notorious fermion sign problem. Many-body nodes of fermion states and their properties have therefore become one of the important topics for further progress in predictive power and efficiency of QMC calculations. Some of our recent results on the wave function nodes and related nodal domain topologies will be briefly reviewed. This includes analysis of few-electron systems and descriptions of exact and approximate nodes using transformations and projections of the highly-dimensional nodal hypersurfaces into the 3D space. Studies of fermion nodes offer new insights into topological properties of eigenstates such as explicit demonstrations that generic fermionic ground states exhibit the minimal number of two nodal domains. Recently proposed trial wave functions based on Pfaffians with pairing orbitals are presented and their nodal properties are tested in calculations of first row atoms and molecules. Finally, backflow "dressed" coordinates are introduced as another possibility for capturing correlation effects and for decreasing the fixed-node bias.

arXiv:1008.2369•Acta Physica Slovaca Reviews and Tutorials•Apr 1, 2009•33 citations

Unbiasing fermionic quantum Monte Carlo with a quantum computer

William J. Huggins, Bryan O’Gorman, Nicholas C. Rubin +3 more

Abstract Interacting many-electron problems pose some of the greatest computational challenges in science, with essential applications across many fields. The solutions to these problems will offer accurate predictions of chemical reactivity and kinetics, and other properties of quantum systems 1–4 . Fermionic quantum Monte Carlo (QMC) methods 5,6 , which use a statistical sampling of the ground state, are among the most powerful approaches to these problems. Controlling the fermionic sign problem with constraints ensures the efficiency of QMC at the expense of potentially significant biases owing to the limited flexibility of classical computation. Here we propose an approach that combines constrained QMC with quantum computation to reduce such biases. We implement our scheme experimentally using up to 16 qubits to unbias constrained QMC calculations performed on chemical systems with as many as 120 orbitals. These experiments represent the largest chemistry simulations performed with the help of quantum computers, while achieving accuracy that is competitive with state-of-the-art classical methods without burdensome error mitigation. Compared with the popular variational quantum eigensolver 7,8 , our hybrid quantum-classical computational model offers an alternative path towards achieving a practical quantum advantage for the electronic structure problem without demanding exceedingly accurate preparation and measurement of the ground-state wavefunction.

arXiv:2106.16235•Nature•Mar 16, 2022•196 citations

High-accuracy electronic structure quantum Monte Carlo for molecular systems

Tommaso Torelli

Quantum Monte Carlo (QMC) is one of the most promising methods for solving quantum many-body problems. QMC combines known analytical properties of wave functions, results from other methods, and stochastic techniques, into a powerful tool for investigation of the electronic structure of real materials. Furthermore, the method has a favorable scaling ( O[N3] in the number of electrons), perfect scalability on parallel architectures, and can be applied to a wide range of systems. Our work has focused both on expanding the capabilities of QMC for calculation of quantities beyond energies, such as interatomic forces, and on application of the method to challenging problems in nanostructure materials research. For the calculation of interatomic forces we have implemented a finite difference correlated sampling method. The correlated sampling enables us to avoid the problem of statistical noise in evaluating the energy differences and allows us to obtain forces with an average 1% error. We have analyzed the effect of the method's main approximations on the estimate of the forces, both by theoretical arguments and by performing a variety of tests on small systems. Furthermore, we have used this newly developed method for estimating equilibrium geometries in a problem where other methods have failed. QMC enabled us to treat the electron correlation effects with high accuracy and to provide accurate predictions in a number of interesting applications. In particular, for carbon rings of C4N+2 stoichiometry we have resolved a long-standing problem regarding the competition between the aromaticity and second order Jahn-Teller effects. We have found that the dominant mechanism at small and intermediate sizes, which stabilizes the bond angle and bond length alternated geometries, is the secondorder Jahn-Teller effect while the aromatic isomer is always found to be a transition state. These high accuracy calculations which have involved multi-reference wave functions, extensive variational optimizations, and the use of massively parallel platforms demonstrate clearly the unique capabilities of the QMC approach.

•Jun 1, 2001•0 citations

Evaluating a quantum-classical quantum Monte Carlo algorithm with Matchgate shadows

Benchen Huang, Yi-Ting Chen, Brajesh Gupt +4 more

Solving the electronic structure problem of molecules and solids to high accuracy is a major challenge in quantum chemistry and condensed matter physics. The rapid emergence and development of quantum computers offer a promising route to systematically tackle this problem. Recent work by [Huggins , ] proposed a hybrid quantum-classical quantum Monte Carlo (QC-QMC) algorithm using Clifford shadows to determine the ground state of a Fermionic Hamiltonian. This approach displayed inherent noise resilience and the potential for improved accuracy compared to its purely classical counterpart. Nevertheless, the use of Clifford shadows introduces an exponentially scaling postprocessing cost. In this work, we investigate an improved QC-QMC scheme utilizing the recently developed Matchgate shadows technique [], which removes the aforementioned exponential bottleneck. We observe from experiments on quantum hardware that the use of Matchgate shadows in QC-QMC is inherently noise robust. We show that this noise resilience has a more subtle origin than in the case of Clifford shadows. Nevertheless, we find that classical postprocessing, while asymptotically efficient, requires hours of runtime on thousands of classical CPUs for even the smallest chemical systems, presenting a major challenge to the scalability of the algorithm. Published by the American Physical Society 2024

arXiv:2404.18303•Physical Review Research•Oct 24, 2024•19 citations
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.
Quantum computing and quantum Monte Carlo (QMC) are respectively the state-of-the-art quantum and classical computing methods for understanding many-body quantum systems. Here, we propose a hybrid quantum-classical algorithm that integrates these two methods, inheriting their distinct features in efficient representation and manipulation of quantum states and overcoming their limitations. We first introduce non-stoquasticity indicators (NSIs) and their upper bounds, which measure the sign problem, the most notable limitation of QMC. We show that our algorithm could greatly mitigate the sign problem, which decreases NSIs with the assistance of quantum computing. Meanwhile, the use of quantum Monte Carlo also increases the expressivity of shallow quantum circuits, allowing more accurate computation that is conventionally achievable only with much deeper circuits. We numerically test and verify the method for the N2_22​ molecule (12 qubits) and the Hubbard model (16 qubits). Our work paves the way to solving practical problems with intermediate-scale and early-fault tolerant quantum computers, with potential applications in chemistry, condensed matter physics, materials, high energy physics, etc.
High Resolution Image Download MS PowerPoint Slide Quantum Monte Carlo (QMC) methods are powerful approaches for solving electronic structure problems. Although they often provide high-accuracy solutions, the precision of most QMC methods is ultimately limited by the trial wave function that must be used. Recently, an approach has been demonstrated to allow the use of trial wave functions prepared on a quantum computer [Huggins et al., Unbiasing fermionic quantum Monte Carlo with a quantum computer. Nature 2022, 603, 416] in the auxiliary-field QMC (AFQMC) method using classical shadows to estimate the required overlaps. However, this approach has an exponential post-processing step to construct these overlaps when performing classical shadows obtained using random Clifford circuits. Here, we study an approach to avoid this exponential scaling step by using a fixed-node Monte Carlo method based on full configuration interaction quantum Monte Carlo. This method is applied to the local unitary cluster Jastrow ansatz. We consider H 4, ferrocene, and benzene molecules using up to 12 qubits as examples. Circuits are compiled to native gates for typical near-term architectures, and we assess the impact of circuit-level depolarizing noise on the method. We also provide a comparison of AFQMC and fixed-node approaches, demonstrating that AFQMC is more robust to errors, although extrapolations of the fixed-node energy reduce this discrepancy. Although the method can be used to reach chemical accuracy, the sampling cost to achieve this is high even for small active spaces, suggesting caution about the prospect of outperforming conventional QMC approaches.
Electronic structure quantum Monte Carlo Quantum Monte Carlo (QMC) is an advanced simulation methodology for studies of manybody quantum systems. The QMC approaches combine analytical insights with stochastic computational techniques for efficient solution of several classes of important many-body problems such as the stationary Schrödinger equation. QMC methods of various flavors have been applied to a great variety of systems spanning continuous and lattice quantum models, molecular and condensed systems, BEC-BCS ultracold condensates, nuclei, etc. In this review, we focus on the electronic structure QMC, i.e., methods relevant for systems described by the electron-ion Hamiltonians. Some of the key QMC achievements include direct treatment of electron correlation, accuracy in predicting energy differences and favorable scaling in the system size. Calculations of atoms, molecules, clusters and solids have demonstrated QMC applicability to real systems with hundreds of electrons while providing 90-95% of the correlation energy and energy differences typically within a few percent of experiments. Advances in accuracy beyond these limits are hampered by the so-called fixed-node approximation which is used to circumvent the notorious fermion sign problem. Many-body nodes of fermion states and their properties have therefore become one of the important topics for further progress in predictive power and efficiency of QMC calculations. Some of our recent results on the wave function nodes and related nodal domain topologies will be briefly reviewed. This includes analysis of few-electron systems and descriptions of exact and approximate nodes using transformations and projections of the highly-dimensional nodal hypersurfaces into the 3D space. Studies of fermion nodes offer new insights into topological properties of eigenstates such as explicit demonstrations that generic fermionic ground states exhibit the minimal number of two nodal domains. Recently proposed trial wave functions based on Pfaffians with pairing orbitals are presented and their nodal properties are tested in calculations of first row atoms and molecules. Finally, backflow "dressed" coordinates are introduced as another possibility for capturing correlation effects and for decreasing the fixed-node bias.
Abstract Interacting many-electron problems pose some of the greatest computational challenges in science, with essential applications across many fields. The solutions to these problems will offer accurate predictions of chemical reactivity and kinetics, and other properties of quantum systems 1–4 . Fermionic quantum Monte Carlo (QMC) methods 5,6 , which use a statistical sampling of the ground state, are among the most powerful approaches to these problems. Controlling the fermionic sign problem with constraints ensures the efficiency of QMC at the expense of potentially significant biases owing to the limited flexibility of classical computation. Here we propose an approach that combines constrained QMC with quantum computation to reduce such biases. We implement our scheme experimentally using up to 16 qubits to unbias constrained QMC calculations performed on chemical systems with as many as 120 orbitals. These experiments represent the largest chemistry simulations performed with the help of quantum computers, while achieving accuracy that is competitive with state-of-the-art classical methods without burdensome error mitigation. Compared with the popular variational quantum eigensolver 7,8 , our hybrid quantum-classical computational model offers an alternative path towards achieving a practical quantum advantage for the electronic structure problem without demanding exceedingly accurate preparation and measurement of the ground-state wavefunction.
Quantum Monte Carlo (QMC) is one of the most promising methods for solving quantum many-body problems. QMC combines known analytical properties of wave functions, results from other methods, and stochastic techniques, into a powerful tool for investigation of the electronic structure of real materials. Furthermore, the method has a favorable scaling ( O[N3] in the number of electrons), perfect scalability on parallel architectures, and can be applied to a wide range of systems. Our work has focused both on expanding the capabilities of QMC for calculation of quantities beyond energies, such as interatomic forces, and on application of the method to challenging problems in nanostructure materials research. For the calculation of interatomic forces we have implemented a finite difference correlated sampling method. The correlated sampling enables us to avoid the problem of statistical noise in evaluating the energy differences and allows us to obtain forces with an average 1% error. We have analyzed the effect of the method's main approximations on the estimate of the forces, both by theoretical arguments and by performing a variety of tests on small systems. Furthermore, we have used this newly developed method for estimating equilibrium geometries in a problem where other methods have failed. QMC enabled us to treat the electron correlation effects with high accuracy and to provide accurate predictions in a number of interesting applications. In particular, for carbon rings of C4N+2 stoichiometry we have resolved a long-standing problem regarding the competition between the aromaticity and second order Jahn-Teller effects. We have found that the dominant mechanism at small and intermediate sizes, which stabilizes the bond angle and bond length alternated geometries, is the secondorder Jahn-Teller effect while the aromatic isomer is always found to be a transition state. These high accuracy calculations which have involved multi-reference wave functions, extensive variational optimizations, and the use of massively parallel platforms demonstrate clearly the unique capabilities of the QMC approach.
Solving the electronic structure problem of molecules and solids to high accuracy is a major challenge in quantum chemistry and condensed matter physics. The rapid emergence and development of quantum computers offer a promising route to systematically tackle this problem. Recent work by [Huggins , ] proposed a hybrid quantum-classical quantum Monte Carlo (QC-QMC) algorithm using Clifford shadows to determine the ground state of a Fermionic Hamiltonian. This approach displayed inherent noise resilience and the potential for improved accuracy compared to its purely classical counterpart. Nevertheless, the use of Clifford shadows introduces an exponentially scaling postprocessing cost. In this work, we investigate an improved QC-QMC scheme utilizing the recently developed Matchgate shadows technique [], which removes the aforementioned exponential bottleneck. We observe from experiments on quantum hardware that the use of Matchgate shadows in QC-QMC is inherently noise robust. We show that this noise resilience has a more subtle origin than in the case of Clifford shadows. Nevertheless, we find that classical postprocessing, while asymptotically efficient, requires hours of runtime on thousands of classical CPUs for even the smallest chemical systems, presenting a major challenge to the scalability of the algorithm. Published by the American Physical Society 2024