Quadratically Shallow Quantum Circuits for Hamiltonian Functions
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866918262595387392 |
|---|---|
| author | Park, Youngjun Kang, Minhyeok Park, Chae-Yeun Huh, Joonsuk |
| author_facet | Park, Youngjun Kang, Minhyeok Park, Chae-Yeun Huh, Joonsuk |
| contents | Many quantum algorithms for ground-state preparation and energy estimation require the implementation of high-degree polynomials of a Hamiltonian to achieve better convergence rates. Their circuit implementation typically relies on quantum signal processing (QSP), whose circuit depth is proportional to the degree of the polynomial. Previous studies exploit the Chebyshev polynomial approximation, which requires a Chebyshev series of degree $O(\sqrt{n\ln(1/δ)})$ for an $n$-degree polynomial, where $δ$ is the approximation error. However, the approximation is limited to only a few functions, including monomials, truncated exponential, Gaussian, and error functions. In this work, we present the most generalized function approximation methods for $δ$-approximating linear combinations or products of polynomial-approximable functions with quadratically reduced-degree polynomials. We extend the list of polynomial-approximable functions by showing that the functions of cosine and sine can also be $δ$-approximated by quadratically reduced-degree Laurent polynomials. We demonstrate that various Hamiltonian functions for quantum ground-state preparation and energy estimation can be implemented with quadratically shallow circuits. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_04059 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quadratically Shallow Quantum Circuits for Hamiltonian Functions Park, Youngjun Kang, Minhyeok Park, Chae-Yeun Huh, Joonsuk Quantum Physics Many quantum algorithms for ground-state preparation and energy estimation require the implementation of high-degree polynomials of a Hamiltonian to achieve better convergence rates. Their circuit implementation typically relies on quantum signal processing (QSP), whose circuit depth is proportional to the degree of the polynomial. Previous studies exploit the Chebyshev polynomial approximation, which requires a Chebyshev series of degree $O(\sqrt{n\ln(1/δ)})$ for an $n$-degree polynomial, where $δ$ is the approximation error. However, the approximation is limited to only a few functions, including monomials, truncated exponential, Gaussian, and error functions. In this work, we present the most generalized function approximation methods for $δ$-approximating linear combinations or products of polynomial-approximable functions with quadratically reduced-degree polynomials. We extend the list of polynomial-approximable functions by showing that the functions of cosine and sine can also be $δ$-approximated by quadratically reduced-degree Laurent polynomials. We demonstrate that various Hamiltonian functions for quantum ground-state preparation and energy estimation can be implemented with quadratically shallow circuits. |
| title | Quadratically Shallow Quantum Circuits for Hamiltonian Functions |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2510.04059 |