Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2310.18410 · PRX Quantum

Initial State Preparation for Quantum Chemistry on Quantum Computers

Stepan Fomichev, Kasra Hejazi, Modjtaba Shokrian Zini, Matthew Kiser, Joana Fraxanet, Pablo A. M. Casares, Alain Delgado, Joonsuk Huh, Arne-Christian Voigt, Jonathan Edward Mueller, Juan Miguel Arrazola

Published Dec 9, 2024• 100 citations
arXivHTMLPDF

Abstract

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

DOI
10.1103/prxquantum.5.040339

Related papers

リョウシカガクケイサンニオケルジョウタイジュンビオヨビアトショリノタメノコウコウリツナリョウシアルゴリズムノカイハツ

Viktor Khinevich, ヴィクトル ヒネヴィッチ

Quantum computers are anticipated to provide computational advantages over classical devices for specific classes of problems.In quantum chemistry, such an advantage can be achieved on fault-tolerant quantum computers (FTQCs) using quantum phase estimation (QPE), which can, in principle, provide accurate electronic energies with polynomial scaling.However, the practical success of QPE and related algorithms critically depends on the availability of high-quality initial quantum states with sufficient overlap with the target eigenstates.Moreover, even FTQCs are expected to be limited in size and total computational resources for the foreseeable future, restricting quantum calculations to reduced subspaces and allowing only a partial treatment of electronic correlation.For chemically meaningful predictions, the remaining correlation effects must therefore be recovered through post-processing.

•Mar 25, 2026•0 citations

Improved techniques for preparing eigenstates of fermionic Hamiltonians

Dominic William Berry, Mária Kieferová, Artur Scherer +5 more

Abstract Modeling low energy eigenstates of fermionic systems can provide insight into chemical reactions and material properties and is one of the most anticipated applications of quantum computing. We present three techniques for reducing the cost of preparing fermionic Hamiltonian eigenstates using phase estimation. First, we report a polylogarithmic-depth quantum algorithm for antisymmetrizing the initial states required for simulation of fermions in first quantization. This is an exponential improvement over the previous state-of-the-art. Next, we show how to reduce the overhead due to repeated state preparation in phase estimation when the goal is to prepare the ground state to high precision and one has knowledge of an upper bound on the ground state energy that is less than the excited state energy (often the case in quantum chemistry). Finally, we explain how one can perform the time evolution necessary for the phase estimation based preparation of Hamiltonian eigenstates with exactly zero error by using the recently introduced qubitization procedure.

arXiv:1711.10460•npj Quantum Information•Apr 26, 2018•164 citations

Probing Quantum Efficiency: Exploring System Hardness in Electronic Ground State Energy Estimation

Seonghoon Choi, Ignacio Loaiza, Robert A. Lang +2 more

We consider the question of how correlated the system hardness is between classical algorithms of electronic structure theory in ground state estimation and quantum algorithms. To define the system hardness for classical algorithms, we employ empirical criterion based on the deviation of electronic energies produced by coupled cluster and configuration interaction methods from the exact ones along multiple bonds dissociation in a set of molecular systems. For quantum algorithms, we have selected the Variational Quantum Eigensolver (VQE) and Quantum Phase Estimation (QPE) methods. As characteristics of the system hardness for quantum methods, we analyzed circuit depths for the state preparation, the number of quantum measurements needed for the energy expectation value, and various cost characteristics for the Hamiltonian encodings via Trotter approximation and linear combination of unitaries (LCU). Our results show that the quantum resource requirements are mostly unaffected by classical hardness, with the only exception being the state preparation part, which contributes to both VQE and QPE algorithm costs. However, there are clear indications that constructing the initial state with a significant overlap with the true ground state is easier than obtaining the state with an energy expectation value within chemical precision. These results support optimism regarding the identification of a molecular system where a quantum algorithm excels over its classical counterpart, as quantum methods can maintain efficiency in classically challenging systems.

arXiv:2311.00129•Journal of Chemical Theory and Computation•Jul 1, 2024•9 citations

Rapid Initial-State Preparation for the Quantum Simulation of Strongly Correlated Molecules

