Efficient Quantum Full Adder using IBM Quantum Experience

Abstract

Quantum computing has gained a lot of interest recently because of its claims of solving some problems that are almost impossible solving in classical computing. Prime factorization of big numbers using Shor’s algorithm and Grover database search algorithm are two of them. Furthermore, quantum algorithms are developed to make it more realistic in real world. In classical computing the basic unit of computation is a bit which is in 0 or 1 state at a time, whereas in quantum computing it is called a qbit which can be 0 and 1 at the same time and we call it superposition. This paper proposes an implementation of quantum full adder using IBM quantum experience. Quantum circuits are drawn using Qiskit and run on Qiskit simulators, IBM quantum simulators and real IBM quantum machines. Proposed circuit will help in future for drawing more complex circuits and algorithms.