Open main menu

In quantum computing and specifically the quantum circuit model of computation, a quantum logic gate (or simply quantum gate) is a basic quantum circuit operating on a small number of qubits. They are the building blocks of quantum circuits, like classical logic gates are for conventional digital circuits.

Unlike many classical logic gates, quantum logic gates are reversible. However, it is possible to perform classical computing using only reversible gates. For example, the reversible Toffoli gate can implement all Boolean functions, often at the cost of having to use ancilla bits. The Toffoli gate has a direct quantum equivalent, showing that quantum circuits can perform all operations performed by classical circuits.

RepresentationEdit

Quantum logic gates are represented by unitary matrices. The number of qubits in the input and output of the gate must be equal; a gate which acts on   qubits is represented by a   unitary matrix. The quantum states that the gates act upon are vectors in   complex dimensions. The base vectors are the possible outcomes if measured, and a quantum state is a linear combination of these outcomes. The most common quantum gates operate on spaces of one or two qubits, just like the common classical logic gates operate on one or two bits.

The vector representation of a single qubit is:

 ,

The vector representation of two qubits is:

 ,

The action of the gate on a specific quantum state is found by multiplying the vector   which represents the state by the matrix   representing the gate.

 

Notable examplesEdit

Hadamard (H) gateEdit

The Hadamard gate acts on a single qubit. It maps the basis state   to   and   to  , which means that a measurement will have equal probabilities to become 1 or 0 (i.e. creates a superposition). It represents a rotation of   about the axis  . Equivalently, it is the combination of two rotations,   about the Z-axis followed by   about the Y-axis. It is represented by the Hadamard matrix:

 
Circuit representation of Hadamard gate
 .

The Hadamard gate is the one-qubit version of the quantum Fourier transform.

Since   where I is the identity matrix, H is indeed a unitary matrix.

Pauli-X gateEdit

 
Quantum circuit diagram of a NOT-gate

The Pauli-X gate acts on a single qubit. It is the quantum equivalent of the NOT gate for classical computers (with respect to the standard basis  ,  , which distinguishes the Z-direction; in the sense that a measurement of the eigenvalue +1 corresponds to classical 1/true and -1 to 0/false). It equates to a rotation around the X-axis of the Bloch sphere by   radians. It maps   to   and   to  . Due to this nature, it is sometimes called bit-flip. It is represented by the Pauli matrix:

 .

Pauli-Y gateEdit

The Pauli-Y gate acts on a single qubit. It equates to a rotation around the Y-axis of the Bloch sphere by   radians. It maps   to   and   to  . It is represented by the Pauli Y matrix:

 .

Pauli-Z ( ) gateEdit

The Pauli-Z gate acts on a single qubit. It equates to a rotation around the Z-axis of the Bloch sphere by   radians. Thus, it is a special case of a phase shift gate (which are described in a next subsection) with  . It leaves the basis state   unchanged and maps   to  . Due to this nature, it is sometimes called phase-flip. It is represented by the Pauli Z matrix:

 .

The Pauli matrices are involutoryEdit

The square of a Pauli matrix is the identity matrix.

 

Square root of NOT gate (NOT)Edit

 
Quantum circuit diagram of a square-root-of-NOT gate

The square root of NOT gate acts on a single qubit. It maps the basis state   to   and   to  .

 .
 .

Therefore,  , so this gate is a square root of the NOT gate.

Similar squared root-gates can be constructed for all other gates by finding a unitary matrix that, multiplied by itself, yields the gate one wishes to construct the squared root gate of. All rational exponents of all gates can be found similarly.

Phase shift ( ) gatesEdit

This is a family of single-qubit gates that leave the basis state   unchanged and map   to  . The probability of measuring a   or   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) on the Bloch sphere by   radians.

 

where   is the phase shift. Some common examples are the   gate (commonly written as T) where  , the phase gate (written S, though S is sometimes used for SWAP gates) where   and the Pauli-Z gate where  .

Swap (SWAP) gateEdit

 
Circuit representation of SWAP gate

The swap gate swaps two qubits. With respect to the basis  ,  ,  ,  , it is represented by the matrix:

 .

Square root of Swap gate (SWAP)Edit

 
Circuit representation of   gate

The   gate performs half-way of a two-qubit swap. 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. With respect to the basis  ,  ,  ,  , it is represented by the matrix:

 .

Controlled (cX cY cZ) gatesEdit

 
Circuit representation of controlled NOT gate
 
Hadamard-CNOT combination

Controlled gates act on 2 or more qubits, where one or more qubits act as a control for some operation. For example, the controlled NOT gate (or CNOT or cX) acts on 2 qubits, and performs the NOT operation on the second qubit only when the first qubit is  , and otherwise leaves it unchanged. With respect to the basis  ,  ,  ,  , it is represented by the matrix:

 .

More generally if U is a gate that operates on single qubits with matrix representation

 ,

then the controlled-U gate is a gate that operates on two qubits in such a way that the first qubit serves as a control. It maps the basis states as follows.

 
Circuit representation of controlled-U gate
 
 
 
 

The matrix representing the controlled U is

 .
