Answers are grounded in this paper and cite their sources.
The work here enables a cost scaling of O ~ ( T 1 + o ( 1 ) l o g 2 ( 1 / ϵ ) ε ) and maximum depth O ~ ( T 1 + o ( 1 ) l o g ( 1 / ϵ ) ε ) for estimating observables after some Hamiltonian evolution e i H T using no extra block-encoding qubits, where ϵ is the algorithmic error of the target Hamiltonian evolution and ε is the statistical error from the observable estimation. Throughout, O ~ suppresses factors that are doubly logarithmic in 1 / ϵ (i.e. p o l y l o g l o g ( 1 / ϵ ) ), which are subdominant to the displayed p o l y l o g ( 1 / ϵ ) 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
No takes yet. Share an insight, caveat, or question.
Gumaro Rendon (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: