Beyond asymptotic reasoning: the practicalities of a quantum ground state projector based on the wall-Chebyshev expansion
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912816236068864 |
|---|---|
| author | Filip, Maria-Andreea Fitzpatrick, Nathan |
| author_facet | Filip, Maria-Andreea Fitzpatrick, Nathan |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_00533 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Beyond asymptotic reasoning: the practicalities of a quantum ground state projector based on the wall-Chebyshev expansion Filip, Maria-Andreea Fitzpatrick, Nathan Quantum Physics Chemical Physics 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. |
| title | Beyond asymptotic reasoning: the practicalities of a quantum ground state projector based on the wall-Chebyshev expansion |
| topic | Quantum Physics Chemical Physics |
| url | https://arxiv.org/abs/2508.00533 |