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:2611.00751

Quantum algorithm for weakly correlated molecular electronic ground states with sub-quintic scaling in the system size

Oskar Leimkuhler, Marvin Kronenberger, Davide Castaldo, Timothy Stroschein, Srushti Patil, Rebecca Tomann, Arta Safari, Marek Miller, Gemma C. Solomon, Matthias Christandl, Markus Reiher

quant-phphysics.chem-phSubmitted Oct 31, 2026• Announced Nov 3, 2026• 0 citations
arXivHTMLPDF

Abstract

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(n^7)$ in the number of molecular orbitals and with no guarantee of energy error $\varepsilon$ 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 $\tilde{O}(n^{4.8}/\varepsilon^2)$ in the limit of high-order product formulae when run as a low-depth, shot-noise limited algorithm, or $\tilde{O}(n^{4.8} + n^{3.8}/\varepsilon)$ when scaling the simulation time $T\propto 1/\varepsilon$. 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 $\varepsilon$-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.

AI Summary

The paper studies ground-state energy estimation for weakly correlated molecules, including state preparation rather than assuming a favorable initial overlap. It combines adiabatic preparation along a Hartree–Fock-to-interacting interpolation using a smooth Gevrey schedule with quantum prolate diagonalization (QPD) of measured autocorrelation functions. The analysis assumes efficient Hartree–Fock convergence, a size-independent spectral gap throughout the interpolation, and a Hamiltonian spectral norm scaling extensively with system size. Under these assumptions, adiabatic preparation takes simulation time $\tilde O(n/\Delta^2)$. A single-frequency QPD estimator supports a depth–sampling tradeoff: evolution time $O(1/\Delta)$ with approximately $O(\varepsilon^{-2})$ shots, or $O(1/\varepsilon)$ evolution with polylogarithmically many circuit runs. Combining product-formula error bounds with double-factorized simulation gives high-order-limit gate costs $\tilde O(n^{4.8}/\varepsilon^2)$ or $\tilde O(n^{4.8}+n^{3.8}/\varepsilon)$. These exponents additionally rely on empirical factorization-rank and Hamiltonian one-norm scalings, including $\lambda=O(n^{1.8})$. Numerical evidence includes Hartree–Fock orbital gaps for alanine chains through 64 residues, interpolation-gap calculations for one residue, and phase-estimation benchmarks on 28 systems with 4–16 spin-orbitals. QPD provides a runtime–depth tradeoff; QMEGS requires less total evolution time at chemical accuracy. Fault-tolerant estimates put one 40-spin-orbital Trotter step at roughly 71–1509 seconds, depending on architecture. The gap evidence does not establish asymptotic many-body gaps. Benchmarks omit adiabatic preparation and coherent errors, Trotter bounds are conservative, and physical estimates cover individual steps rather than complete energy calculations. A matched accuracy-dependent classical complexity comparison remains unresolved.

Little sign of AI-generated textAI use disclosedOverclaimsStrong assumptionsPossible error
The authors used LLMs in conversational mode to survey the relevant literature and to help devise the propositions, theorems and lemmas

Central claim may not hold: The headline n^4.8 scaling additionally relies on empirical factorization ranks and a tentative Hamiltonian one-norm exponent that are not established asymptotically for growing molecules. The 64-residue calculations establish Hartree–Fock orbital gaps, not the size-independent interacting spectral gap throughout the adiabatic pathway required by the algorithm. Taking recursive Suzuki product-formula order to infinity without accounting for its exponential implementation overhead does not establish the stated polylogarithm-suppressed n^4.8 complexity. The QPD analysis asserts a false exponential lower bound on fixed-bandwidth Slepian eigenvalues, whose large-index tails instead decay super-exponentially. The QPD proof uses a false local Bernstein inequality for band-limited functions, leaving its supplied conditioning and error-guarantee argument unsupported.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
61 pages, 19 figures

Related papers

Enabling Chemically Accurate Quantum Phase Estimation in the Early Fault-Tolerant Regime

Shota Kanasugi, Riki Toshio, Kazunori Maruyama +1 more

