\begin{theorem}[Gottesman-Knill theorem]
Quantum circuits that prepare qubits in the computational basis,
apply operations only from the Clifford group (i.e., H, S, CNOT, P),
and perform measurements of observables in the Pauli group can be
\textbf{perfectly simulated in polynomial time} on a probabilistic classical computer.
\end{theorem}- I'm currently studying quantum computing in KAIST.
- Resume (Last Updated: January 2025)
