They were definitely not being assumed to be faster. It was considered very uncertain. Quantum algorithms for which people are pretty confident there is no clas

They were definitely not being assumed to be faster. It was considered very uncertain. Quantum algorithms for which people are pretty confident there is no classical algorithm of similar speed, while still unproven, are Shor's algorithm (i.e., no fast classical factoring) and the present case of sampling for supremacy.