Clifford gate
A class of quantum gates, including the Hadamard gate, the phase gate S, and the CNOT gate, that map Pauli operators to Pauli operators. Quantum circuits composed of such gates can be efficiently simulated by classical computers and produce no quantum speedup.
Timeline (last 90 days)
Quantum circuits composed solely of Clifford gates can be efficiently simulated on a classical computer, as proven by the Gottesman-Knill theorem.
Clifford gates include the Hadamard gate, the phase gate S, and the CNOT gate.
Clifford gates can map Pauli operators to Pauli operators, a property that allows many error-correcting codes (especially stabilizer codes) to detect and correct errors relatively easily.
"Clifford gates + T gate" constitutes a complete gate set for universal quantum computation, and any quantum algorithm can be approximately implemented with this set of gates.
All Facts (4)
Quantum circuits composed solely of Clifford gates can be efficiently simulated on a classical computer, as proven by the Gottesman-Knill theorem.
50%UnverifiedClifford gates include the Hadamard gate, the phase gate S, and the CNOT gate.
50%UnverifiedClifford gates can map Pauli operators to Pauli operators, a property that allows many error-correcting codes (especially stabilizer codes) to detect and correct errors relatively easily.
50%Unverified"Clifford gates + T gate" constitutes a complete gate set for universal quantum computation, and any quantum algorithm can be approximately implemented with this set of gates.
50%