All you need is Trotter

The work here enables a cost scaling of (T 1+o(1), log squared (1/ε) over epsilon) and maximum depth (T 1+o(1), log (1/ε) over epsilon) 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 epsilon is the statistical error from the observable estimation. Throughout, suppresses factors that are doubly logarithmic in 1/ε (i.e. polyloglog (1/ε)), which are subdominant to the displayed polylog (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 polylog 1/ε. This is accomplished through an optimized and variable (with T) order p. The slightly better 2(1/ε) compared to 3(1/ε) 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) through this cardinal sine interpolation.