Papers › Quantum algorithms for the variational optimization of correlated electronic states...

Quantum algorithms for the variational optimization of correlated electronic states with stochastic reconfiguration and the linear method

3 Aug 2024arXiv:2408.01833links table onlyarchive 2025-07-28

Mario Motta, Kevin J. Sung, James Shee

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

Solving the electronic Schrodinger equation for strongly correlated ground states is a long-standing challenge. We present quantum algorithms for the variational optimization of wavefunctions correlated by products of unitary operators, such as Local Unitary Cluster Jastrow (LUCJ) ansatzes, using stochastic reconfiguration and the linear method. While an implementation on classical computing hardware would require exponentially growing compute cost, the cost (number of circuits and shots) of our quantum algorithms is polynomial in system size. We find that classical simulations of optimization with the linear method consistently find lower energy solutions than with the L-BFGS-B optimizer across the dissociation curves of the notoriously difficult N₂ and C₂ dimers; LUCJ predictions of the ground-state energies deviate from exact diagonalization by 1 kcal/mol or less at all points on the potential energy curve. While we do characterize the effect of shot noise on the LM optimization, these noiseless results highlight the critical but often overlooked role that optimization techniques must play in attacking the electronic structure problem (on both classical and quantum hardware), for which even mean-field optimization is formally NP hard. We also discuss the challenge of obtaining smooth curves in these strongly correlated regimes, and propose a number of quantum-friendly solutions ranging from symmetry-projected ansatz forms to a symmetry-constrained optimization algorithm.

PaperPDFCode

Code

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections