Bad Qubits — Learn Quantum by Doing

Multiple choice

For the Hidden Subgroup Problem (HSP), which statement correctly contrasts the abelian and non-abelian cases?

Both cases are efficiently solved by the same weak Fourier sampling, with no difference in difficulty
The abelian HSP has an efficient quantum algorithm in poly(log|G|) time, while no efficient quantum algorithm is known for general non-abelian cases such as the symmetric group S_n
The non-abelian HSP is efficiently solved by Fourier sampling, while the abelian case remains open
Neither the abelian nor the non-abelian HSP has any known quantum algorithm