Lably
Skip to content

Controlled NOT gate

Quantum logic gate

  • 5 min read
  • 6 chapters

Related on Lably

Through Computer science and If and only if

The CNOT can be expressed in the Pauli basis as:

CNOT=eiπ4(I1−Z1)(I2−X2)=e−iπ4(I1−Z1)(I2−X2).

Being both unitary and Hermitian, CNOT has the property eiθU=(cos⁡θ)I+(isin⁡θ)U and U=eiπ2(I−U)=e−iπ2(I−U), and is involutory.

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

CNOT=e−iπ4Ry1(−π/2)Rx1(−π/2)Rx2(−π/2)Rxx(π/2)Ry1(π/2).

In general, any single qubit unitary gate can be expressed as U=eiH, where H is a Hermitian matrix, and then the controlled U is CU=ei12(I1−Z1)H2.

The CNOT gate is also used in classical reversible computing.

Operation

The CNOT gate operates on a quantum register consisting of 2 qubits. The CNOT gate flips the second qubit (the target qubit) if and only if the first qubit (the control qubit) is |1⟩.

If {|0⟩,|1⟩} are the only allowed input values for both qubits, then the TARGET output of the CNOT gate corresponds to the result of a classical XOR gate. Fixing CONTROL as |1⟩, the TARGET output of the CNOT gate yields the result of a classical NOT gate.

More generally, the inputs are allowed to be a linear superposition of {|0⟩,|1⟩}. The CNOT gate transforms the quantum state:

a|00⟩+b|01⟩+c|10⟩+d|11⟩

into:

a|00⟩+b|01⟩+c|11⟩+d|10⟩

The action of the CNOT gate can be represented by the matrix (permutation matrix form):

CNOT=[1000010000010010].

The first experimental realization of a CNOT gate was accomplished in 1995. Here, a single Beryllium ion in a trap was used. The two qubits were encoded into an optical state and into the vibrational state of the ion within the trap. At the time of the experiment, the reliability of the CNOT-operation was measured to be on the order of 90%.

In addition to a regular controlled NOT gate, one could construct a function-controlled NOT gate, which accepts an arbitrary number n+1 of qubits as input, where n+1 is greater than or equal to 2 (a quantum register). This gate flips the last qubit of the register if and only if a built-in function, with the first n qubits as input, returns a 1. The function-controlled NOT gate is an essential element of the Deutsch–Jozsa algorithm.

Sign in to keep reading

5 more chapters are free with a Lably account.

More in Physics