Generally, query complexity is thought of as a lower bound on time complexity. It might be true if data is read sequentially. However, in quantum computation, state preparation routines exist that take logarithmic time to prepare a state from classical data. This is one of the key reasons QML algorithms like HHL can claim exponential speed over their classical counter-part. Thus query complexity lower bounding time complexity seems to be false. Is there any formal result which states so under suitable conditions? As in the case of parallel queries, this is clearly false.