pith. sign in

arxiv: 2502.20799 · v2 · pith:RFEW776Gnew · submitted 2025-02-28 · 🪐 quant-ph

Quantum-assisted variational Monte Carlo

classification 🪐 quant-ph
keywords quantumquantum-assistedclassicalgroundstatesystemscarlomany-body
0
0 comments X
read the original abstract

Solving the ground state of quantum many-body systems remains a fundamental challenge in physics and chemistry. Recent advancements in quantum hardware have opened new avenues for addressing this challenge. Inspired by the quantum-enhanced Markov chain Monte Carlo (QeMCMC) algorithm [Nature, 619, 282-287 (2023)], which was originally designed for sampling the Boltzmann distribution of classical spin models using quantum computers, we introduce a quantum-assisted variational Monte Carlo (QA-VMC) algorithm for solving the ground state of quantum many-body systems by adapting QeMCMC to sample the distribution of a (neural-network) wave function in VMC. The central question is whether such quantum-assisted proposal can potentially offer a computational advantage over classical methods. Through numerical investigations for the Fermi-Hubbard model and molecular systems, we demonstrate that the quantum-assisted proposal exhibits larger absolute spectral gaps and reduced autocorrelation times compared to conventional classical proposals, leading to more efficient sampling and faster convergence to the ground state in VMC as well as more accurate and precise estimation of physical observables. This advantage is especially pronounced for specific parameter ranges, where the ground-state configurations are more concentrated in some configurations separated by large Hamming distances. Our results underscore the potential of quantum-assisted algorithms to enhance classical variational methods for solving the ground state of quantum many-body systems.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Quantum Markov chain Monte Carlo method with programmable quantum simulators

    quant-ph 2025-05 unverdicted novelty 6.0

    A quantum MCMC algorithm leveraging the MBL phase and its thermal-to-localized transition to tune acceptance rates and sample thermal distributions on programmable quantum simulators for combinatorial optimization.