We present a comprehensive theoretical analysis of quantum subspace diagonalization methods for molecular electronic structure calculations, establishing rigorous complexity bounds and convergence guarantees. Building on recent developments in adaptive quantum algorithms for chemical systems, we formulate a general mathematical framework that describes how quantum computers can efficiently explore molecular potential energy surfaces through iterative subspace construction. Our theory characterizes the relationship between subspace dimension, basis set selection, and solution accuracy for ground and excited state calculations. We derive analytical expressions for the number of quantum measurements required to achieve chemical accuracy and establish conditions under which quantum subspace methods offer polynomial advantages over classical approaches. The framework incorporates realistic noise models, providing performance predictions for near-term quantum devices. We analyze trade-offs between circuit depth, measurement overhead, and solution quality, identifying optimal operating regimes for different molecular systems. Special attention is devoted to transition-state mapping for chemical reactions, where we prove that adaptive subspace selection achieves exponential reduction in required measurements compared to uniform sampling. Applications to battery electrolyte reactions, drug discovery, and materials design demonstrate the practical utility of our theoretical predictions. This work establishes quantum subspace methods as a rigorous alternative to variational approaches, offering theoretical guarantees absent in parameter-optimization-based algorithms while maintaining compatibility with near-term quantum hardware constraints.
We present a comprehensive theoretical analysis of quantum subspace diagonalization methods for molecular electronic structure calculations, establishing rigorous complexity bounds and convergence guarantees. Building on recent developments in adaptive quantum algorithms for chemical systems, we formulate a general mathematical framework that describes how quantum computers can efficiently explore molecular potential energy surfaces through iterative subspace construction. Our theory characterizes the relationship between subspace dimension, basis set selection, and solution accuracy for ground and excited state calculations. We derive analytical expressions for the number of quantum measurements required to achieve chemical accuracy and establish conditions under which quantum subspace methods offer polynomial advantages over classical approaches. The framework incorporates realistic noise models, providing performance predictions for near-term quantum devices. We analyze trade-offs between circuit depth, measurement overhead, and solution quality, identifying optimal operating regimes for different molecular systems. Special attention is devoted to transition-state mapping for chemical reactions, where we prove that adaptive subspace selection achieves exponential reduction in required measurements compared to uniform sampling. Applications to battery electrolyte reactions, drug discovery, and materials design demonstrate the practical utility of our theoretical predictions. This work establishes quantum subspace methods as a rigorous alternative to variational approaches, offering theoretical guarantees absent in parameter-optimization-based algorithms while maintaining compatibility with near-term quantum hardware constraints.
Accurate prediction of molecular structures and properties is vital for chemistry; materials science, and drug discovery, yet classical electronic-structure methods often fail for strongly correlated systems, large basis sets, and complex potential-energy landscapes. Quantum technology encompassing quantum computing, quantum machine learning, and hybrid quantum classical strategies offers a fundamentally new paradigm by encoding many-electron wave functions directly on qubits and exploiting superposition and entanglement to explore exponentially large Hilbert spaces. This review synthesizes recent algorithmic and hardware advances relevant to molecular modelling, including the Variational Quantum Eigensolver (VQE), Quantum Phase Estimation (QPE), quantum unitary coupled-cluster (q-UCC) families, equation-of-motion and subspace methods for excited states, tensor-network hybrids, and quantum kernel and variational QML approaches. We examine noise-aware hybrid workflows, error-mitigation techniques, symmetry-preserving ansätze, and operator-factorization methods that reduce measurement and gate overhead. Representative applications are discussed: ground- and excited-state energy prediction, potential-energy surface mapping, geometry and transition-state optimization, spectroscopic property estimation (IR, UV–Vis, NMR, EPR), and reaction-dynamics scenarios where non-adiabatic effects and conical intersections dominate. Resource estimates and scaling analyses clarify current NISQ limitations qubit counts, circuit depth, shot complexity and delineate the roadmap to fault-tolerant QPE for chemical accuracy. We compare quantum approaches with classical baselines (DFT, CCSD (T), multireference methods), identifying domains where quantum methods already show promise (strong correlation, multi-reference dissociation, spin-state ordering) and where classical methods remain competitive. Finally, we highlight near-term industrial opportunities in drug design, catalysis, CO2 capture, and energy materials, and outline critical research directions: algorithmic reductions in measurement/precision cost, hardware improvements in fidelity and connectivity, scalable ansatz design, and integrated software stacks for reproducible hybrid simulations. Together, these developments indicate that while practical, large-scale quantum advantage for general chemistry remains future work, quantum technologies are rapidly maturing into powerful tools for targeted molecular problems that are intractable with existing classical techniques.
Problems in quantum chemical simulations, especially achieving accurate excited-state potential energy surfaces, are among the primary applications to achieve quantum utility. On near-term quantum hardware, variants of the variational quantum eigensolver (VQE) algorithms are the primary choice for chemistry simulation. In this study, a combination of leading ground and excited state quantum algorithms for general excited states, namely, ADAPT-VQE/LUCJ and q-sc-EOM, are utilized to calculate accurate excited state potential energy surfaces in challenging bond-breaking scenarios and compared with the classical scalable EOM-CCSD method. This work investigates avenues toward quantum utility in excited-state quantum chemistry using the q-sc-EOM approach. We assess its accuracy while mitigating major scaling bottlenecks through the Davidson algorithm and basis rotation grouping, reducing the measurement scaling from O(N12) to O(N5), and implementing the method on quantum hardware with various error mitigation strategies to reduce gate and measurement errors in excited states. The hardware implementation of the q-sc-EOM algorithm, augmented by mitigation of M3 readout error and symmetry projection, produces reasonably accurate excited-state energies with gate noise identified as the predominant source of error. This paves the way for accurate and scalable, generally applicable quantum excited-state methods with potential for quantum utility while identifying critical problems that require advancements.
In ab-initio quantum chemistry, solving the electronic structure problem of a molecular system of interest to obtain an approximation of the ground and, in some cases, the excited state energies is a core and central task in various quantum chemistry processes. These include, but certainly not limited to, the calculation of the activation energy–that is the minimal energy required to launch a given chemical reaction–, the dipole and multipole moments which describe the polarity of the molecule, performing the optimization of the geometry of the molecule and searching for transition states. Furthermore, many quantum chemistry applications are predicated, not merely on the approximation of the ground state energy, but also on the corresponding first order derivatives. The body of literature of classical algorithms approximating the ground state energy and its first order derivative is extensively rich with a plethora of methods such as self-consistent mean-field methods, coupled-cluster methods, density matrix renormalization group and many more, each of which has intrinsic set of properties and characteristics that makes it suitable for specific tasks and cases. However, classical methods face a practically insurmountable challenge: the efficient computation of high accuracy approximation of ground state energies of large system sizes. This is fundamentally because the electronic structure problem provably belongs to the complexity class of QMA-hard problems. Which also means that it is out of reach for quantum algorithms as well in general. However, with certain assumptions that are expected to hold molecules of interest–that so far proved to be classically challenging because the required accuracy set by the standard of chemical accuracy threshold (generally held in quantum chemistry)– quantum algorithms can efficiently treat such cases. While originally theorized by Richard Feynmann as a potentially efficient way of simulating some classically intractable many-body systems, quantum computing has since proven to have a stronger and richer potential paving the way for the inception of new algorithms such as Shor’s algorithm for integer factorization, HHL for solving linear system of equation and Grover’s algorithm for constrained binary search, just to name a few. These algorithms provably exhibit an improvement rate that goes respectively exponentially and quadratically in the time complexity. Quantum chemistry is considered a prominent candidate to benefit from quantum computing given the variety of quantum algorithms put forth to solve the electronic structure problem of particular systems of interest. These quantum algorithm proposals can be broadly categorized in three main categories that span the spectrum: from noisy intermediate scale quantum (NISQ) computers to early and full scale fault tolerant quantum ((E)FTQC) computers. Firstly, the variational quantum eigensolver (VQE) family of quantum algorithms which variationally search for the ground state energy through the optimization of the energy of a parametrized state prepared in a quantum computer using an ansatz. Secondly, the quantum Krylov subspace diagonalization (QKSD) methods, which generate a subspace of the original Hilbert space and efficiently produce the lowest energy in said subspace as its output. Lastly, we have the quantum phase estimation (QPE) algorithms, which provably produce the ground state energy in Heisenberg scaling presenting hence a provable efficient solution. In this thesis, we firstly set to work on the problem of efficient Hamiltonian linear combination of unitaries (LCU) representation. This is mainly motivated by the wide-range impact an efficient compression of the Hamiltonian can potentially have on several quantum algorithms such as VQE, QPE...etc. We designed a method that efficiently compress the Hamiltonian representation in a way that is beneficially impactful across the set of the aforementioned quantum algorithms. Namely, we motivate and present in Sections 1.3 and 1.4 respectively, the regularized compressed double-factorization (RC-DF) and show how it reduces the energy measurement complexity both in terms of number of distinct observables and number of samples. Moreover, it also reduces the total depth of the quantum phase estimation circuit thanks to its low normalization factor. Secondly, given the importance of the energy derivatives, in Sections 2.1 and 2.2, we introduce and present an efficient quantum algorithm for the calculation of the analytic gradient of VQE energies of double-factorized Hamiltonians. Furthermore, in Section 2.1, we expand on the utility of RC-DF by presenting a quantum algorithm that determines the analytic gradient of energies measured with respect to RC-DF Hamiltonains. Third, in Section 3.1, we summarize the theoretical results of purification error-mitigation techniques, namely echo verification and virtual distillation. In Section 3.2, we report on the results of the experimental bench mark, of said techniques, performed on on Google’s Sycamore device to validate the theoretical scaling of error suppression and extrapolate the resources needed for classically intractable system sizes. Fourth, in Section 4 we establish the challenges of computing energy gradients in a quantum Krylov frame work. To overcome the problem, we provide, in Section 4.3, an efficient quantum algorithm for calculating energy derivative obtained through QKSD procedures. Our approach shows how the QKSD ground state can be prepared using quantum signal processing (QSP) and reduces the number of observables to O(1) per reduced density matrix (RDM). Lastly, in light of the importance of quantum RAMs due to their utility in a variety of quantum algorithms that require efficient initial state preparation, as explained in Section 5.5, we address the problematic exponential depth of the bucket-brigade QRAM (when decomposed). We present in Section 5.6 a very efficient Clifford+T decomposition of the bucket-brigade QRAM, which preserves the linear scaling of the depth of the circuit without introducing any additional ancilla.
The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm designed for noisy intermediate-scale quantum (NISQ) hardware to estimate eigenvalues of many-body Hamiltonians. Unlike fully quantum approaches such as quantum phase estimation (QPE), VQE trades deep coherent circuits for repeated state preparation, measurement, and classical optimization, making it more compatible with limited qubit counts and finite coherence times. Recent developments have focused on reducing quantum resource requirements while retaining chemically meaningful wavefunction structure. In this paper, we examine recent progress in VQE methods for molecular electronic structure with an emphasis on three themes: (i) strategies for circuit and ansatz complexity reduction, including adaptive and selectively screened approaches, (ii) chemically motivated workflows that combine VQE with orbital optimization, fragmentation, and localized active-space ideas to better address strong correlation, and (iii) extensions of VQE to excited-state calculations. Throughout, we emphasize the tradeoffs among parameter count, gate depth, symmetry preservation, measurement overhead, and classical preprocessing, and discuss where these approaches may become most useful for chemically challenging active spaces. We also highlight benchmarking considerations for assessing both accuracy and resource requirements, and conclude with a perspective on regimes in which VQE may offer the greatest long-term value, particularly multireference active spaces and low-lying excited-state manifolds.
Accurately capturing electron correlation in large-scale molecular systems remains one of the foremost challenges in quantum chemistry and a primary driver for the development of quantum algorithms. Classical configuration-interaction methods, while rigorous, suffer from exponential scaling, rendering them impractical for large or strongly correlated systems. Overcoming this limitation is central to realizing the promise of quantum computing in chemistry. Here, we investigate the pyridine-Li ion complex using three quantum algorithms: the variational quantum eigensolver (VQE), the subspace quantum diagonalization (SQD) method, and the recently introduced handover iterative VQE (HI-VQE). Our results demonstrate how new generations of hybrid quantum-classical frameworks overcome the scalability and noise sensitivity that constrain conventional VQE approaches. SQD and HI-VQE achieve ground-state energy calculations for problem sizes inaccessible to classical computation, marking a clear advance toward quantum advantage. In particular, HI-VQE enables calculations within active spaces as large as (24e,22o), requiring 44 qubits-well beyond the reach of classical CASCI and VQE. This capability provides a systematic pathway for incorporating increasing numbers of electrons into quantum treatment, thereby approaching exact molecular energies. Importantly, both SQD and HI-VQE exhibit robustness against hardware noise, a critical improvement over earlier approaches. By enabling quantum simulations of molecular systems previously deemed intractable, SQD and HI-VQE offer a realistic route toward practical quantum advantage in computational chemistry. The comparison between HI-VQE and SQD shows that optimizing circuit parameters is crucial for accurate simulation.
Quantum computers offer the potential to simulate chemical systems beyond the capabilities of classical computers. However, current quantum computing approaches to ab initio molecular dynamics (AIMD) and vibrational analysis largely rely on the Variational Quantum Eigensolver (VQE), whose circuit depth, iterative optimization, and measurement overhead hinder the practical simulation of molecular systems. Here, we extend Sample-based Quantum Diagonalization (SQD), a quantum sampling-based electronic-structure method, to AIMD and vibrational analysis on noisy quantum hardware. The resulting framework enables nuclear forces and Hessians to be derived from quantum-computed electronic energies, facilitating molecular dynamics and characterization of potential energy surfaces. We demonstrate the approach using diverse molecular processes, including H2 bond vibration, the proton-exchange reaction (H+ + H2), the bimolecular nucleophilic substitution (SN2) reaction (Cl- + CH3Cl), and proton-transfer dynamics between two water molecules involving transient formation of the Zundel cation (H2O···H+···OH2). Across these systems, SQD-AIMD trajectories and vibrational frequencies obtained with noisy quantum hardware/noise-models show excellent agreement with classical reference calculations and substantially improved accuracy relative to previously reported VQE-based simulations. Importantly, the SQD-based approach eliminates costly variational optimization and significantly reduces measurement requirements relative to VQE, enabling AIMD simulations spanning approximately 500 timesteps (∼200 fs), substantially longer than previously reported AIMD simulations on quantum hardware. These results establish SQD-AIMD and SQD-vibrational analysis as practical and scalable frameworks for simulating chemical reaction dynamics and elucidating reaction mechanisms on near-term quantum hardware, extending quantum computing applications beyond static electronic structure calculations.