Bad Qubits — Learn Quantum by Doing

Multiple choice

The lesson distinguishes two simulation tasks. Simulating real-time quantum dynamics (approximating e^(-iHt)|psi_0> for a local Hamiltonian H) has which complexity, according to the lesson?

In P — efficiently solvable classically for every local Hamiltonian
Undecidable — no algorithm exists
QMA-complete — likely intractable even for a quantum computer
BQP-complete — exactly as hard as universal quantum computation