Hubbry Logo
search
logo

Clifford gate

logo
Community Hub0 Subscribers
Write something...
Be the first to start a discussion here.
Be the first to start a discussion here.
See all
Clifford gate

In quantum computing and quantum information theory, the Clifford gates are the elements of the Clifford group, a set of mathematical transformations which normalize the n-qubit Pauli group, i.e., map tensor products of Pauli matrices to tensor products of Pauli matrices through conjugation. The notion was introduced by Daniel Gottesman and is named after the mathematician William Kingdon Clifford. Quantum circuits that consist of only Clifford gates can be efficiently simulated with a classical computer due to the Gottesman–Knill theorem.

The Clifford group is generated by three gates: Hadamard, phase gate S, and CNOT. This set of gates is minimal in the sense that discarding any one gate results in the inability to implement some Clifford operations; removing the Hadamard gate disallows powers of in the unitary matrix representation, removing the phase gate S disallows in the unitary matrix, and removing the CNOT gate reduces the set of implementable operations from to . Since all Pauli matrices can be constructed from the phase and Hadamard gates, each Pauli gate is also trivially an element of the Clifford group.

The gate is equal to the product of and gates. To show that a unitary is a member of the Clifford group, it suffices to show that for all that consist only of the tensor products of and , we have .

The Hadamard gate

is a member of the Clifford group as and .

The phase gate

is a Clifford gate as and .

The CNOT gate applies to two qubits. It is a (C)ontrolled NOT gate, where a NOT gate is performed on qubit 2 if and only if qubit 1 is in the 1 state.

See all
User Avatar
No comments yet.