Quantum simulation of molecular electronic structure is one of the most promising applications of quantum computing. However, achieving chemically accurate predictions for strongly correlated systems requires quantum phase estimation (QPE) on fault-tolerant quantum computing (FTQC) devices. Existing resource estimates for typical FTQC architectures suggest that such calculations demand millions of physical qubits, thereby placing them beyond the reach of near-term devices. Here, we investigate the feasibility of performing QPE for chemically relevant molecular systems in an early-FTQC regime, characterized by partial fault tolerance, constrained qubit budgets, and limited circuit depth. Our framework is based on single-ancilla, Trotter-based QPE implementations combined with partially randomized time evolution. Within this framework, we develop a novel Hamiltonian optimization strategy, termed unitary weight concentration, that reduces algorithmic cost by reshaping linear-combination-of-unitaries representations. Applying this framework to active-space models of iron-sulfur clusters, cytochrome P450 active sites, and CO$_2$-utilization catalysts, we perform end-to-end resource estimation using the latest version of the space-time efficient analog rotation (STAR) architecture. Our results indicate that ground-state energy estimation for active spaces of approximately 20 to 50 spatial orbitals, well beyond the reach of classical full configuration interaction, is achievable using $\sim 10^5$ physical qubits, with runtimes on the order of days to weeks. These findings demonstrate that while full-fledged fault-tolerant quantum computers will be required for even larger molecular simulations, chemically meaningful quantum chemistry problems are already within reach in an experimentally relevant, early-FTQC regime.

quant-pharXiv:2603.22778•PRX Quantum•Mar 25, 2026•9 citations

Spin coupling is all you need: Encoding strong electron correlation in molecules on quantum computers

Daniel Marti-Dafcik, Hugh G. A. Burton, David P. Tew

The performance of quantum algorithms for eigenvalue problems, such as computing Hamiltonian spectra, depends strongly on the overlap of the initial wave function and the target eigenvector. In a basis of Slater determinants, the representation of energy eigenstates of systems with N strongly correlated electrons requires a number of determinants that scales exponentially with N . On classical processors, this restricts simulations to systems where N is small. Here, we show that quantum computers can efficiently simulate strongly correlated molecular systems by directly encoding the dominant entanglement structure in the form of spin-coupled initial states. This avoids resorting to expensive classical or quantum state preparation heuristics and instead exploits symmetries in the wave function. We provide quantum circuits for deterministic preparation of a family of spin eigenfunctions with ( N N / 2 ) Slater determinants with depth O ( N ) and O ( N 2 ) local gates. Their use as highly entangled initial states in quantum algorithms reduces the total runtime of quantum phase estimation and related fault-tolerant methods by orders of magnitude. Furthermore, we assess the application of spin-coupled wave functions as initial states for a range of heuristic quantum algorithms, namely, the variational quantum eigensolver, adiabatic state preparation, and different versions of quantum subspace diagonalization (QSD) including QSD based on real-time-evolved states. We also propose a QSD algorithm that exploits states obtained through adaptive quantum eigensolvers. For all algorithms, we demonstrate that using spin-coupled initial states drastically reduces the quantum resources required to simulate strongly correlated ground and excited states. Our work provides a crucial component for enabling scalable quantum simulation of classically challenging electronic systems.

arXiv:2404.18878•Physical Review Research•Feb 24, 2025•20 citations

Faster quantum simulation of quantum chemistry with tailored algorithms and Hamiltonians

Ian Kivlichan

With quantum computers on the horizon, it is essential to understand what problems they can be used to solve. One potential application is simulating quantum systems, in particular, systems with many interacting electrons. However, there is a disparity between the computational resources required to study these problems and the capabilities of modern experimental quantum devices. In this thesis, we make progress toward closing this gap by reducing the cost of quantum simulation of quantum chemistry on a number of fronts. In the first half, we develop three improved quantum simulation algorithms by approximating time evolution under the Hamiltonian using a truncated Taylor series rather than the Trotter-Suzuki decomposition. We do this first for the molecular electronic structure Hamiltonian in two representations, obtaining asymptotic improvements in terms of both the number of orbitals and the required precision. We also apply the truncated Taylor series paradigm to quantum simulation in real space, where we consider simulation of general wave functions discretized on a uniform grid. In the second half, by working with Hamiltonians tailored specifically to quantum algorithms, we demonstrate that Trotter steps of the electronic structure Hamiltonian can be simulated in exactly N depth and with only linear connectivity, where N is the number of spin-orbitals. This resolves the problem of non-locality in fermion-to-qubit mappings, and has wide-ranging applications for variational and phase estimation-based quantum simulation of quantum chemistry. We further study this algorithm on an error-corrected quantum computer using the surface code. Benchmarking it alongside other product formula approaches, we show that quantum simulation of scientifically important instances of the electronic structure problem that are classically intractable can be performed with only a few hundred thousand physical qubits and fewer than one billion costly fault-tolerant gates. Finally, we study the effect of using randomized Hamiltonians in iterative phase estimation, and how this allows us to reduce the costs of simulation as well as to exploit knowledge of the ground state in how we design our simulation algorithm.

