Gottesman–Knill theorem

In quantum computing, the Gottesman–Knill theorem is a theoretical result by Daniel Gottesman and Emanuel Knill that states that stabilizer circuits—circuits that only consist of gates from the normalizer of the qubit Pauli group, also called Clifford group—can be perfectly simulated in polynomial time on a probabilistic classical computer. The Clifford group can be generated solely by using the controlled NOT, Hadamard, and phase gates (CNOT, H and S); and therefore stabilizer circuits can be constructed using only these gates.

Source: Wikipedia — Gottesman–Knill theorem (CC BY-SA 4.0)

Gottesman–Knill theorem

In quantum computing, the Gottesman–Knill theorem is a theoretical result by Daniel Gottesman and Emanuel Knill that states that stabilizer circuits—circuits that only consist of gates from the normalizer of the qubit Pauli group, also called Clifford group—can be perfectly simulated in polynomial time on a probabilistic classical computer. The Clifford group can be generated solely by using the controlled NOT, Hadamard, and phase gates (CNOT, H and S); and therefore stabilizer circuits can be constructed using only these gates.

Source: Wikipedia "Gottesman–Knill theorem" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy