steps suffices to simulate for a constant time and accuracy with a \(p\) th-order Trotterization. Implementing each step using the approach of [1]} and choosing \(p\)  sufficiently large, we obtain the gate complexity
\(\left(\frac{n^{5/3}}{\eta ^{2/3}}+n^{4/3}\eta ^{2/3}\right)n^{o(1)}.\) 
