Rapid Initial-State Preparation for the Quantum Simulation of Strongly Correlated Molecules
Dominic William Berry, Yu Tong, Tanuj Khattar, Alec F. White, Tae In Kim, Guang Hao Low, Sergio Boixo, Zhiyan Ding, Lin Lin, Seunghoon Lee, Garnet Kin‐Lic Chan, Ryan Babbush, Nicholas C. Rubin
Studies on quantum algorithms for ground-state energy estimation often assume perfect ground-state preparation; however, in reality the initial state will have imperfect overlap with the true ground state. Here, we address that problem in two ways: by faster preparation of matrix-product-state (MPS) approximations and by more efficient filtering of the prepared state to find the ground-state energy. We show how to achieve unitary synthesis with a Toffoli complexity about 7 × lower than that in prior work and use that to derive a more efficient MPS-preparation method. For filtering, we present two different approaches: sampling and binary search. For both, we use the theory of window functions to avoid large phase errors and minimize the complexity. We find that the binary-search approach provides better scaling with the overlap at the cost of a larger constant factor, such that it will be preferred for overlaps less than about 0.003 . Finally, we estimate the total resources to perform ground-state energy estimation of Fe - S cluster systems, including the Fe Mo cofactor by estimating the overlap of different MPS initial states with potential ground states of the Fe Mo cofactor using an extrapolation procedure. With a modest MPS bond dimension of 4000 , our procedure produces an estimate of approximately 0.9 overlap squared with a candidate ground state of the Fe Mo cofactor, producing a total resource estimate of 7.3 × 10 10 Toffoli gates; neglecting the search over candidates and assuming the accuracy of the extrapolation, this validates prior estimates that have used perfect ground-state overlap. This presents an example of a practical path to prepare states of high overlap in a challenging-to-compute chemical system.
Studies on quantum algorithms for ground-state energy estimation often assume perfect ground-state preparation; however, in reality the initial state will have imperfect overlap with the true ground state. Here, we address that problem in two ways: by faster preparation of matrix-product-state (MPS) approximations and by more efficient filtering of the prepared state to find the ground-state energy. We show how to achieve unitary synthesis with a Toffoli complexity about 7 × lower than that in prior work and use that to derive a more efficient MPS-preparation method. For filtering, we present two different approaches: sampling and binary search. For both, we use the theory of window functions to avoid large phase errors and minimize the complexity. We find that the binary-search approach provides better scaling with the overlap at the cost of a larger constant factor, such that it will be preferred for overlaps less than about 0.003 . Finally, we estimate the total resources to perform ground-state energy estimation of Fe - S cluster systems, including the Fe Mo cofactor by estimating the overlap of different MPS initial states with potential ground states of the Fe Mo cofactor using an extrapolation procedure. With a modest MPS bond dimension of 4000 , our procedure produces an estimate of approximately 0.9 overlap squared with a candidate ground state of the Fe Mo cofactor, producing a total resource estimate of 7.3 × 10 10 Toffoli gates; neglecting the search over candidates and assuming the accuracy of the extrapolation, this validates prior estimates that have used perfect ground-state overlap. This presents an example of a practical path to prepare states of high overlap in a challenging-to-compute chemical system.
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) and their orderings using spin-adapted low-bond-dimension matrix product states (MPS). 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.
Compiling classically optimized matrix product states (MPSs) into quantum circuits is a promising route to initial-state preparation for strongly correlated molecules, but the accuracy, gate cost, and classical scalability of existing MPS compilation methods have not been systematically assessed. Here, we benchmark representative analytical, variational, and hybrid MPS compilation methods for strongly correlated systems including hydrogen chains and iron-sulfur clusters. We compare state infidelity, CNOT gate count, classical runtime, and parallel scalability across different system sizes and bond dimensions. We also introduce a divide-and-conquer environment-aware compilation algorithm (DCE), which optimizes each local isometry approximation according to its contribution to the prepared-state fidelity. The results reveal complementary operating regimes: direct variational compilation methods are gate-efficient for some smaller molecular systems with O(10) qubits and O(10) bond dimensions or moderate accuracy targets with infidelity of order 10−1, whereas divide-and-conquer methods scale more favorably for larger systems and relatively higher bond dimensions of O(10-102), particularly when target infidelities below 10−1 are required. Within the latter family, environment-aware optimization improves accuracy over unitary-distance-based compilation while retaining task-level parallelism. For the FeMo-cofactor (FeMoco), we find the DCE algorithm together with the MPS obtained in the entanglement-minimized orbitals (EMOs) provides a resource-efficient route to initial-state preparation. Our results provide practical guidance for selecting and developing MPS compilation methods for strongly correlated molecular simulations.
Weakly correlated electronic structures are predominant among molecules, and are routinely solved with heuristic classical methods such as the ``gold standard'' CCSD(T) coupled cluster model, incurring a formal time complexity O(n7) in the number of molecular orbitals and with no guarantee of energy error ε at or below chemical accuracy. In this work, a quantum algorithm is presented for ground state energy estimation of weakly correlated molecules using Trotterized time evolution, with an end-to-end quantum operations cost that scales as O~(n4.8/ε2) in the limit of high-order product formulae when run as a low-depth, shot-noise limited algorithm, or O~(n4.8+n3.8/ε) when scaling the simulation time T∝1/ε. The algorithm combines adiabatic state preparation using a smoothed Gevrey schedule with eigenstate filtering via quantum prolate diagonalization (QPD). Both steps of the algorithm rely on a size-independent spectral gap assumption, which is validated by numerical studies on alanine chains with up to 64 monomers. We benchmark the performance of our eigenstate filtering algorithm on a set of 28 molecules to compare our approach against prior phase estimation algorithms, finding that QPD achieves state-of-the-art cost tradeoffs for ε-accurate results. Physical quantum resource estimates are obtained for running Trotter step circuits with up to 40 spin-orbitals, providing a clear path for scaling up quantum simulation of chemistry on early fault-tolerant hardware.
Quantum algorithms for ground-state energy estimation of chemical systems require a high-quality initial state. However, initial state preparation is commonly either neglected entirely, or assumed to be solved by a simple product state like Hartree-Fock. Even if a nontrivial state is prepared, strong correlations render ground-state overlap inadequate for quality assessment. In this work, we address the initial state preparation problem with an end-to-end algorithm that and the quality of initial states, accomplishing the latter with a new metric—the energy distribution. To be able to prepare more complicated initial states, we introduce an implementation technique for states in the form of a sum of Slater determinants that exhibits significantly better scaling than all prior approaches. We also propose low-precision quantum phase estimation (QPE) for further state quality refinement. The complete algorithm is capable of generating high-quality states for energy estimation, and is shown in select cases to lower the overall estimation cost by several orders of magnitude when compared with the best single product state ansatz. More broadly, the energy distribution picture suggests that the goal of QPE should be reinterpreted as generating improvements compared to the energy of the initial state and other classical estimates: such an improvement can still be achieved even if QPE does not project directly onto the ground state. Finally, we show how the energy distribution can help in identifying potential quantum advantage. Published by the American Physical Society 2024
Preparing the ground state of a given Hamiltonian and estimating its ground energy are important but computationally hard tasks. However, given some additional information, these problems can be solved efficiently on a quantum computer. We assume that an initial state with non-trivial overlap with the ground state can be efficiently prepared, and the spectral gap between the ground energy and the first excited energy is bounded from below. With these assumptions we design an algorithm that prepares the ground state when an upper bound of the ground energy is known, whose runtime has a logarithmic dependence on the inverse error. When such an upper bound is not known, we propose a hybrid quantum-classical algorithm to estimate the ground energy, where the dependence of the number of queries to the initial state on the desired precision is exponentially improved compared to the current state-of-the-art algorithm proposed in [Ge et al. 2019]. These two algorithms can then be combined to prepare a ground state without knowing an upper bound of the ground energy. We also prove that our algorithms reach the complexity lower bounds by applying it to the unstructured search problem and the quantum approximate counting problem.
One promising field of quantum computation is the simulation of quantum systems, and specifically, the task of ground state energy estimation (GSEE). Ground state preparation (GSP) is a crucial component in GSEE algorithms, and classical methods like Hartree-Fock state preparation are commonly used. However, the efficiency of such classical methods diminishes exponentially with increasing system size in certain cases. In this study, we investigated whether in those cases quantum heuristic GSP methods could improve the overlap values compared to Hartree-Fock. Moreover, we carefully studied the performance gain for GSEE algorithms by exploring the trade-off between the overlap improvement and the associated resource cost in terms of T-gates of the GSP algorithm. Our findings indicate that quantum heuristic GSP can accelerate GSEE tasks, already for computationally affordable strongly-correlated systems of intermediate size. These results suggest that quantum heuristic GSP has the potential to significantly reduce the runtime requirements of GSEE algorithms, thereby enhancing their suitability for implementation on quantum hardware.