We investigate the performance of a streamlined version of Shors algorithm in which the quantum Fourier transform is replaced by a banded version that for each qubit retains only coupling to its $b$ nearest neighbors. Defining the performance $P(n,b)
$ of the $n$-qubit algorithm for bandwidth $b$ as the ratio of the success rates of Shors algorithm equipped with the banded and the full bandwidth ($b=n-1