controlled X-, Y- and Z- gates
controlled-X gate
controlled-Y gate
controlled-Z gate

When U is one of the Pauli matrices, σx, σy, or σz, the respective terms "controlled-X", "controlled-Y", or "controlled-Z" are sometimes used.[1]

The CNOT gate is generally used in quantum computing to generate entangled states.

Toffoli (CCNOT) gateEdit

 
Circuit representation of Toffoli gate

The Toffoli gate, named after Tommaso Toffoli; also called CCNOT gate or Deutsch   gate; is a 3-bit gate, which is universal for classical computation. The quantum Toffoli gate is the same gate, defined for 3 qubits. If we limit ourselves to only accepting input qubits that are   and  , then if the first two bits are in the state   it applies a Pauli-X (or NOT) on the third bit, else it does nothing. It is an example of a controlled gate. Since it is the quantum analog of a classical gate, it is completely specified by its truth table. The Toffoli gate is universal when combined with the single qubit Hadamard gate.[2]

Truth table Matrix form
INPUT OUTPUT
 0   0   0   0   0   0 
0 0 1 0 0 1
0 1 0 0 1 0
0 1 1 0 1 1
1 0 0 1 0 0
1 0 1 1 0 1
1 1 0 1 1 1
1 1 1 1 1 0

 

It can be also described as the gate which maps   to  .

Fredkin (CSWAP) gateEdit

 
Circuit representation of Fredkin gate

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.

Truth table Matrix form
INPUT OUTPUT
C I1 I2 C O1 O2
 0   0   0   0   0   0 
0 0 1 0 0 1
0 1 0 0 1 0
0 1 1 0 1 1
1 0 0 1 0 0
1 0 1 1 1 0
1 1 0 1 0 1
1 1 1 1 1 1

 

Ising (XX) coupling gateEdit

The Ising gate (or XX gate) is a 2-qubit gate that is implemented natively in some trapped-ion quantum computers.[3][4] It is defined as

 ,

Ising (YY) coupling gateEdit


 ,

Ising (ZZ) coupling gateEdit


 [5],

Deutsch ( ) gateEdit

The Deutsch (or  ) gate, named after physicist David Deutsch is a three-qubit gate. It is defined as

 

Unfortunately, a working Deutsch gate has remained out of reach, due to lack of a protocol. However, a method was proposed to realize such a Deutsch gate with dipole-dipole interaction in neutral atoms.

Universal quantum gatesEdit

 
Both CNOT and   are universal two-qubit gates and can be transformed into each other.

Informally, a set of universal quantum gates is any set of gates to which any operation possible on a quantum computer can be reduced, that is, any other unitary operation can be expressed as a finite sequence of gates from the set. Technically, this is impossible with anything less than an uncountable set of gates since the number of possible quantum gates is uncountable, whereas the number of finite sequences from a finite set is countable. To solve this problem, we only require that any quantum operation can be approximated by a sequence of gates from this finite set. Moreover, for unitaries on a constant number of qubits, the Solovay–Kitaev theorem guarantees that this can be done efficiently.

One simple set of two-qubit universal quantum gates is the Hadamard gate  , the   gate  , and the controlled-NOT gate  .[6]

A single-gate set of universal quantum gates can also be formulated using the three-qubit Deutsch gate  , which performs the transformation[7]

 

The universal classical logic gate, the Toffoli gate, is reducible to the Deutsch gate,  , thus showing that all classical logic operations can be performed on a universal quantum computer.

There also exists a single two-qubit gate sufficient for universality, given it can be applied to any pairs of qubits   on a circuit of width  .[8]

Another set of universal quantum gates consists of the Ising gate and the phase-shift gate. These are the set of gates natively available in some trapped-ion quantum computers.[4]

MeasurementEdit

 
Circuit representation of measurement. The two lines on the right hand side represents a classical bit, the single line on the left hand side represents a qubit.

Measurement is irreversible and therefore not a quantum gate, because it assigns the observed variable to a singular value. Measurement takes a quantum state and projects it to one of the base vectors, with a likelihood equal to the square of the vectors depth along that base vector. This is a non-reversible operation as it sets the quantum state equal to the base vector that represents the measured state (the state "collapses" to a definite singular value). Why and how this is so is called the measurement problem.

If two different quantum registers are entangled (they cannot be expressed as a tensor product), measurement of one register affects or reveals the state of the other register by partially or entirely collapsing its state too. An example of such a linearly inseparable state is the EPR pair, which can be constructed with the CNOT and the Hadamard gates (described above). This effect is used in many algorithms: if two variables A and B are maximally entangled (the bell state is the simplest example of this), a function F is applied to A such that A is updated to the value of F(A), followed by measurement of A, then B will, when measured, be a value such that F(B) = A[citation needed]. This way, measurement of one register can be used to assign properties to some other registers[citation needed].

