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.
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.
Quantum chemistry is envisioned as an early and disruptive application for quantum computers. Yet, closer scrutiny of the proposed algorithms shows that there are considerable difficulties along the way. Here, we propose two criteria for evaluating two leading quantum approaches for finding the ground state of molecules. The first criterion applies to the variational quantum eigensolver (VQE) algorithm. It sets an upper bound to the level of imprecision/decoherence that can be tolerated in quantum hardware as a function of the targeted precision, the number of gates and the typical energy contribution from states populated by decoherence processes. We find that decoherence is highly detrimental to the accuracy of VQE and performing relevant chemistry calculations would require performances that are expected for fault-tolerant quantum computers, not mere noisy hardware, even with advanced error mitigation techniques. Physically, the sensitivity of VQE to decoherence originates from the fact that, in VQE, the spectrum of the studied molecule has no correlation with the spectrum of the quantum hardware used to perform the computation. The second criterion applies to the quantum phase estimation (QPE) algorithm, which is often presented as the go-to replacement of VQE upon availability of (noiseless) fault-tolerant quantum computers. QPE requires an input state with a large enough overlap with the sought-after ground state. We provide a criterion to estimate quantitatively this overlap based on the energy and the energy variance of said input state. Using input states from a variety of state-of-the-art classical methods, we show that the scaling of this overlap with system size does display the standard orthogonality catastrophe, namely an exponential suppression with system size. This in turns leads to an exponentially reduced QPE success probability.
Quantum computing holds promise for addressing challenges in quantum chemistry. The foundational Quantum Phase Estimation (QPE) algorithm, established early on, remains the state-of-the-art for this field. However, there are considerable opportunities for refinement across its building blocks, spanning from the preparation of initial states to the circuit decomposition of general quantum oracles. In particular, bridging the gap between efficient classical pre-computation and asymptotically advantageous quantum post-processing seems to be a natural approach towards achieving an advantage during the early stages of fault-tolerant quantum computing
Quantum computing is expected to offer exponential or polynomial speedups over classical computing for many socially important problems, including integer factorization, combinatorial optimization, and quantum chemistry.This promise has fueled strong expectations for quantum computers as next-generation computing infrastructure.Most algorithms with provable quantum advantage require large-scale quantum error correction, making fault-tolerant quantum computers (FTQC) essential.However, currently available devices are noisy intermediate-scale quantum (NISQ) devices, and further breakthroughs, such as advances in large-scale integration, are required to realize practical implementations of quantum error correction.
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-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 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.
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 advancements in classical computational components such as CPUs and GPUs have had a reverberating impact on the democratization of computational power available, with the field of computational chemistry reaping significant benefits from the propulsion of the limits of systems studied. The accurate prediction of chemical properties and reaction dynamics through computational simulation is now a centerpiece of modern chemical research, significantly accelerating discoveries research areas of materials science and drug development, as well as industrially relevant processes such as the emission of aldehydes from soft foams, flame retardants and pyrolysis and the carbonylation of epoxides. These achievements of computational chemistry still are overshadowed in the face of fundamental bottlenecks where classical methods remain constrained by the exponential scaling when treating large and/or strongly correlated quantum many-body systems. This innate computational complexity often constitutes chemically accurate calculations based on first principles impractical, or plain impossible, for systems beyond modest sizes. Quantum computing offers a potential pathway around these limitations, originally formally formulated by David Deutsch as a tool for simulating quantum systems, with the first quantum algorithms indicating speed-ups compared to classical counterparts arising from Peter Shor and Lov Grover for the prime factorization of an integer number and unstructured search respectively. Relying on fundamental theorems by Claude Shannon, it has been demonstrated that through the use of error-correcting codes fault-tolerant quantum computers are able to safeguard information against noise and decoherence, strongly indicating towards exponential speedups in solving central computational chemistry problems, such as determining ground state energies or reaction pathways of chemical systems. Substantial strides in experimental quantum computing over the past decade, including proof-of-principle demonstrations of quantum error correction, mean to bring full-scale fault-tolerant quantum computing within the grasp of humanity. The breakthroughs needed to attain scalable, error-corrected quantum computation with capabilities exceeding those of classical methods in real-world scenarios is likely still some years away. While striving to address the engineering challenges standing in the way of achieving fault tolerant quantum computing, substantial effort has been focused toward developing and benchmarking hybrid algorithms tailored for the Noisy Intermediate- Scale Quantum (NISQ) devices, available now to researchers. These hybrid quantum-classical algorithms, with the most notable being the Variational Quantum Eigensolver (VQE), allow the probing of quantum computing’s utility in computational chemistry even in the face of significant hardware noise and limited coherence times. The work presented in this thesis introduces several key additions the VQE framework, geared especially towards to NISQ hardware, where the mindful use of available resources is imperative. First, the implementation of the Conjugate Model Search optimizer is described, an optimization method that integrates simple models that are surrogate to the original function, combined with conjugate gradient optimization to navigate effectively parameter landscapes typical of variational algorithms, prone to noise. Second, this thesis contains the proposal and extensive study of a hyperparameter tuning procedure employing genetic algorithms, allowing for comprehensive simulation benchmarks that augment the robustness and efficiency of VQE implementations with respect to convergence time through real wall-time models of quantum processors. Continuing, a bridge is presented between quantum simulation and quantum chemistry, through qubit-to-fermion mappings of existing quantum gates, further enabling the direct and accurate modeling of chemical systems on trapped atom quantum hardware with the added arsenal provided by techniques designed for qubit architectures. Additionally, experimental data contained in this thesis include detailed benchmarking data collected from state-of-the-art trapped ion quantum processors available at the Johannes Gutenberg Universität Mainz, demonstrating the actual viability and performance of various methodologies for extracting results. Lastly, the state of VQE is examined, as it served as a springboard for a plethora of advancements in the development of quantum computing hardware, as well as the direction the field of simulation of computational quantum chemistry via quantum devices is headed towards in the coming years.