2025/08/01 by Maria-Andreea Filip, Nathan Fitzpatrick, Filip, Maria-Andreea +1
Computer Science · Physics and Astronomy · #Chemical Physics (physics.chem-ph) #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.2508.00533
openalex publication_date 2025/08/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider a quantum algorithm for ground-state preparation based on a Chebyshev series approximation to the wall function. In a classical setting, this approach is appealing as it guarantees rapid convergence. We analyze the asymptotic scaling and success probabilities of different quantum implementations and provide numerical benchmarks, comparing the performance of the wall-Chebyshev projectors with current state-of-the-art approaches. We find that this approach requires fewer serial applications of the Hamiltonian oracle to achieve a given ground state fidelity, but is severely limited by exponentially decaying success probability. However, we find that some implementations maintain non-trivial success probability in regimes where wall-Chebyshev projection leads to a fidelity improvement over other approaches. As the wall-Chebyshev projector is highly robust to loose known upper bounds on the true ground state energy, it offers a potential resource trade-off, particulary in the early fault-tolerant regime of quantum computation.