There is an extremely broad range of scaling between linear and exponential… Even in architectures with nearest neighbor gates, the (multiplicative) overhead s

There is an extremely broad range of scaling between linear and exponential… Even in architectures with nearest neighbor gates, the (multiplicative) overhead stemming from error correction will only need to be logarithmic in the size of the computation. The constants may be unfavorable, but a log is still a log. See for example https://arxiv.org/abs/1208.0928 https://arxiv.org/abs/1208.0928 and https://arxiv.org/abs/1310.2984 https://arxiv.org/abs/1310.2984