analiza aiqbench
This paper proposes a quantum Hamiltonian simulation method that estimates observables after time evolution with near-linear cost in evolution time, using product formulas and cardinal sine interpolation instead of extra block-encoding qubits. For quantum computing readers, the practical gain is a potentially lower qubit overhead than Quantum Signal Processing approaches at comparable polylogarithmic error scaling. The claims are asymptotic, so real-hardware advantage depends on constant factors and on how the method performs once circuit depth and noise are accounted for.
All you need is Trotter
arXiv:2311.01533v4 Announce Type: replace Abstract: The work here enables a cost scaling of $\tilde{O}\left( \frac{T ^{1+o(1)}\,{\rm log}^2 (1/\epsilon)}{\varepsilon}\right)$ and maximum depth $\tilde{O}\left( \frac{T^{1+o(1)}\,{\rm log} (1/\epsilon)}{\varepsilon}\right)$ for estimating observables after some Hamiltonian evolution $e^{i H T}$ using no extra block-encoding qubits, where $\epsilon$ is the algorithmic error of the target Hamiltonian evolution and $\varepsilon$ is the statistical error from the observable estimation. Throughout, $\tilde{O}$ suppresses factors that are doubly logarithmic in $1/\epsilon$ (i.e. ${\rm polyloglog}(1/\epsilon)$), which are subdominant to the displayed ${\rm polylog}(1/\epsilon)$ factors. This is achieved through product formulas, stable interpolation (Chebyshev), and to calculate the needed fractional queries, cardinal sine interpolation is used. This is an improvement over similar work using interpolation methods which have a superlinear scaling of the form $5^p T^{1+1/p}$, where $p$ is the order of the product formula used and an improvement on required qubits over Quantum Signal Processing methods while maintaining scaling with ${\rm polylog}{1/\epsilon}$. This is accomplished through an optimized and variable (with $T$) order $p$. The slightly better $\log^2(1/\epsilon)$ compared to $\log^3(1/\epsilon)$ comes from the use of cardinal sine interpolation compared to other methods using Chebyshev interpolation and product formulas. The work presented here also provides an alternative to Quantum Signal Processing techniques to calculate observables or amplitudes after a fractional query evolution with a cost $O(T\log{1/\epsilon})$ through this cardinal sine interpolation.
Abstract:The work here enables a cost scaling of $\tilde{O}\left( \frac{T ^{1+o(1)}\,{\rm log}^2 (1/\epsilon)}{\varepsilon}\right)$ and maximum depth $\tilde{O}\left( \frac{T^{1+o(1)}\,{\rm log} (1/\epsilon)}{\varepsilon}\right)$ for estimating observables after some Hamiltonian evolution $e^{i H T}$ using no extra block-encoding qubits, where $\epsilon$ is the algorithmic error of the target Hamiltonian evolution and $\varepsilon$ is the statistical error from the observable estimation. Throughout, $\tilde{O}$ suppresses factors that are doubly logarithmic in $1/\epsilon$ (i.e. ${\rm polyloglog}(1/\epsilon)$), which are subdominant to the displayed ${\rm polylog}(1/\epsilon)$ factors. This is achieved through product formulas, stable interpolation (Chebyshev), and to calculate the needed fractional queries, cardinal sine interpolation is used. This is an improvement over similar work using interpolation methods which have a superlinear scaling of the form $5^p T^{1+1/p}$, where $p$ is the order of the product formula used and an improvement on required qubits over Quantum Signal Processing methods while maintaining scaling with ${\rm polylog}{1/\epsilon}$. This is accomplished through an optimized and variable (with $T$) order $p$. The slightly better $\log^2(1/\epsilon)$ compared to $\log^3(1/\epsilon)$ comes from the use of cardinal sine interpolation compared to other methods using Chebyshev interpolation and product formulas. The work presented here also provides an alternative to Quantum Signal Processing techniques to calculate observables or amplitudes after a fractional query evolution with a cost $O(T\log{1/\epsilon})$ through this cardinal sine interpolation.
arXiv:2311.01533 [quant-ph]
(or arXiv:2311.01533v5 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2311.01533 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 304 cuvinte
Subiecte conexe
Quantum Simulation of QCD in Axial Gauge
arXiv · 18 aug. 2026

Sparse Hamiltonians can be learned with slower quantum controls
Quantum Zeitgeist · 16 oct. 2026

PsiQuantum team shares R&D at IEEE Quantum Week in Toronto
Quantum Zeitgeist · 15 sept. 2026

Researchers Harness Simulation Errors for Improved Accuracy
Quantum Zeitgeist · 22 aug. 2026