Enhancing Scalability of Quantum Eigenvalue Transformation of Unitary Matrices for Ground State Preparation through Adaptive Finer Filtering
arXiv:2401.09091 · doi:10.22331/q-2025-02-06-1624
Abstract
Hamiltonian simulation is a domain where quantum computers have the potential to outperform their classical counterparts. One of the main challenges of such quantum algorithms is increasing the system size, which is necessary to achieve meaningful quantum advantage. In this work, we present an approach to improve the scalability of eigenspace filtering for the ground state preparation of a given Hamiltonian. Our method aims to tackle limitations introduced by a small spectral gap and high degeneracy of low energy states. It is based on an adaptive sequence of eigenspace filtering through Quantum Eigenvalue Transformation of Unitary Matrices (QETU) combined with spectrum profiling. By combining our proposed algorithm with state-of-the-art phase estimation methods, we achieved good approximations for the ground state energy with local, two-qubit gate depolarizing probability up to . To demonstrate the key results in this work, we ran simulations with the transverse-field Ising Model on classical computers using Qiskit. We compare the performance of our approach with the static implementation of QETU and show that we can consistently achieve three to four orders of magnitude improvement in the absolute error rate.
References in corpus (35)
- Quantum computational chemistry
- Adiabatic Quantum Computing
- Simulated Quantum Computation of Molecular Energies
- Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
- Quantum algorithms for quantum chemistry and quantum materials science
- Maintaining coherence in Quantum Computers
- Quantum Computation by Adiabatic Evolution
- Quantum measurements and the Abelian Stabilizer Problem
- Bounds for the adiabatic approximation with applications to quantum computation
- Quantum Computers, Factoring, and Decoherence
- Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
- Approximate Quantum Fourier Transform and Decoherence
- Near-optimal ground state preparation
- Mitigating depolarizing noise on quantum computers with noise-estimation circuits
- Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices
- Crossing a topological phase transition with a quantum computer
- Preparing ground states of quantum many-body systems on a quantum computer
- Algorithms for quantum simulation at finite energies
- Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems
- Preparation of matrix product states with log-depth quantum circuits
- Even shorter quantum circuit for phase estimation on early fault-tolerant quantum computers with applications to ground-state energy estimation
- Classically optimized Hamiltonian simulation
- Prospects of Quantum Computing for Molecular Sciences
- Towards adiabatic quantum computing using compressed quantum circuits
- Single-ancilla ground state preparation via Lindbladians
- On low-depth algorithms for quantum phase estimation
- Finding Angles for Quantum Signal Processing with Machine Precision
- Characterizing low-frequency qubit noise
- Transformation of quantum states using uniformly controlled rotations
- Riemannian quantum circuit optimization for Hamiltonian simulation
- Nonergodic measurements of qubit frequency noise
- Efficient Quantum Algorithm for Filtering Product States
- Error Correction of Quantum Algorithms: Arbitrarily Accurate Recovery Of Noisy Quantum Signal Processing
- Faster ground state preparation and high-precision ground energy estimation with fewer qubits
- Thermal relaxation error on QKD: Effect and A Probable Bypass