Hi. For the error epsilon = O(1/n^2k), and equivalently n = O(1/epsilon^(1/2k)), if we sub the values epsilon = 10^-6 and 2k = 6, do we get n = 10? Because it says it can be complete in just one large step (n=1), which I cannot work out with the math. Also, it seems outside resources mentions that the error epsilon scales off time as well. Is it different or ruled out for some reason in this chapter?
Hi!
I think we can’t use those big O notation formulas and interpret their results literally.
What I mean is
I took that from another module of the codebook about Hamiltonian time evolution, but it applies here as well.
Regarding you second question, I will ask the team since I didn’t participate in writing this chapter.
then k=3 if 2k=6, this will give out the correct answer