English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

A recent preprint by Mazzola and Carleo numerically investigates exponentialchallenges that can arise for the QC-QMC algorithm introduced in our work,"Unbiasing fermionic quantum Monte Carlo with a quantum computer." As discussedin our original paper, we agree with this general concern. However, here weprovide further details and numerics to emphasize that the prospects forpractical quantum advantage in QC-QMC remain open. The exponential challengesin QC-QMC are dependent on (1) the choice of QMC methods, (2) the underlyingsystem, and (3) the form of trial and walker wavefunctions. While one can finddifficult examples with a specific method, a specific system, and a specificwalker/trial form, for some combinations of these choices, the approach ispotentially more scalable than other near-term quantum algorithms. Futureresearch should aim to identify examples for which QC-QMC enables practicalquantum advantage.

Response to "Exponential challenges in unbiasing quantum Monte Carlo algorithms with quantum computers"