EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

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

Benchen Huang, Yi-Ting Chen, Brajesh Gupt, Martin Suchara, Anh Tran, Sam McArdle, Giulia Galli

Physical Review Research · 24.10.2024 · 6 (4)

DOI: 10.1103/physrevresearch.6.043063 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Physical Review Research, online erschienen am 24.10.2024. Verfasst von Benchen Huang und 6 weiteren Autor:innen. Die Arbeit wurde bisher 19-mal zitiert (Crossref) und nennt 68 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: U.S. Department of Energy, Office of Science, Oak Ridge National Laboratory.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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

Förderung

  • U.S. Department of Energy
  • Office of Science
  • Oak Ridge National Laboratory

Zitieren

APA

Huang, B., Chen, Y., Gupt, B., Suchara, M., Tran, A., McArdle, S., & Galli, G. (2024). Evaluating a quantum-classical quantum Monte Carlo algorithm with Matchgate shadows. Physical Review Research, 6(4). https://doi.org/10.1103/physrevresearch.6.043063

Vancouver

Huang B, Chen Y, Gupt B, Suchara M, Tran A, McArdle S, et al. Evaluating a quantum-classical quantum Monte Carlo algorithm with Matchgate shadows. Physical Review Research. 2024;6(4). doi:10.1103/physrevresearch.6.043063

BibTeX
@article{Huang2024,
  author = {Huang, Benchen and Chen, Yi-Ting and Gupt, Brajesh and Suchara, Martin and Tran, Anh and McArdle, Sam and Galli, Giulia},
  title = {Evaluating a quantum-classical quantum Monte Carlo algorithm with Matchgate shadows},
  journal = {Physical Review Research},
  year = {2024},
  volume = {6},
  number = {4},
  doi = {10.1103/physrevresearch.6.043063}
}
Kostenlos starten →