Bad Qubits — Learn Quantum by Doing

Multiple choice

What does the Gottesman–Knill theorem establish about a quantum circuit that starts in a computational-basis state, uses only Clifford gates (H, S, CNOT), and measures in the computational basis?

It can be simulated classically in time polynomial in the number of qubits and gates
It can solve any problem exponentially faster than a classical computer
It is already universal for quantum computation
It cannot create entanglement such as Bell or GHZ states