Preprint
Oct 2026
Optimal query complexity for fractional quantum evolution
Given oracle access to an unknown unitary $U=e^{iH}$ , the fractional query problem asks how many queries are required to implement a noninteger power $U^t=e^{itH}$, $0<t<1$, when the spectrum is separated from the branch cut by a gap $\delta$. Quantum singular value transformation gives an upper bound of $O\!\left(\fr...
A. Liu, Adam Wesolowski, Jayne Thompson et al.
· 0 citations