Hi!
I was recently reading about Grover's algorithm. Whil I do understand that the overhead of quantum computing and quantum simulation greatly outweight the time complexity benefit compared to traditionnal bruteforcing(at least for now), it got me wondering:
Theoretically, would running grover's algorithm on a quantum simulator still have sqrt(N) complexity like a real quantim computer, or would something about the fact it's a simulation remove that property?