Entanglement-minimized orbitals enable faster quantum simulation of molecules
read the original abstract
Quantum computation offers significant potential for accelerating the simulation of molecules and materials through algorithms such as quantum phase estimation (QPE). However, the expected speedup in ground-state energy estimation depends critically on the ability to efficiently prepare an initial state with high overlap with the true ground state. For strongly correlated molecules such as iron-sulfur clusters, this overlap is demonstrated to decay exponentially with system size. To alleviate this problem, we introduce an efficient classical algorithm to find entanglement-minimized orbitals (EMOs) using spin-adapted matrix product states (MPS) with small bond dimensions. The EMO basis yields a more compact ground-state representation, significantly easing initial state preparation for challenging systems. Our algorithm improves initial state overlap by nearly an order of magnitude over prior orbital optimization approaches for an iron-sulfur cluster with four irons, and is scalable to larger systems with many unpaired electrons, including the P-cluster and FeMo-cofactor in nitrogenase with eight transition metal centers. For these systems, we achieve substantial enhancements on initial state overlap by factors of $O(10^2)$ and $O(10^5)$, respectively, compared to results obtained using localized orbitals. Our results show that initial state preparation for these challenging systems requires far fewer resources than prior estimates suggested.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
Computable measures of fermionic non-Gaussianity from the covariance matrix
Introduces occupation number entropies (Tsallis) and natural-orbital participation entropies (Renyi) as computable convex resource monotones for fermionic non-Gaussianity from the covariance matrix.
-
Mutual information and mutual correlation: their spin-free formulations and comparison
Spin-free Ms-invariant formulations of mutual information and mutual correlation are derived from entropies and cumulants and compared on iron-sulfur complexes to separate static spin correlation from genuine strong c...
-
Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers
An algorithm is presented for estimating distribution complexity of electronic structure Hamiltonians, with O(N^3) entanglement estimation per fragment and quadratic/exponential reductions in distribution cost for qua...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.