Dominic William Berry, Yu Tong, Tanuj Khattar +10 more

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.

arXiv:2409.11748•PRX Quantum•May 8, 2025•67 citations

VQE as Initial State Preparation for QPE on Heisenberg Spin-Glass Hamiltonians

Elijah Pelofske, Stephan Eidenbenz

Quantum Phase Estimation (QPE) is the quantum algorithmic workhorse for computing ground state energies of quantum Hamiltonians with quantum computers. Ground state energy calculation of physical systems is perhaps the most promising use case for quantum computing in terms of scientific and commercial value with a plausible path to outperformance of classical alternatives. This path, however, hinges on the availability of initial states for QPE with significant overlap with the true ground state. Using extensive (classical) numerical computations, we study whether the NISQ-era algorithm VQE (Variational Quantum Eigensolver) could be used to efficiently prepare high-overlap states of disordered fully-connected anisotropic Heisenberg spin glass quantum Hamiltonians with up to $15$ qubits. We find that (i) -- consistent with widely held, but rarely numerically illustrated beliefs -- VQE is generally unable to efficiently converge to the ground state for our Hamiltonians, which is a well-known issue with VQE due to a variety of factors including vanishing gradients and local minima; (ii) low energy states do not necessarily have large ground-state overlap, but there is typically a correlation between the two measures; (iii) adding more than three layers to the VQE ansatz neither improves overlap nor the energies found; and (iv) the best-found overlap scaling as a function of the Hamiltonian system size is not strongly exponentially decreasing, suggesting potential for VQE to be a heuristic state preparation algorithm for QPE.

quant-pharXiv:2606.15061•Jun 16, 2026•2 citations

A Simple Method for Seniority-Zero Quantum State Preparation

Michał Krompiec, Josh J. M. Kirsopp, A. M. Romero +1 more

Quantum phase estimation (QPE), the quantum algorithm for estimating eigenvalues of a given Hermitian matrix and preparing its eigenvectors, is considered the most promising approach to finding the ground states and their energies of electronic systems using a quantum computer. It requires, however, to be warm, starting from an initial state with a sufficiently high overlap with the ground state. For strongly correlated states, where QPE is expected to have an advantage over classical methods, preparation of such initial states requires deep quantum circuits and/or expensive hybrid quantum-classical optimization. It is well-known that the orbital-optimized paired coupled cluster doubles (oo-pCCD) method can describe the static correlation features of many strongly correlated singlet states. We show that pCCD and its unitary counterpart, UpCCD, become equivalent in the limit of small amplitudes or if the number of large amplitudes is below 5. We demonstrate that substituting leading oo-pCCD amplitudes into the UpCCD ansatz allows one to prepare high-fidelity singlet states for models of multiple-bond dissociation in ethene, ethyne, and dinitrogen, as well as for 1D Hubbard models at half-filling, with very shallow circuits. We envisage our method to be of general use for the approximate preparation of singlet states for QPE and related algorithms.