•Jan 8, 2020•0 citations

Coupled cluster downfolding theory in simulations of correlated systems on quantum hardware

Nicholas P. Bauman, Muqing Zheng, Chenxu Liu +5 more

The practical application of quantum technologies to chemical problems faces significant challenges, particularly in the treatment of realistic basis sets and the accurate inclusion of electron correlation effects. A direct approach to these problems is currently infeasible due to limitations in the number of logical qubits, their fidelity, and the shallow circuit depths supported by existing hardware, all of which hinder simulations at the required level of accuracy. A promising alternative is hybrid quantum-classical computing, where classical resources are used to construct effective Hamiltonians characterized by dimensions that conform to the constraints of current quantum devices. In this paper, we demonstrate the performance of a hybrid approach: coupled cluster downfolded Hamiltonians are first evaluated in reduced-dimensionality active spaces, and the corresponding ground-state energies are subsequently computed using quantum algorithms. Our comprehensive analysis explores the achievable accuracy in recovering correlation energies when hundreds of orbitals are downfolded into a problem size tractable by today’s quantum hardware. We argue that such flexible hybrid algorithms, where problem size can be tailored to available quantum resources, can serve as a bridge between noisy intermediate-scale quantum devices and future fault-tolerant quantum computers, marking a step toward the early realization of quantum advantage in chemistry.

arXiv:2507.01199•Physical Review Research•Dec 11, 2025•12 citations

Chemical basis of Trotter-Suzuki errors in quantum chemistry simulation

Ryan Babbush, Jarrod R. McClean, Dave Wecker +2 more

Although the simulation of quantum chemistry is one of the most anticipated applications of quantum computing, the scaling of known upper bounds on the complexity of these algorithms is daunting. Prior work has bounded errors due to discretization of the time evolution (known as ``Trotterization'') in terms of the norm of the error operator and analyzed scaling with respect to the number of spin orbitals. However, we find that these error bounds can be loose by up to 16 orders of magnitude for some molecules. Furthermore, numerical results for small systems fail to reveal any clear correlation between ground-state error and number of spin orbitals. We instead argue that chemical properties, such as the maximum nuclear charge in a molecule and the filling fraction of orbitals, can be decisive for determining the cost of a quantum simulation. Our analysis motivates several strategies to use classical processing to further reduce the required Trotter step size and estimate the necessary number of steps, without requiring additional quantum resources. Finally, we demonstrate improved methods for state preparation techniques which are asymptotically superior to proposals in the simulation literature.

