Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchCalcul cuantic

analiza aiqbench

This research presents a significant algorithmic breakthrough in quantum simulation by reducing the sample complexity required to estimate overlaps between fermionic states from O(√n log n) to O(η log η). By achieving mode-independent computational costs, this protocol removes a critical scaling barrier that previously limited the accuracy of many-body simulations for large systems. The work establishes new theoretical bounds and efficient implementation strategies using harmonic analysis techniques specifically tailored for quantum chemistry applications.
Sursă care acoperăQuantum Zeitgeist
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Cerezo and Colleagues Develop Fermionic Shadow Protocol for Estimating Slater Determinant Overlaps

Quantum Zeitgeist6 min de cititArticolul și perspectiva sunt în engleză.

Previously, estimating the overlap between quantum states demanded resources scaling with the square root of system size. New work demonstrates this can now be achieved with a sample complexity of O(η log η), a substantial reduction for fermionic systems. This advance also establishes a bound of O(η∥h0∥2 2) for estimating particle-preserving quadratic fermionic observables, streamlining characterisation.

Researchers at Los Alamos National Laboratory, led by Maxwell West, have unveiled a new methodology for learning expectation values of particle-preserving operators within fermionic states utilising classical shadows. This advancement addresses a critical challenge in quantum simulation, namely the computational cost associated with accurately modelling many-body fermionic systems. The team's approach achieves an improved worst-case bound of $\mathcal{O}(η\logη)$ for estimating overlaps with Slater determinant states, a significant reduction from the previously known bound of $\mathcal{O}(\sqrt n \log n)$. This result is particularly noteworthy as it yields a sample cost independent of the number of modes, 'n', representing a substantial step towards scalable…

Extras afișat conform termenilor RSS ai publicației · 102 cuvinte · textul integral și figurile sunt pe site-ul publicației

Subiecte conexe