Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation
arXiv:2405.03754 · doi:10.22331/q-2025-04-01-1682
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 (76)
- Quantum Computing in the NISQ era and beyond
- A variational eigenvalue solver on a quantum processor
- Adiabatic Quantum Computing
- Selective review of offline change point detection methods
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- An adaptive variational algorithm for exact molecular simulations on a quantum computer
- Hamiltonian Simulation by Qubitization
- Optimal Hamiltonian Simulation by Quantum Signal Processing
- Preparation of Entangled States by Quantum Markov Processes
- Towards Practical Quantum Variational Algorithms
- Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
- Shortcuts to adiabaticity
- Toward the first quantum simulation with quantum speedup
- A Theory of Trotter Error
- Efficient numerical simulations with Tensor Networks: Tensor Network Python (TeNPy)
- Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
- Cloud Quantum Computing of an Atomic Nucleus
- Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
- A random compiler for fast Hamiltonian simulation
- Sequential generation of entangled multi-qubit states
- Is there evidence for exponential quantum advantage in quantum chemistry?
- Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
- The power of quantum systems on a line
- Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
- Faster quantum simulation by randomization
- A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits
- Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices
- Encoding of Matrix Product States into Quantum Circuits of One- and Two-Qubit Gates
- A Kernel Multiple Change-point Algorithm via Model Selection
- Measurements as a roadblock to near-term practical quantum advantage in chemistry: resource analysis
- Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems
- Universal Quantum Hamiltonians
- Early Fault-Tolerant Quantum Computing
- A randomized quantum algorithm for statistical phase estimation
- Even shorter quantum circuit for phase estimation on early fault-tolerant quantum computers with applications to ground-state energy estimation
- Quantum computing of the Li nucleus via ordered unitary coupled clusters
- Simulation of Collective Neutrino Oscillations on a Quantum Computer
- Counterdiabatic Optimised Local Driving
- Prospects of Quantum Computing for Molecular Sciences
- Variational Benchmarks for Quantum Many-Body Problems
- Variational Quantum Eigensolver for Frustrated Quantum Systems
- Quantum algorithm for ground state energy estimation using circuit depth with exponentially improved dependence on precision
- Simulating key properties of lithium-ion batteries with a fault-tolerant quantum computer
- Quantum phase detection generalisation from marginal quantum neural network models
- Constant-depth preparation of matrix product states with adaptive quantum circuits
- Nuclear shell-model simulation in digital quantum computers
- Hybridized Methods for Quantum Simulation in the Interaction Picture
- Initial state preparation for quantum chemistry on quantum computers
- Randomizing multi-product formulas for Hamiltonian simulation
- Quantum digital cooling
- Inferring pointwise diffusion properties of single trajectories with deep learning
- Well-conditioned multi-product formulas for hardware-friendly Hamiltonian simulation
- Hardware-efficient quantum algorithm for the simulation of open-system dynamics and thermalisation
- qSWIFT: High-order randomized compiler for Hamiltonian simulation
- Statistical phase estimation and error mitigation on a superconducting quantum processor
- Optimal Trotterization in universal quantum simulators under faulty control
- Quantum Multiple Eigenvalue Gaussian filtered Search: an efficient and versatile quantum phase estimation method
- Finite-size criticality in fully connected spin models on superconducting quantum hardware
- Composite Quantum Simulations
- Importance sampling for stochastic quantum simulations
- State Preparation Boosters for Early Fault-Tolerant Quantum Computation
- Local Hamiltonians in Quantum Computation
- Double-bracket quantum algorithms for diagonalization
- Counterdiabatic optimized driving in quantum phase sensitive models
- Quantum error mitigation for Fourier moment computation
- Modeling the Performance of Early Fault-Tolerant Quantum Algorithms
- Quantum Chemistry Calculations using Energy Derivatives on Quantum Computers
- Doubling the order of approximation via the randomized product formula
- Probing spectral features of quantum many-body systems with quantum simulators
- Hybrid Ground-State Quantum Algorithms based on Neural Schrödinger Forging
- Efficient ground-state energy estimation and certification on early fault-tolerant quantum computers
- Hybrid quantum programming with PennyLane Lightning on HPC platforms
- Comparing Classical and Quantum Ground State Preparation Heuristics
- Better bounds for low-energy product formulas
- Quantum Phase Estimation without Controlled Unitaries
- Ground State Preparation via Dynamical Cooling
Cited by in corpus (8)
- 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
- Feasibility of performing quantum chemistry calculations on quantum computers
- Double-bracket quantum algorithms for high-fidelity ground state preparation