CNOT Hadamard Basis

In computer science, the controlled NOT gate (also C-NOT or CNOT), controlled-''X'' gate'','' controlled-bit-flip gate, Feynman gate or controlled Pauli-X is a quantum logic gate that is an essential component in the construction of a gate-based quantum computer. It can be used to entangle and disentangle Bell states. Any quantum circuit can be simulated to an arbitrary degree of accuracy using a combination of CNOT gates and single qubit rotations. The gate is sometimes named after Richard Feynman who developed an early notation for quantum gate diagrams in 1986.

The CNOT can be expressed in the Pauli basis as:

: $\mbox = e^= e^.$

Being both unitary and Hermitian, CNOT has the property $e^=(\cos \theta)I+(i\sin \theta) U$ and $U =e^=e^$, 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

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

In general, any single qubit unitary gate can be expressed as $U = e^$, where ''H'' is a Hermitian matrix, and then the controlled ''U'' is $CU = e^$.

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\rangle$.

If $\$ 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\rangle$, 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 $\$. The CNOT gate transforms the quantum state:

$a, 00\rangle + b, 01\rangle + c, 10\rangle + d, 11\rangle$

into:

$a, 00\rangle + b, 01\rangle + d, 10\rangle + c, 11\rangle$

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

:$\operatorname = \begin 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 0 & 1 \\ 0 & 0 & 1 & 0 \end.$

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.

Behaviour in the Hadamard transformed basis

When viewed only in the computational basis $\$, the behaviour of the C_NOT appears to be like the equivalent classical gate. However, the simplicity of labelling one qubit the ''control'' and the other the ''target'' does not reflect the complexity of what happens for most input values of both qubits.

Insight can be won by expressing the CNOT gate with respect to a Hadamard transformed basis $\$. The Hadamard transformed basis of a one-qubit register is given by

:$, +\rangle = \frac(, 0\rangle + , 1\rangle),\qquad , -\rangle = \frac(, 0\rangle - , 1\rangle),$

and the corresponding basis of a 2-qubit register is

:$, ++\rangle = , +\rangle\otimes, +\rangle = \frac(, 0\rangle + , 1\rangle)\otimes(, 0\rangle + , 1\rangle) = \frac(, 00\rangle + , 01\rangle + , 10\rangle + , 11\rangle)$,

etc. Viewing CNOT in this basis, the state of the second qubit remains unchanged, and the state of the first qubit is flipped, according to the state of the second bit. (For details see below.) "Thus, in this basis the sense of which bit is the ''control bit'' and which the ''target bit'' has reversed. But we have not changed the transformation at all, only the way we are thinking about it."

The "computational" basis $\$ is the eigenbasis for the spin in the Z-direction, whereas the Hadamard basis $\$ is the eigenbasis for spin in the X-direction. Switching X and Z and qubits 1 and 2, then, recovers the original transformation." This expresses a fundamental symmetry of the CNOT gate.

The observation that both qubits are (equally) affected in a C_NOT interaction is of importance when considering information flow in entangled quantum systems.

Details of the computation

We now proceed to give the details of the computation. Working through each of the Hadamard basis states, the first qubit flips between $, +\rangle$ and $, -\rangle$ when the second qubit is $, -\rangle$:

A quantum circuit that performs a Hadamard transform followed by C_NOT then another Hadamard transform, can be described as performing the CNOT gate in the Hadamard basis (i.e. a change of basis):

The single-qubit Hadamard transform, H₁, is Hermitian and therefore its own inverse. The tensor product of two Hadamard transforms operating (independently) on two qubits is labelled H₂. We can therefore write the matrices as:

When multiplied out, this yields a matrix that swaps the $, 01\rangle$ and $, 11\rangle$ terms over, while leaving the $, 00\rangle$ and $, 10\rangle$ terms alone. This is equivalent to a CNOT gate where qubit 2 is the control qubit and qubit 1 is the target qubit:

$\frac \begin\begin 1 & 1 & 1 & 1\\ 1 & -1 & 1 & -1\\ 1 & 1 & -1 & -1\\ 1 & -1 & -1 & 1 \end\end . \begin 1 & 0 & 0 & 0\\ 0 & 1 & 0 & 0\\ 0 & 0 & 0 & 1\\ 0 & 0 & 1 & 0 \end . \frac \begin\begin 1 & 1 & 1 & 1\\ 1 & -1 & 1 & -1\\ 1 & 1 & -1 & -1\\ 1 & -1 & -1 & 1 \end\end = \begin 1 & 0 & 0 & 0\\ 0 & 0 & 0 & 1\\ 0 & 0 & 1 & 0\\ 0 & 1 & 0 & 0 \end$

Constructing the Bell State $, \Phi^+\rangle$

A common application of the C_NOT gate is to maximally entangle two qubits into the $, \Phi^+\rangle$ Bell state; this forms part of the setup of the superdense coding, quantum teleportation, and entangled quantum cryptography algorithms.

To construct $, \Phi^+\rangle$, the inputs A (control) and B (target) to the C_NOT gate are:

$\frac(, 0\rangle + , 1\rangle)_A$ and $, 0\rangle_B$

After applying C_NOT, the resulting Bell State $\frac(, 00\rangle + , 11\rangle)$ has the property that the individual qubits can be measured using any basis and will always present a 50/50 chance of resolving to each state. In effect, the individual qubits are in an undefined state. The correlation between the two qubits is the complete description of the state of the two qubits; if we both choose the same basis to measure both qubits and compare notes, the measurements will perfectly correlate.

When viewed in the computational basis, it appears that qubit A is affecting qubit B. Changing our viewpoint to the Hadamard basis demonstrates that, in a symmetrical way, qubit B is affecting qubit A.

The input state can alternately be viewed as:

$, +\rangle_A$ and $\frac(, +\rangle + , -\rangle)_B$

In the Hadamard view, the control and target qubits have conceptually swapped and qubit A is inverted when qubit B is $, -\rangle_B$. The output state after applying the C_NOT gate is $\frac(, ++\rangle + , --\rangle)$ which can be shown to be exactly the same state as $\frac(, 00\rangle + , 11\rangle)$.

C-ROT gate

The C-ROT gate (controlled Rabi rotation) is equivalent to a C-NOT gate except for a $\pi /2$ rotation of the nuclear spin around the z axis.

Implementations

Trapped ion quantum computers:

* Cirac–Zoller controlled-NOT gate
* Mølmer–Sørensen gate

See also

* Toffoli gate (controlled-controlled-NOT gate)

Notes

References

{{reflist

External links

not gate">Michael Westmoreland: "Isolation and information flow in quantum dynamics" - discussion around the C_not gate

Quantum gates
Quantum information science