✳flâneur — a map of the web's best reading

Gottesman–Knill theorem

en.wikipedia.org · 839 words · saved by 1 readers

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 CNOT, Hadamard, and phase gate S; and therefore stabilizer circuits can be constructed using only these gates.

Gottesman–Knill theorem - Wikipedia Jump to content From Wikipedia, the free encyclopedia Theorem of quantum circuits 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 );

Explore this link on the map →

saved by

related reading