Gottesman–Knill theorem
In quantum computing, the Gottesman–Knill theorem is a theoretical result by Daniel Gottesman and Emanuel Knill that states that an important subclass of quantum circuits, called stabilizer circuits, can be efficiently simulated on a classical computer. Stabilizer circuits are circuits that only use gates from the normalizer of the qubit Pauli group; this is referred to as the Clifford group, though this has nothing to do with the Clifford algebra.
known for
Wikipage disambiguates
Wikipage redirect
primaryTopic
Gottesman–Knill theorem
In quantum computing, the Gottesman–Knill theorem is a theoretical result by Daniel Gottesman and Emanuel Knill that states that an important subclass of quantum circuits, called stabilizer circuits, can be efficiently simulated on a classical computer. Stabilizer circuits are circuits that only use gates from the normalizer of the qubit Pauli group; this is referred to as the Clifford group, though this has nothing to do with the Clifford algebra.
has abstract
In quantum computing, the Gott ...... through private communication.
@en
Wikipage page ID
Wikipage revision ID
710,836,095
subject
hypernym
comment
In quantum computing, the Gott ...... do with the Clifford algebra.
@en
label
Gottesman–Knill theorem
@en