Skip to main content

Basic Quantum Logic Gates


 Classic NOT Gate:

The NOT gate converts bit 0 to bit 1 and bit 1 to bit 0.


 

Sigma X Gate:

The X gate, also known as the Pauli X matrix, also refers to the NOT gate.
The X matrix and the expressions |0> and |1> are as follows.

 

If we make the X gate act on the qubits |0> and |1>;

 

In general, if we write;

For example, let's draw a 2-qubit circuit;

Sigma Z Gate: 

The Pauli Z gate does not change the result when it acts on the |0> qubit. However, when it acts on the |1> qubit, it changes phase, that is, it introduces a minus sign.

If we make the Z gate act on the qubits |0> and |1>;

Sigma Y Gate: 


If we make the Y gate act on the qubits |0> and |1>;

Hadamard Gate: 

The Hadamard gate [H] is used to superposition our qubit.

If we make the H gate act on the qubits |0> and |1>;


The gates you've read so far were single qubit gates. However, the CNOT gate we will see now is used for multiple qubits.

 

CNOT (Controlled NOT) Gate:

Notation of CNOT; 


There are two states at the CNOT gate:

Case 1: If the first qubit is |0> it does nothing to the second qubit.

Case 2: If the first qubit is |1>, it modifies the second qubit. That is if the second qubit is |0> it makes |1>, if |1> makes |0>.





Reference

https://learn.qiskit.org/course/ch-states/single-qubit-gates

 

Comments

Post a Comment

Popular posts from this blog

Bloch Sphere – Geometric Representation of Quantum State

    It is very difficult to visualize quantum states before our eyes. The Bloch sphere represents quantum state functions quite well. The Bloch sphere is named after physicist Felix Bloch. As you can see in the Bloch sphere figure below, it geometrically shows the pure states of two-level quantum mechanical systems. The poles of the Bloch sphere consist of bits |0⟩ and |1⟩. Classically, the point on the sphere indicates either 0 or 1. However, from a quantum mechanics point of view, quantum bits contain possibilities to be found on the entire surface of the sphere. Traditionally, the z-axis represents the |0⟩ qubit, and the z-axis the |1⟩ qubit. When the wave function in superposition is measured, the state function collapses to one of the two poles no matter where it is on the sphere. The probability of collapsing into either pole depends on which pole the vector representing the qubit is closest to. The angle θ that the vector makes with the z-axis determines this probabilit...
1 comment
Read more

A Study of Quantum Properties of Phonons - A New Kind of Quantum Computing Could Be Possible

  To date, we have quantum computers that are superconducting, ion-trapped, neutral atoms, and photons. However, it seems that a new one will be added among these types. Phonons could be popular for this new quantum computer. Before moving on to this stage, a team led by Prof. Andrew Cleland at the Pritzker School of Molecular Engineering at the University of Chicago conducted two experiments to establish a detailed study of phonons. As is known, quantum mechanics argues that quantum elementary particles are indivisible. For example, photons, the smallest particles of light with which we are more studied and familiar, are examples of these elementary particles. However, little attention has been paid to phonons, another quantum particle that transmits sound, in small packets. The team at the University of Chicago was able to figure out how to first capture single phonons and entangle two phonons, using phonons with a pitch that is about a million times higher than what the human ea...
Post a Comment
Read more

Introduction to Grover's Algorithm

    Another algorithm that has an important place among quantum algorithms is the Grover algorithm. It was developed by the Indian physicist Lov Grover in 1997. I described the Deutsch-Jozsa algorithm algorithm in my previous articles. Although the Deutsch-Jozsa algorithm helps us find the characteristics of the functions and gives us good information about the working principles of the quantum algorithm, it has no application to a real physical problem. Grover's algorithm allows us to solve real physical problems. In this article, I will give information about the working principle of the Grover algorithm and its application as an example. Let's imagine two cities, A and B! Suppose there is more than one way to get from A to B. What we want is to find the shortest path among the existing path options. When we want to solve this problem through a classical algorithm, it will deal with each option one by one with iterations and reach the result. However, Grover's algorithm...
Post a Comment
Read more