Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation

Abstract

We investigate the feasibility of early fault-tolerant quantum algorithms focusing on ground-state energy estimation problems. In particular, we examine the computation of the cumulative distribution function (CDF) of the spectral measure of a Hamiltonian and the identification of its discontinuities. Scaling these methods to larger system sizes reveals three key challenges: the smoothness of the CDF for large supports, the lack of tight lower bounds on the overlap with the true ground state, and the difficulty of preparing high-quality initial states. To address these challenges, we propose a signal processing approach to find these estimates automatically, in the regime where the quality of the initial state is unknown. Rather than aiming for exact ground-state energy, we advocate for improving classical estimates by targeting the low-energy support of the initial state. Additionally, we provide quantitative resource estimates, demonstrating a constant-factor improvement in the number of samples required to detect a specified change in CDF. Our numerical experiments, conducted on a 26-qubit fully connected Heisenberg model, leverage a truncated density-matrix renormalization group (DMRG) initial state with a low bond dimension. The results show that the predictions from the quantum algorithm align closely with the DMRG-converged energies at larger bond dimensions while requiring several orders of magnitude fewer samples than theoretical estimates suggest. These findings underscore that CDF-based quantum algorithms are a practical and resource-efficient alternative to quantum phase estimation, particularly in resource-constrained scenarios.

22 pages, 10 figures, code available

References in corpus (15)

• The power of quantum systems on a line
• Early Fault-Tolerant Quantum Computing
• Variational Quantum Eigensolver for Frustrated Quantum Systems
• Constant-depth preparation of matrix product states with adaptive quantum circuits
• Initial state preparation for quantum chemistry on quantum computers
• Optimal Trotterization in universal quantum simulators under faulty control
• Quantum Multiple Eigenvalue Gaussian filtered Search: an efficient and versatile quantum phase estimation method
• Local Hamiltonians in Quantum Computation
• Counterdiabatic optimized driving in quantum phase sensitive models
• Quantum error mitigation for Fourier moment computation
• Hybrid quantum programming with PennyLane Lightning on HPC platforms
• Comparing Classical and Quantum Ground State Preparation Heuristics
• Ground State Preparation via Dynamical Cooling
• Better bounds for low-energy product formulas
• Quantum Phase Estimation without Controlled Unitaries

Cited by in corpus (7)

• Fault-tolerant quantum algorithms for quantum molecular systems: A survey
• Statistics of topological defects across a phase transition in a digital superconducting quantum processor
• Error mitigation and circuit division for early fault-tolerant quantum phase estimation
• Toward scalable quantum computations of atomic nuclei
• Exponential distillation of dominant eigenproperties
• High-precision and low-depth quantum algorithm design for eigenstate problems
• Double-bracket quantum algorithms for high-fidelity ground state preparation