List of quantum logic gates: Difference between revisions

From testwiki
Jump to navigation Jump to search
imported>Countercheck
light copyedit
Β 
(No difference)

Latest revision as of 22:01, 22 February 2025

Template:Short description

Template:Dynamic list

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

Identity gate and global phase

Name # qubits Operator symbol Matrix Circuit diagram Properties Refs
Identity,

no-op

1 (any) I,𝕀, Template:Not a typo [1001]
or

[1]
Global phase 1 (any) Ph, Phase or eiδI eiδ[1001]
  • Continuous parameters: δ (period 2π)
  • Exponential form: exp(iδI)
[1]

The identity gate is the identity operation I|ψ=|ψ, 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",[2] and a NOP.[3][1]

The global phase gate introduces a global phase eiφ to the whole qubit quantum state. A quantum state is uniquely defined up to a phase. Because of the Born rule, a phase factor has no effect on a measurement outcome: |eiφ|=1 for any φ.

Because eiδ|ψ|ϕ=eiδ(|ψ|ϕ), when the global phase gate is applied to a single qubit in a quantum register, the entire register's global phase is changed.

Also, Ph(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.[1][4][5]

Names # qubits Operator symbol Matrix Circuit diagram Some properties Refs
Pauli X,
NOT,
bit flip
1 X,NOT,σx [0110]


or

[1][6]
Pauli Y 1 Y,σy [0ii0]
  • Hermitian
  • Pauli group
  • Traceless
  • Involutory
[1][6]
Pauli Z,
phase flip
1 Z,σz [1001]
  • Hermitian
  • Pauli group
  • Traceless
  • Involutory
[1][6]
Phase gate S,
square root of Z
1 S,P,Z [100i] [1][6]
Square root of X,
square root of NOT
1 X, V, NOT,SX 12[1+i1i1i1+i] [1][7]
Hadamard,
Walsh-Hadamard
1 H 12[1111]
  • Hermitian
  • Traceless
  • Involutory
[1][6]
Controlled NOT,
controlled-X,
controlled-bit flip,
reversible exclusive OR,
Feynman
2 CNOT, XOR,CX [1000010000010010]
[1000000100100100]

  • Hermitian
  • Involutory

Implementation:

[1][6]
Anticontrolled-NOT,
anticontrolled-X,
zero control,
control-on-0-NOT,
reversible exclusive NOR
2 CX, controlled[0]-NOT, XNOR [0100100000100001]
  • Hermitian
  • Involutory
[1]
Controlled-Z,
controlled sign flip,
controlled phase flip
2 CZ, CPF, CSIGN, CPHASE [1000010000100001]
  • Hermitian
  • Involutory
  • Symmetrical

Implementation:

  • Duan-Kimble gate
[1][6]
Double-controlled NOT 2 DCNOT [1000001000010100] [8]
Swap 2 SWAP [1000001001000001]
or
  • Hermitian
  • Involutory
  • Symmetrical
[1][6]
Imaginary swap 2 iSWAP [100000i00i000001]
or
  • Special unitary
  • Symmetrical
[1]

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

Note that if a Clifford gate A is not in the Pauli group, A or controlled-A are not in the Clifford gates.Template:Citation needed

The Clifford set is not a universal quantum gate set.

Non-Clifford qubit gates

Relative phase gates

Names # qubits Operator symbol Matrix Circuit diagram Properties Refs
Phase shift 1 P(φ),R(φ),u1(φ) [100eiφ]
  • Continuous parameters: φ (period 2π)
[9][10][11]
Phase gate T,
Ο€/8 gate,
fourth root of Z
1 T,P(π/4) or Z4 [100eiπ/4] [1][6]
Controlled phase 2 CPhase(φ),CR(φ) [100001000010000eiφ]
  • Continuous parameters: φ (period 2π)
  • Symmetrical

Implementation:

[11]
Controlled phase S 2 CS,controlled-S [100001000010000i]
  • Symmetrical
[6]

The phase shift is a family of single-qubit gates that map the basis states P(φ)|0=|0 and P(φ)|1=eiφ|1. The probability of measuring a |0 or |1 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 φ radians. A common example is the T gate where φ=π4 (historically known as the π/8 gate), the phase gate. Note that some Clifford gates are special cases of the phase shift gate: P(0)=I,P(π)=Z;P(π/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(φ) rotates the phase about Template:Nowrap. Extending P(φ) 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(β)XP(α)X=[eiα00eiβ]. When α=β this gate is the rotation operator Rz(2β) gate and if α=β it is a global phase.Template:EfnTemplate:Efn

The T gate's historic name of π/8 gate comes from the identity Rz(π/4)Ph(π8)=P(π/4), where Rz(π/4)=[eiπ/800eiπ/8].

Arbitrary single-qubit phase shift gates P(φ) are natively available for transmon quantum processors through timing of microwave control pulses.[13] It can be explained in terms of change of frame.[14][15]

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 φ only if it acts on the state |11:

|a,b{eiφ|a,bfor a=b=1|a,botherwise.

The controlled-Z (or CZ) gate is the special case where φ=π.

The controlled-S gate is the case of the controlled-P(φ) when φ=π/2 and is a commonly used gate.[6]

Rotation operator gates

Template:Further

Names # qubits Operator symbol Exponential form Matrix Circuit diagram Properties Refs
Rotation about x-axis 1 Rx(θ) exp(iXθ/2) [cos(θ/2)isin(θ/2)isin(θ/2)cos(θ/2)]
  • Special unitary
  • Continuous parameters: θ (period 4π)
[1][6]
Rotation about y-axis 1 Ry(θ) exp(iYθ/2) [cos(θ/2)sin(θ/2)sin(θ/2)cos(θ/2)]
  • Special unitary
  • Continuous parameters: θ (period 4π)
[1][6]
Rotation about z-axis 1 Rz(θ) exp(iZθ/2) [exp(iθ/2)00exp(iθ/2)]
  • Special unitary
  • Continuous parameters: θ (period 4π)
[1][6]

The rotation operator gates Rx(θ),Ry(θ) and Rz(θ) are the analog rotation matrices in three Cartesian axes of SO(3),Template:Efn along the x, y or z-axes of 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×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 Template:Math. A rotation of Template:Math (360 degrees) returns the same statevector with a different phase.[16]

We also have Rb(θ)=Rb(θ) and Rb(0)=I for all b{x,y,z}.

The rotation matrices are related to the Pauli matrices in the following way: Rx(π)=iX,Ry(π)=iY,Rz(π)=iZ.

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

Rn(a)σβ†’Rn(a)=eia2(n^σβ†’)σβ†’eia2(n^σβ†’)=σβ†’cos(a)+n^×σβ†’sin(a)+n^n^σβ†’(1cos(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 Ry(π/2)XRy(π/2)=x^(y^×σβ†’)=Z. Also, using the anticommuting relation we have Ry(π/2)XRy(π/2)=XRy(+π/2)Ry(π/2)=X(iY)=Z.

Rotation operators have interesting identities. For example, Ry(π/2)Z=H and XRy(π/2)=H. Also, using the anticommuting relations we have ZRy(π/2)=H and Ry(π/2)X=H.

Global phase and phase shift can be transformed into each other's with the Z-rotation operator: Rz(γ)Ph(γ2)=P(γ).Template:RTemplate:R

The X gate represents a rotation of Template:Math about the x axis at the Bloch sphere X=eiπ/4Rx(π/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

Names # qubits Operator symbol Exponential form Matrix Circuit diagram Properties Refs
XX interaction 2 Rxx(ϕ), XX(ϕ) exp(iϕ2XX) [cos(ϕ2)00isin(ϕ2)0cos(ϕ2)isin(ϕ2)00isin(ϕ2)cos(ϕ2)0isin(ϕ2)00cos(ϕ2)]
  • Special unitary
  • Continuous parameters: θ (period 4π)

Implementation:

Template:Citation needed
YY interaction 2 Ryy(ϕ), YY(ϕ) exp(iϕ2YY) [cos(ϕ2)00isin(ϕ2)0cos(ϕ2)isin(ϕ2)00isin(ϕ2)cos(ϕ2)0isin(ϕ2)00cos(ϕ2)]
  • Special unitary
  • Continuous parameters: θ (period 4π)

Implementation:

Template:Citation needed
ZZ interaction 2 Rzz(ϕ), ZZ(ϕ) exp(iϕ2ZZ) [eiϕ/20000eiϕ/20000eiϕ/20000eiϕ/2]
  • Special unitary
  • Continuous parameters: θ (period 4π)
Template:Citation needed
XY,
XX plus YY
2 Rxy(ϕ), XY(ϕ) exp[iϕ4(XX+YY)] [10000cos(ϕ/2)isin(ϕ/2)00isin(ϕ/2)cos(ϕ/2)00001]
  • Special unitary
  • Continuous parameters: θ (period 4π)
Template:Citation needed

The qubit-qubit Ising coupling or Heisenberg interaction gates Rxx, Ryy and Rzz are 2-qubit gates that are implemented natively in some trapped-ion quantum computers, using for example the MΓΈlmer–SΓΈrensen gate procedure.[17][18]

Note that these gates can be expressed in sinusoidal form also, for example Rxx(ϕ)=exp(iϕ2XX)=cos(ϕ2)IIisin(ϕ2)XX.

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

CNOT=eiπ4Ry1(π/2)Rx1(π/2)Rx2(π/2)Rxx(π/2)Ry1(π/2).

The SWAP gate can be constructed from other gates, for example using the two-qubit interaction gates: SWAP=eiπ4Rxx(π/2)Ryy(π/2)Rzz(π/2).

In superconducting circuits, the family of gates resulting from Heisenberg interactions is sometimes called the fSim gate set. They can be realized using flux-tunable qubits with flux-tunable coupling,[19] or using microwave drives in fixed-frequency qubits with fixed coupling.[20]

Non-Clifford swap gates

Names # qubits Operator symbol Matrix Circuit diagram Properties Refs
Square root swap 2 SWAP [1000012(1+i)12(1i)0012(1i)12(1+i)00001] [1]
Square root imaginary swap 2 iSWAP [1000012i200i21200001]
  • Special unitary
[11]
Swap (raised to a power) 2 SWAPα [100001+eiπα21eiπα2001eiπα21+eiπα200001]
  • Continuous parameters: α (period 2)
[1]
Fredkin,

controlled swap

3 CSWAP, FREDKIN [1000000001000000001000000001000000001000000000100000010000000001]
or
  • Hermitian
  • Involutory
  • Functionally complete reversible gate for Boolean algebra
[1][6]

The Template:Radic 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 Template:Radic and single qubit gates. More than one application of the Template:Radic is required to produce a Bell state from product states. The Template:Radic gate arises naturally in systems that exploit exchange interaction.[21][1]

For systems with Ising like interactions, it is sometimes more natural to introduce the imaginary swap[22] or iSWAP.[23][24] Note that iSWAP=Rxx(π/2)Ryy(π/2) and iSWAP=Rxx(π/4)Ryy(π/4), or more generally iSWAPn=Rxx(π/2n)Ryy(π/2n) for all real n except 0.

SWAPΞ± arises naturally in spintronic quantum computers.[1]

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.Template:Anchor

Other named gates

Names # qubits Operator symbol Matrix Circuit diagram Properties Named after Refs
General single qubit rotation 1 U(θ,ϕ,λ) [cos(θ/2)eiλsin(θ/2)eiϕsin(θ/2)ei(λ+ϕ)cos(θ/2)]
  • Implements an arbitrary single-qubit rotation
  • Continuous parameters: θ,ϕ,λ (period 2π)
OpenQASM U gateTemplate:Efn [11][25]
Template:Vanchor 2 BARENCO(α,ϕ,θ) [1000010000eiαcosθiei(αϕ)sinθ00iei(α+ϕ)sinθeiαcosθ]
  • Implements a controlled arbitrary qubit rotation
  • Universal quantum gate
  • Continuous parameters: α,ϕ,θ (period 2π)
Adriano Barenco [1]
Berkeley B 2 B [cos(π/8)00isin(π/8)0cos(3π/8)isin(3π/8)00isin(3π/8)cos(3π/8)0isin(π/8)00cos(π/8)]
  • Special unitary
  • Exponential form:
exp[iπ8(2XX+YY)]
University of California Berkeley[26] [1]
Controlled-V,

controlled square root NOT

2 CSX,controlled-X, controlled-V [1000010000eiπ/4eiπ/400eiπ/4eiπ/4] [9]
Core entangling, canonical decomposition 2 N(a,b,c), can(a,b,c) [eiccos(ab)00ieicsin(ab)0eiccos(a+b)ieicsin(a+b)00ieicsin(a+b)eiccos(a+b)0ieicsin(ab)00eiccos(ab)]
  • Special unitary
  • Universal quantum gate
  • Exponential form
exp[i(aXX+bYY+cZZ)]
  • Continuous parameters: a,b,c (period 2π)
[1]
Dagwood Bumstead 2 DB [10000cos(3π/8)isin(3π/8)00isin(3π/8)cos(3π/8)00001]
  • Special unitary
  • Exponential form:
exp[i3π16(XX+YY)]
Comicbook Dagwood Bumstead[27] [28][27]
Echoed cross resonance 2 ECR 12[001i00i11i00i100]
  • Special unitary
[29]
Fermionic simulation 2 UfSim(θ,ϕ), fSim(θ,ϕ) [10000cos(θ)isin(θ)00isin(θ)cos(θ)0000eiϕ]
  • Special unitary
  • Continuous parameters: θ,ϕ (period 2π)
[30][19][20]
Givens 2 G(θ), Givens(θ) [10000cos(θ)sin(θ)00sin(θ)cos(θ)00001]
  • Special unitary
  • Exponential form:
exp[iθ2(YXXY)]
  • Continuous parameters: θ,ϕ (period 2π)
Givens rotations [31]
Magic 2 β„³ 12[1i0000i100i11i00] [1]
Sycamore 2 syc, fSim(π/2,π/6) [100000i00i00000eiπ/6] Google's Sycamore processor [32]
CZ-SWAP 2 CZS(θ,ϕ,γ), [10000eiγsin2(θ/2)+cos2(θ/2)12(1+eiγ)eiϕsin(θ)0012(1+eiγ)eiϕsin(θ)eiγcos2(θ/2)+sin2(θ/2)0000eiγ]
  • Continuous parameters: θ,ϕ,γ
  • Submatrix of a controlled-CZS (CCZS)
[33]
Deutsch 3 Dθ, D(θ) [100000000100000000100000000100000000100000000100000000icosθsinθ000000sinθicosθ]
  • Continuous parameters: θ,ϕ (period 2π)
  • Universal quantum gate
David Deutsch [1]
Margolus,
simplified Toffoli
3 M, RCCX [1000000001000000001000000001000000001000000001000000000100000010]
  • Hermitian
  • Involutory
  • Special unitary
  • Functionally complete reversible gate for Boolean algebra
Norman Margolus [34][35]
Peres 3 PG,Peres [1000000001000000001000000001000000000001000000100000100000000100]
  • Functionally complete reversible gate for Boolean algebra
Asher Peres [36]
Toffoli,
controlled-controlled NOT
3 CCNOT,CCX,Toff [1000000001000000001000000001000000001000000001000000000100000010]
  • Hermitian
  • Involutory
  • Functionally complete reversible gate for Boolean algebra
Tommaso Toffoli [1][6]

Fermionic-Fredkin,

Controlled-fermionic SWAP

3 fFredkin,

CCZS(π/2,0,0),CfSWAP

[1000000001000000001000000001000000001000000000100000010000000001] [33]

[37]

Notes

Template:Notelist

References