This effect of assignment is used in Shor's algorithm. The algorithm uses two measurements on two registers with entangled copies of a single value that is in a superposition; the first measurement is used to obtain a modular exponentiation and to eliminate all values that do not correspond to this modular exponentiation in the other register. This other register is then fed through a quantum Fourier transform and then measured to reveal the period, which concludes the algorithm. The order in which measurement is performed can be reversed, or concurrently interleaved, without affecting the result, since the measurements assignment of one register will limit the value-space from the other entangled register.

This type of value-assignment in theory occurs instantaneously over any distance and this has as of 2018 been experimentally verified for distances of up to 1200 kilometers.[9][10] That the phenomena appears to violate the speed of light is called the EPR paradox and it is an open question in physics how to resolve this. Originally it was solved by giving up the assumption of local realism, but other interpretations have also emerged. For more information see the Bell test experiments.

Circuit composition and entangled statesEdit

If two or more qubits are viewed as a single quantum state, this combined state is equal to the tensor product of the constituent qubits. An entangled state is any state that cannot be tensor-factorized, or in other words: An entangled state can not be written as a tensor product of its constituent qubits states. The CNOT, Ising and Toffoli gates are examples of gates that act on states constructed of multiple qubits.

The tensor product of two  -qubit quantum gates generates the gate that is equal to the two gates in parallel. This gate will act on   qubits. For example, the gate   is the Hadamard gate ( ) applied in parallel on 2 qubits. It can be written as

 

This "two-qubit parallel Hadamard gate" will when applied to, for example, the two-qubit zero-vector ( ), create a quantum state that have equal probability of being observed in any of its four possible outcomes; 00, 01, 10 and 11. We can write this operation as:

 

Here the amplitude for each measurable state is  . The probability to observe any state is the absolute value of the measurable states amplitude squared, which in the above example means that there is one in four that we observe any one of the individual four cases. (Strictly speaking, the probability is equal to the amplitude modulus squared, and therefore must be real and non-negative. For amplitude  , the probability is its modulus squared  .)

If we have a set of N qubits that are entangled (their combined state can not be tensor-factorized into an expression of the individual qubits) and wish to apply a quantum gate on M < N qubits in the set, we will have to extend the gate to take N qubits. This can be done by combining the gate with an identity matrix such that their tensor product becomes a gate that act on N qubits. The identity matrix ( ) is a representation of the gate that maps every state to itself (i.e., does nothing at all). In a circuit diagram the identity gate or matrix will appear as just a wire.

For example, the Hadamard transform ( ) acts on a single qubit, but if we for example feed it the first of the two qubits that constitute the entangled Bell state  , we cannot write that operation easily. We need to extend the Hadamard gate   with the identity gate   so that we can act on quantum states that span two qubits:

 

The gate   can now be applied to any two-qubit state, entangled or otherwise. The M-gate will leave the second qubit untouched and apply the Hadamard transform to the first qubit. If applied to the Bell state in our example, we may write that as:

 

Because the number of elements in the matrices is  , where   is the number of qubits the gates act on, it is believed to be intractable to simulate large quantum systems using classical computers.

HistoryEdit

The current notation for quantum gates was developed by Barenco et al.,[11] building on notation introduced by Feynman.[12]

See alsoEdit

ReferencesEdit

  1. ^ Nielsen, Michael A.; Chuang, Isaac (2000). Quantum Computation and Quantum Information. Cambridge: Cambridge University Press. ISBN 0521632358. OCLC 43641333.
  2. ^ Aharonov, Dorit (2003-01-09). "A Simple Proof that Toffoli and Hadamard are Quantum Universal". arXiv:quant-ph/0301040.
  3. ^ "Monroe Conference" (PDF). online.kitp.ucsb.edu.
  4. ^ a b "Demonstration of a small programmable quantum computer with atomic qubits" (PDF). Retrieved 2019-02-10.
  5. ^ Jones, Jonathan A. (2003). "Robust Ising gates for practical quantum computation". Physical Review A. 67. arXiv:quant-ph/0209049. doi:10.1103/PhysRevA.67.012317.
  6. ^ M. Nielsen and I. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2016, p. 189; ISBN 978-1-107-00217-3
  7. ^ Deutsch, David (September 8, 1989), "Quantum computational networks", Proc. R. Soc. Lond. A, 425 (1989): 73–90, Bibcode:1989RSPSA.425...73D, doi:10.1098/rspa.1989.0099
  8. ^ Bausch, Johannes; Piddock, Stephen (2017), "The Complexity of Translationally-Invariant Low-Dimensional Spin Lattices in 3D", Journal of Mathematical Physics, 58: 111901, arXiv:1702.08830, doi:10.1063/1.5011338
  9. ^ Billings, Lee. "China Shatters "Spooky Action at a Distance" Record, Preps for Quantum Internet". Scientific American.
  10. ^ Popkin, Gabriel (15 June 2017). "China's quantum satellite achieves 'spooky action' at record distance". Science - AAAS.
  11. ^ Phys. Rev. A 52 3457–3467 (1995), doi:10.1103/PhysRevA.52.3457; e-print arXiv:quant-ph/9503016
  12. ^ R. P. Feynman, "Quantum mechanical computers", Optics News, February 1985, 11, p. 11; reprinted in Foundations of Physics 16(6) 507–531.

SourcesEdit