Faster quantum linear system solver beyond the condition number
The paper introduces two quantum algorithms to solve linear systems Ax=b faster than previously possible, even when the problem is very ill-conditioned (high condition number). The methods achieve solution accuracy independent of this condition number by using 'effective' measures instead of the true one. This makes solving difficult problems feasible on quantum computers.