arXiv:2508.21679•Journal of Chemical Theory and Computation•Dec 26, 2025•4 citations
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
Quantum computers are anticipated to provide computational advantages over classical devices for specific classes of problems.In quantum chemistry, such an advantage can be achieved on fault-tolerant quantum computers (FTQCs) using quantum phase estimation (QPE), which can, in principle, provide accurate electronic energies with polynomial scaling.However, the practical success of QPE and related algorithms critically depends on the availability of high-quality initial quantum states with sufficient overlap with the target eigenstates.Moreover, even FTQCs are expected to be limited in size and total computational resources for the foreseeable future, restricting quantum calculations to reduced subspaces and allowing only a partial treatment of electronic correlation.For chemically meaningful predictions, the remaining correlation effects must therefore be recovered through post-processing.
Abstract Modeling low energy eigenstates of fermionic systems can provide insight into chemical reactions and material properties and is one of the most anticipated applications of quantum computing. We present three techniques for reducing the cost of preparing fermionic Hamiltonian eigenstates using phase estimation. First, we report a polylogarithmic-depth quantum algorithm for antisymmetrizing the initial states required for simulation of fermions in first quantization. This is an exponential improvement over the previous state-of-the-art. Next, we show how to reduce the overhead due to repeated state preparation in phase estimation when the goal is to prepare the ground state to high precision and one has knowledge of an upper bound on the ground state energy that is less than the excited state energy (often the case in quantum chemistry). Finally, we explain how one can perform the time evolution necessary for the phase estimation based preparation of Hamiltonian eigenstates with exactly zero error by using the recently introduced qubitization procedure.
We consider the question of how correlated the system hardness is between classical algorithms of electronic structure theory in ground state estimation and quantum algorithms. To define the system hardness for classical algorithms, we employ empirical criterion based on the deviation of electronic energies produced by coupled cluster and configuration interaction methods from the exact ones along multiple bonds dissociation in a set of molecular systems. For quantum algorithms, we have selected the Variational Quantum Eigensolver (VQE) and Quantum Phase Estimation (QPE) methods. As characteristics of the system hardness for quantum methods, we analyzed circuit depths for the state preparation, the number of quantum measurements needed for the energy expectation value, and various cost characteristics for the Hamiltonian encodings via Trotter approximation and linear combination of unitaries (LCU). Our results show that the quantum resource requirements are mostly unaffected by classical hardness, with the only exception being the state preparation part, which contributes to both VQE and QPE algorithm costs. However, there are clear indications that constructing the initial state with a significant overlap with the true ground state is easier than obtaining the state with an energy expectation value within chemical precision. These results support optimism regarding the identification of a molecular system where a quantum algorithm excels over its classical counterpart, as quantum methods can maintain efficiency in classically challenging systems.
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 Phase Estimation (QPE) is the quantum algorithmic workhorse for computing ground state energies of quantum Hamiltonians with quantum computers. Ground state energy calculation of physical systems is perhaps the most promising use case for quantum computing in terms of scientific and commercial value with a plausible path to outperformance of classical alternatives. This path, however, hinges on the availability of initial states for QPE with significant overlap with the true ground state. Using extensive (classical) numerical computations, we study whether the NISQ-era algorithm VQE (Variational Quantum Eigensolver) could be used to efficiently prepare high-overlap states of disordered fully-connected anisotropic Heisenberg spin glass quantum Hamiltonians with up to 151515 qubits. We find that (i) -- consistent with widely held, but rarely numerically illustrated beliefs -- VQE is generally unable to efficiently converge to the ground state for our Hamiltonians, which is a well-known issue with VQE due to a variety of factors including vanishing gradients and local minima; (ii) low energy states do not necessarily have large ground-state overlap, but there is typically a correlation between the two measures; (iii) adding more than three layers to the VQE ansatz neither improves overlap nor the energies found; and (iv) the best-found overlap scaling as a function of the Hamiltonian system size is not strongly exponentially decreasing, suggesting potential for VQE to be a heuristic state preparation algorithm for QPE.
Quantum phase estimation (QPE), the quantum algorithm for estimating eigenvalues of a given Hermitian matrix and preparing its eigenvectors, is considered the most promising approach to finding the ground states and their energies of electronic systems using a quantum computer. It requires, however, to be warm, starting from an initial state with a sufficiently high overlap with the ground state. For strongly correlated states, where QPE is expected to have an advantage over classical methods, preparation of such initial states requires deep quantum circuits and/or expensive hybrid quantum-classical optimization. It is well-known that the orbital-optimized paired coupled cluster doubles (oo-pCCD) method can describe the static correlation features of many strongly correlated singlet states. We show that pCCD and its unitary counterpart, UpCCD, become equivalent in the limit of small amplitudes or if the number of large amplitudes is below 5. We demonstrate that substituting leading oo-pCCD amplitudes into the UpCCD ansatz allows one to prepare high-fidelity singlet states for models of multiple-bond dissociation in ethene, ethyne, and dinitrogen, as well as for 1D Hubbard models at half-filling, with very shallow circuits. We envisage our method to be of general use for the approximate preparation of singlet states for QPE and related algorithms.