Clifford gates

Source: Wikipedia, the free encyclopedia.

In

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.[1] 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:

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 .

Common generating gates

Hadamard gate

The Hadamard gate

is a member of the Clifford group as and .

S gate

The phase gate

is a Clifford gate as and .

CNOT gate

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.


Between and there are four options:

CNOT combinations
CNOT CNOT

Building a universal set of quantum gates

The Clifford gates do not form a universal set of quantum gates as some gates outside the Clifford group cannot be arbitrarily approximated with a finite set of operations. An example is the phase shift gate (historically known as the gate):

.

The following shows that the gate does not map the Pauli- gate to another Pauli matrix:

However, the Clifford group, when augmented with the gate, forms a universal quantum gate set for quantum computation.[5] Moreover, exact, optimal circuit implementations of the single-qubit -angle rotations are known.[6][7]

See also

References

  1. S2CID 8391036
    .
  2. .
  3. .
  4. .
  5. ^ Forest, Simon; Gosset, David; Kliuchnikov, Vadym; McKinnon, David. "Exact Synthesis of Single-Qubit Unitaries Over Clifford-Cyclotomic Gate Sets". Journal of Mathematical Physics.
  6. arXiv:1403.2975
    .
  7. .