Abstract
Randomized quantum algorithms have been proposed for quantum linear algebra with the goal of constructing shallower circuits than methods based on block encodings, and have been speculated to offer benefits in the early fault-tolerant era. In this work, we derive explicit, non-asymptotic error bounds on every algorithmic parameter of a randomized quantum linear systems solver that combines sampling from a Fourier series with Hamiltonian simulation, and confirm these bounds numerically. We show that even a instance with condition number requires on the order of non-Clifford gates to converge, calling into question the practicality of such randomized schemes. Comparing the two Hamiltonian-simulation kernels, product formulas (PFs) and the random Taylor expansion (RTE), both our analytical bounds and experiments show RTE reaches a given target error with roughly an order of magnitude smaller total gate budget, although neither is practical. Our analysis bridges asymptotic proposals and hardware implementation.