List of quantum logic gates

In gate-based quantum computing, various sets of quantum logic gates are commonly used to express quantum operations. The following tables lists several unitary quantum logic gates, together with their common name, how they are represented, and some of their properties. Controlled or Hermitian conjugate versions of some of these gates may not be listed.

Identity gate and global phase

The identity gate is the identity operation $I, \psi\rangle=, \psi\rangle$, most of the times this gate is not indicated in circuit diagrams, but it is useful when describing mathematical results.

It has been described as being a "wait cycle", and a NOP.

The global phase gate introduces a global phase $e^$ to the whole qubit quantum state. A quantum state is uniquely defined up to a phase. Because of the Born rule, a phase factor have no effect on a measurement outcome: $, e^, =1$ for any $\varphi$.

Because $e^, \psi\rangle \otimes , \phi\rangle = e^(, \psi\rangle \otimes , \phi\rangle),$ when the global phase gate is applied to a single qubit in a quantum register, the entire register's global phase is changed.

Also, $\mathrm(0)=I.$

These gates can be extended to any number of qubits or qudits.

Clifford qubit gates

This table includes commonly used Clifford gates for qubits.

Other Clifford gates, including higher dimensional ones are not included here but by definition can be generated using $H,S$ and $\mathrm$.

Note that if a Clifford gate ''A'' is not in the Pauli group, $\sqrt$ or controlled-''A'' are not in the Clifford gates.

The Clifford set is not a universal quantum gate set.

Non-Clifford qubit gates

Relative phase gates

The phase shift is a family of single-qubit gates that map the basis states $P(\varphi), 0\rangle = , 0\rangle$ and $P(\varphi), 1\rangle= e^, 1\rangle$. The probability of measuring a $, 0\rangle$ or $, 1\rangle$ is unchanged after applying this gate, however it modifies the phase of the quantum state. This is equivalent to tracing a horizontal circle (a line of latitude), or a rotation along the z-axis on the Bloch sphere by $\varphi$ radians. A common example is the ''T'' gate where $\varphi = \frac$ (historically known as the $\pi /8$ gate), the phase gate. Note that some Clifford gates are special cases of the phase shift gate: $P(0)=I,\;P(\pi)=Z;P(\pi/2)=S.$