arXiv:1410.8159•Physical Review A•Feb 17, 2015•209 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
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)O(n^7)O(n7) in the number of molecular orbitals and with no guarantee of energy error ε\varepsilonε 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)\tilde{O}(n^{4.8}/\varepsilon^2)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/ε)\tilde{O}(n^{4.8} + n^{3.8}/\varepsilon)O~(n4.8+n3.8/ε) when scaling the simulation time T∝1/εT\propto 1/\varepsilonT∝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 ε\varepsilonε-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.
The paper studies ground-state energy estimation for weakly correlated molecules, including state preparation rather than assuming a favorable initial overlap. It combines adiabatic preparation along a Hartree–Fock-to-interacting interpolation using a smooth Gevrey schedule with quantum prolate diagonalization (QPD) of measured autocorrelation functions. The analysis assumes efficient Hartree–Fock convergence, a size-independent spectral gap throughout the interpolation, and a Hamiltonian spectral norm scaling extensively with system size.
Under these assumptions, adiabatic preparation takes simulation time O~(n/Δ2)\tilde O(n/\Delta^2)O~(n/Δ2). A single-frequency QPD estimator supports a depth–sampling tradeoff: evolution time O(1/Δ)O(1/\Delta)O(1/Δ) with approximately O(ε−2)O(\varepsilon^{-2})O(ε−2) shots, or O(1/ε)O(1/\varepsilon)O(1/ε) evolution with polylogarithmically many circuit runs. Combining product-formula error bounds with double-factorized simulation gives high-order-limit gate costs O~(n4.8/ε2)\tilde O(n^{4.8}/\varepsilon^2)O~(n4.8/ε2) or O~(n4.8+n3.8/ε)\tilde O(n^{4.8}+n^{3.8}/\varepsilon)O~(n4.8+n3.8/ε). These exponents additionally rely on empirical factorization-rank and Hamiltonian one-norm scalings, including λ=O(n1.8)\lambda=O(n^{1.8})λ=O(n1.8).
Numerical evidence includes Hartree–Fock orbital gaps for alanine chains through 64 residues, interpolation-gap calculations for one residue, and phase-estimation benchmarks on 28 systems with 4–16 spin-orbitals. QPD provides a runtime–depth tradeoff; QMEGS requires less total evolution time at chemical accuracy. Fault-tolerant estimates put one 40-spin-orbital Trotter step at roughly 71–1509 seconds, depending on architecture.
The gap evidence does not establish asymptotic many-body gaps. Benchmarks omit adiabatic preparation and coherent errors, Trotter bounds are conservative, and physical estimates cover individual steps rather than complete energy calculations. A matched accuracy-dependent classical complexity comparison remains unresolved.
Quantum simulation of molecular electronic structure is one of the most promising applications of quantum computing. However, achieving chemically accurate predictions for strongly correlated systems requires quantum phase estimation (QPE) on fault-tolerant quantum computing (FTQC) devices. Existing resource estimates for typical FTQC architectures suggest that such calculations demand millions of physical qubits, thereby placing them beyond the reach of near-term devices. Here, we investigate the feasibility of performing QPE for chemically relevant molecular systems in an early-FTQC regime, characterized by partial fault tolerance, constrained qubit budgets, and limited circuit depth. Our framework is based on single-ancilla, Trotter-based QPE implementations combined with partially randomized time evolution. Within this framework, we develop a novel Hamiltonian optimization strategy, termed unitary weight concentration, that reduces algorithmic cost by reshaping linear-combination-of-unitaries representations. Applying this framework to active-space models of iron-sulfur clusters, cytochrome P450 active sites, and CO2_22​-utilization catalysts, we perform end-to-end resource estimation using the latest version of the space-time efficient analog rotation (STAR) architecture. Our results indicate that ground-state energy estimation for active spaces of approximately 20 to 50 spatial orbitals, well beyond the reach of classical full configuration interaction, is achievable using ∼105\sim 10^5∼105 physical qubits, with runtimes on the order of days to weeks. These findings demonstrate that while full-fledged fault-tolerant quantum computers will be required for even larger molecular simulations, chemically meaningful quantum chemistry problems are already within reach in an experimentally relevant, early-FTQC regime.
The performance of quantum algorithms for eigenvalue problems, such as computing Hamiltonian spectra, depends strongly on the overlap of the initial wave function and the target eigenvector. In a basis of Slater determinants, the representation of energy eigenstates of systems with N strongly correlated electrons requires a number of determinants that scales exponentially with N . On classical processors, this restricts simulations to systems where N is small. Here, we show that quantum computers can efficiently simulate strongly correlated molecular systems by directly encoding the dominant entanglement structure in the form of spin-coupled initial states. This avoids resorting to expensive classical or quantum state preparation heuristics and instead exploits symmetries in the wave function. We provide quantum circuits for deterministic preparation of a family of spin eigenfunctions with ( N N / 2 ) Slater determinants with depth O ( N ) and O ( N 2 ) local gates. Their use as highly entangled initial states in quantum algorithms reduces the total runtime of quantum phase estimation and related fault-tolerant methods by orders of magnitude. Furthermore, we assess the application of spin-coupled wave functions as initial states for a range of heuristic quantum algorithms, namely, the variational quantum eigensolver, adiabatic state preparation, and different versions of quantum subspace diagonalization (QSD) including QSD based on real-time-evolved states. We also propose a QSD algorithm that exploits states obtained through adaptive quantum eigensolvers. For all algorithms, we demonstrate that using spin-coupled initial states drastically reduces the quantum resources required to simulate strongly correlated ground and excited states. Our work provides a crucial component for enabling scalable quantum simulation of classically challenging electronic systems.
With quantum computers on the horizon, it is essential to understand what problems they can be used to solve. One potential application is simulating quantum systems, in particular, systems with many interacting electrons. However, there is a disparity between the computational resources required to study these problems and the capabilities of modern experimental quantum devices. In this thesis, we make progress toward closing this gap by reducing the cost of quantum simulation of quantum chemistry on a number of fronts. In the first half, we develop three improved quantum simulation algorithms by approximating time evolution under the Hamiltonian using a truncated Taylor series rather than the Trotter-Suzuki decomposition. We do this first for the molecular electronic structure Hamiltonian in two representations, obtaining asymptotic improvements in terms of both the number of orbitals and the required precision. We also apply the truncated Taylor series paradigm to quantum simulation in real space, where we consider simulation of general wave functions discretized on a uniform grid. In the second half, by working with Hamiltonians tailored specifically to quantum algorithms, we demonstrate that Trotter steps of the electronic structure Hamiltonian can be simulated in exactly N depth and with only linear connectivity, where N is the number of spin-orbitals. This resolves the problem of non-locality in fermion-to-qubit mappings, and has wide-ranging applications for variational and phase estimation-based quantum simulation of quantum chemistry. We further study this algorithm on an error-corrected quantum computer using the surface code. Benchmarking it alongside other product formula approaches, we show that quantum simulation of scientifically important instances of the electronic structure problem that are classically intractable can be performed with only a few hundred thousand physical qubits and fewer than one billion costly fault-tolerant gates. Finally, we study the effect of using randomized Hamiltonians in iterative phase estimation, and how this allows us to reduce the costs of simulation as well as to exploit knowledge of the ground state in how we design our simulation algorithm.
The practical application of quantum technologies to chemical problems faces significant challenges, particularly in the treatment of realistic basis sets and the accurate inclusion of electron correlation effects. A direct approach to these problems is currently infeasible due to limitations in the number of logical qubits, their fidelity, and the shallow circuit depths supported by existing hardware, all of which hinder simulations at the required level of accuracy. A promising alternative is hybrid quantum-classical computing, where classical resources are used to construct effective Hamiltonians characterized by dimensions that conform to the constraints of current quantum devices. In this paper, we demonstrate the performance of a hybrid approach: coupled cluster downfolded Hamiltonians are first evaluated in reduced-dimensionality active spaces, and the corresponding ground-state energies are subsequently computed using quantum algorithms. Our comprehensive analysis explores the achievable accuracy in recovering correlation energies when hundreds of orbitals are downfolded into a problem size tractable by today’s quantum hardware. We argue that such flexible hybrid algorithms, where problem size can be tailored to available quantum resources, can serve as a bridge between noisy intermediate-scale quantum devices and future fault-tolerant quantum computers, marking a step toward the early realization of quantum advantage in chemistry.
Although the simulation of quantum chemistry is one of the most anticipated applications of quantum computing, the scaling of known upper bounds on the complexity of these algorithms is daunting. Prior work has bounded errors due to discretization of the time evolution (known as ``Trotterization'') in terms of the norm of the error operator and analyzed scaling with respect to the number of spin orbitals. However, we find that these error bounds can be loose by up to 16 orders of magnitude for some molecules. Furthermore, numerical results for small systems fail to reveal any clear correlation between ground-state error and number of spin orbitals. We instead argue that chemical properties, such as the maximum nuclear charge in a molecule and the filling fraction of orbitals, can be decisive for determining the cost of a quantum simulation. Our analysis motivates several strategies to use classical processing to further reduce the required Trotter step size and estimate the necessary number of steps, without requiring additional quantum resources. Finally, we demonstrate improved methods for state preparation techniques which are asymptotically superior to proposals in the simulation literature.
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.