We evaluate deterministic higher-order product formulae for molecular ground-state energy estimation. Motivated by recent fault-tolerant architectures in which non-Clifford operations may be generated more locally and cheaply than in conventional assumptions, we re-examine such formulae as practical candidates for quantum chemistry. Using one-dimensional hydrogen chains from $\mathrm{H}_2$ to $\mathrm{H}_{15}$ as benchmarks, we estimate both the total gate count and the depth of $R_Z$-rotation layers required to reach a target energy error. To make this comparison feasible at larger system sizes, we use a perturbative method to estimate the eigenvalue error induced by each product formula and thereby evaluate the cost of the corresponding phase-estimation procedure. Among the previously considered formulae, the eighth-order construction introduced by Morales et al. [M. E. S. Morales et al., "Greatly improved higher-order product formulae for quantum simulation," arXiv:2210.15817v2 (2024)] minimizes both cost metrics in the benchmark at a chemically relevant target error. We also find that increasing the formal order does not automatically reduce the total cost: near chemical accuracy, the tenth-order formula introduced in the same work can be less efficient than the eighth-order one. Motivated by this observation, we construct a new fourth-order formula; it achieves the lowest total gate count among the formulae considered for all H-chain instances near chemical accuracy and over much of the 0.1-10 mHa target-error window for most instances, while also reducing the $R_Z$-layer depth. These results clarify how deterministic higher-order product formulae should be selected for molecular ground-state energy estimation.
We evaluate deterministic higher-order product formulae for molecular ground-state energy estimation. Motivated by recent fault-tolerant architectures in which non-Clifford operations may be generated more locally and cheaply than in conventional assumptions, we re-examine such formulae as practical candidates for quantum chemistry. Using one-dimensional hydrogen chains from H2 to H15 as benchmarks, we estimate both the total gate count and the depth of RZ-rotation layers required to reach a target energy error. To make this comparison feasible at larger system sizes, we use a perturbative method to estimate the eigenvalue error induced by each product formula and thereby evaluate the cost of the corresponding phase-estimation procedure. Among the previously considered formulae, the eighth-order construction introduced by Morales et al. [M. E. S. Morales et al., "Greatly improved higher-order product formulae for quantum simulation," arXiv:2210.15817v2 (2024)] minimizes both cost metrics in the benchmark at a chemically relevant target error. We also find that increasing the formal order does not automatically reduce the total cost: near chemical accuracy, the tenth-order formula introduced in the same work can be less efficient than the eighth-order one. Motivated by this observation, we construct a new fourth-order formula; it achieves the lowest total gate count among the formulae considered for all H-chain instances near chemical accuracy and over much of the 0.1-10 mHa target-error window for most instances, while also reducing the RZ-layer depth. These results clarify how deterministic higher-order product formulae should be selected for molecular ground-state energy estimation.
A milestone in the field of quantum computing will be solving problems in quantum chemistry and materials faster than state-of-the-art classical methods. The current understanding is that achieving quantum advantage in this area will require some degree of fault tolerance. While hardware is improving towards this milestone, optimizing quantum algorithms also brings it closer to the present. Existing methods for ground state energy estimation are costly in that they require a number of gates per circuit that grows exponentially with the desired number of bits in precision. We reduce this cost exponentially, by developing a ground state energy estimation algorithm for which this cost grows linearly in the number of bits of precision. Relative to recent resource estimates of ground state energy estimation for the industrially-relevant molecules of ethylene-carbonate and PF 6 − , the estimated gate count and circuit depth is reduced by a factor of 43 and 78, respectively. Furthermore, the algorithm can use additional circuit depth to reduce the total runtime. These features make our algorithm a promising candidate for realizing quantum advantage in the era of early fault-tolerant quantum computing.
Quantum architecture search for molecular ground-state estimation is commonly evaluated through energy accuracy, which does not describe circuit cost or the physical properties of the prepared state. We introduce HamQASBench, a structure-aware benchmark comprising eleven molecular Hamiltonians of up to fourteen qubits, selected using Hamiltonian and target-state properties and supplied with exact references. Its evaluation protocol combines energy accuracy and success rates with reference-relative circuit cost, local entropy profiles for non-degenerate targets, and state identification within degenerate ground subspaces. Experiments with five methods spanning four search paradigms reveal differences hidden by energy-only comparisons. On a near-product instance under the shallow search budget, the best outputs of all five methods reach chemical accuracy while using between two and sixty-two gates. Equal-energy outputs on a degenerate instance occupy distinct spin components. Local entropy profiles distinguish inaccurate outputs and show that entangling-gate counts need not reflect realized entanglement. Across the molecular instance ladder, product-state outputs can meet or miss chemical accuracy, motivating interpretation of success alongside target-state properties. These results support retaining energy as the task-success criterion while using circuit-cost and state diagnostics for more informative comparisons. The benchmark instances, references, evaluation implementation, and per-run data are released for reuse.
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.
Emergent quantum computing technologies are widely expected to provide novel approaches in the simulation of quantum chemistry. Despite rapid improvements in the scale and fidelity of quantum computers, high resource requirements make the execution of quantum chemistry experiments challenging. Typical experiments are limited in the number of qubits used, incur a substantial shot cost, or require complex architecture-specific optimization and error mitigation techniques. In this paper, we propose a conceptually simple benchmarking approach involving the use of multi-ancilla quantum phase estimation. Our approach is restricted to very small chemical systems, and does not scale favorably beyond molecular systems that can be described with 2 qubits; however, this restriction allows us to generate circuits that scale quadratically in gate count with the number of qubits in the readout register. This enables the execution of quantum chemistry circuits that act on many qubits, while producing meaningful results with limited shot counts. We use this technique (with 200 shots per experiment) to calculate the ground state energy of molecular hydrogen to 50 bits of precision (8.9×10−16 hartree) on a 56-qubit trapped-ion quantum computer, negating Trotter error. Including Trotter error, we obtain between 32 and 36 bits of precision (1.5∗10−10 and 6.0∗10−11 hartree respectively), vastly exceeding chemical accuracy (1.6∗10−3 hartree) against Full Configuration Interaction. We consider application of the approach to deeper circuits, and discuss potential as a benchmark task for near-term quantum devices.
We present the first demonstration of an end-to-end pipeline with quantum error correction (QEC) for a quantum computation of the electronic structure of molecular systems. We calculate the ground-state energy of molecular hydrogen, using quantum phase estimation (QPE) on qubits encoded with the [[7,1,3]] color code on Quantinuum H2--2. We obtain improvements in computational fidelity by (1) introducing several partially fault-tolerant (FT) techniques for the Clifford+RZ (arbitrary-angle single-qubit rotation) gate set, and (2) integrating Steane QEC gadgets for real-time error correction. In particular, the latter enhances the QPE circuits' performance despite the complexity of the extra QEC circuitry. The encoded circuits contain up to 1585 (546) fixed and 7202 (1702) conditional physical two-qubit gates (mid-circuit measurements), and $\sim3900(\sim$760) total operations are applied on average. The energy E is experimentally estimated to within E−EFCI=0.001(13) hartree, where EFCI denotes the exact ground state energy within the given basis set. Additionally, we conduct numerical simulations with tunable noise parameters to identify the dominant sources of noise. We find that orienting the QEC protocols towards higher memory noise protection is the most promising avenue to improve our experimental results.
Quantum phase estimation requires simulating the evolution of the Hamiltonian, for which product formulas are attractive due to their smaller qubit cost and ease of implementation. However, the estimation of the error incurred by product formulas is usually pessimistic and task-agnostic, which poses problems for assessing their performance in practice for problems of interest. In this work, we study the error of product formulas for the specific task of quantum energy estimation. To this end, we employ the theory of Trotter error with a Magnus-based expansion of the effectively simulated Hamiltonian. The result is a generalization of previous energy estimation error analysis of gapped eigenstates to arbitrary order product formulas. As an application, we discover a 9-term second-order product formula with an energy estimation error that is quadratically better than Trotter-Suzuki. Furthermore, by leveraging recent work on low-energy dynamics of product formulas, we provide tighter bounds for energy estimation error in the low-energy subspace. We show that for Hamiltonians with some locality and positivity properties, the cost can achieve up to a quadratic asymptotic speedup in terms of the target error.