The argument to the phase shift gate is in U(1), and the gate performs a phase rotation in U(1) along the specified basis state (e.g. $P(\varphi)$ rotates the phase about . Extending $P(\varphi)$ to a rotation about a generic phase of both basis states of a 2-level quantum system (a qubit) can be done with a series circuit: $P(\beta) \cdot X \cdot P(\alpha) \cdot X = \begin e^ & 0 \\ 0 & e^ \end$. When $\alpha = -\beta$ this gate is the rotation operator $R_z(2\beta)$ gate and if $\alpha =\beta$ it is a global phase.

The ''T'' gate's historic name of $\pi /8$ gate comes from the identity $R_z(\pi/4) \operatorname\left(\frac\right) = P(\pi/4)$, where $R_z(\pi/4) = \begin e^ & 0 \\ 0 & e^ \end$.

Arbitrary single-qubit phase shift gates $P(\varphi)$ are natively available for transmon quantum processors through timing of microwave control pulses. It can be explained in terms of change of frame.

As with any single qubit gate one can build a controlled version of the phase shift gate. With respect to the computational basis, the 2-qubit controlled phase shift gate is: shifts the phase with $\varphi$ only if it acts on the state $, 11\rangle$:

: $, a,b\rangle \mapsto \begin e^, a,b\rangle & \mboxa=b=1 \\ , a,b\rangle & \mbox \end$

The controlled-''Z'' (or CZ) gate is the special case where $\varphi = \pi$.

The controlled-''S'' gate is the case when the controlled-$P(\varphi)$ when $\varphi = \pi/2$ and is a commonly used gate.''''

Rotation operator gates

The rotation operator gates $R_x(\theta),R_y(\theta)$ and $R_z(\theta)$ are the analog rotation matrices in three Cartesian axes of SO(3), the axes on the Bloch sphere projection.

As Pauli matrices are related to the generator of rotations, these rotation operators can be written as matrix exponentials with Pauli matrices in the argument. Any $2 \times 2$ unitary matrix in SU(2) can be written as a product (i.e. series circuit) of three rotation gates or less. Note that for two-level systems such as qubits and spinors, these rotations have a period of . A rotation of (360 degrees) returns the same statevector with a different phase.

We also have $R_(-\theta)=R_(\theta)^$ and $R_(0)=I$ for all $b \in \.$

The rotation matrices are related to the Pauli matrices in the following way : $R_x(\pi)=-iX, R_y(\pi)=-iY, R_z(\pi)=-iZ.$

It's possible to work out the adjoint action of rotations on the Pauli vector, namely rotation effectively by double the angle to apply Rodrigues' rotation formula:

: $R_n(-a)\vecR_n(a)=e^ ~ \vec~ e^ = \vec \cos (a) + \hat \times \vec ~\sin (a)+ \hat ~ \hat \cdot \vec ~ (1 - \cos (a))~ .$

Taking the dot product of any unit vector with the above formula generates the expression of any single qubit gate when sandwiched within adjoint rotation gates. For example, it can be shown that $R_y(-\pi/2)XR_y(\pi/2)=\hat\cdot (\hat\times \vec)=Z$. Also, using the anticommuting relation we have $R_y(-\pi/2)XR_y(\pi/2)=XR_y(+\pi/2)R_y(\pi/2)=X(-iY)=Z$.

Rotation operators have interesting identities. For example, $R_y(\pi/2)Z = H$ and $X R_y(\pi/2) = H.$ Also, using the anticommuting relations we have $ZR_y(-\pi/2) = H$ and $R_y(-\pi/2)X = H.$

Global phase and phase shift can be transformed into each others with the Z-rotation operator: $R_z(\gamma) \operatorname\left(\frac\right) = P(\gamma)$.

The $\sqrt$ gate represents a rotation of about the ''x'' axis at the Bloch sphere $\sqrt=e^R_x(\pi/2)$.

Similar rotation operator gates exist for SU(3) using Gell-Mann matrices. They are the rotation operators used with qutrits.

Two qubit interaction gates

The qubit-qubit Ising coupling or Heisenberg interaction gates ''R_xx'', ''R_yy'' and ''R_zz'' are 2-qubit gates that are implemented natively in some trapped-ion quantum computers, using for example the Mølmer–Sørensen gate procedure.

Note that these gates can be expressed in sinusoidal form also, for example $R_(\phi) = \exp\left(-i \frac X\otimes X\right)= \cos\left(\frac\right)I\otimes I-i \sin\left(\frac\right)X\otimes X$.

The CNOT gate can be further decomposed as products of rotation operator gates and exactly a single two qubit interaction gate, for example

: $\mbox =e^R_(-\pi/2)R_(-\pi/2)R_(-\pi/2)R_(\pi/2)R_(\pi/2).$

The SWAP gate can be constructed from other gates, for example using the two qubit interaction gates: $\text = e^R_(\pi/2)R_(\pi/2)R_(\pi/2)$.

Non-Clifford swap gates

The gate performs half-way of a two-qubit swap (see Clifford gates). It is universal such that any many-qubit gate can be constructed from only and single qubit gates. The gate is not, however maximally entangling; more than one application of it is required to produce a Bell state from product states. The gate arises naturally in systems that exploit exchange interaction.

For systems with Ising like interactions, it is sometimes more natural to introduce the imaginary swap or iSWAP. Note that $i\mbox=R_(-\pi/2)R_(-\pi/2)$ and $\sqrt=R_(-\pi/4)R_(-\pi/4)$, or more generally \sqrt R_(-\pi/2n)R_(-\pi/2n) for all real ''n'' except 0.

SWAP^''α'' arises naturally in spintronic quantum computers.

The Fredkin gate (also CSWAP or CS gate), named after Edward Fredkin, is a 3-bit gate that performs a controlled swap. It is universal for classical computation. It has the useful property that the numbers of 0s and 1s are conserved throughout, which in the billiard ball model means the same number of balls are output as input.

Other named gates

Notes

{{notelist

References

Quantum computing
Quantum gates