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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Quantum algorithms for simulating electronic ground states are slower thanpopular classical mean-field algorithms such as Hartree-Fock and densityfunctional theory, but offer higher accuracy. Accordingly, quantum computershave been predominantly regarded as competitors to only the most accurate andcostly classical methods for treating electron correlation. However, here wetighten bounds showing that certain first quantized quantum algorithms enableexact time evolution of electronic systems with exponentially less space andpolynomially fewer operations in basis set size than conventional real-timetime-dependent Hartree-Fock and density functional theory. Although the need tosample observables in the quantum algorithm reduces the speedup, we show thatone can estimate all elements of the $k$-particle reduced density matrix with anumber of samples scaling only polylogarithmically in basis set size. We alsointroduce a more efficient quantum algorithm for first quantized mean-fieldstate preparation that is likely cheaper than the cost of time evolution. Weconclude that quantum speedup is most pronounced for finite temperaturesimulations and suggest several practically important electron dynamicsproblems with potential quantum advantage.

Quantum simulation of exact electron dynamics can be more efficient than classical mean-field methods