Abstract

A quantum computer is a device for computation that makes direct use of distinctively quantum mechanical phenomena, such as superposition and entanglement, to perform operations on data. In a classical (or conventional) computer, the amount of data is measured by bits, in a quantum computer; it is measured by quantum of bits (qubits). This work describes, and implements the universal quantum logic gates, the terminology is introduced with two well known quantum gates, the quantum NOT, and the quantum XOR gates. The NOT and XOR gates have already been described in classical reversible logic. This work gives the implementation of the quantum circuits, such as the Quantum HalfAdder Circuits, which consists of quantum control control not gate (CCNot) and quantum control not gate (CNot). Also, it describes and implements the Quantum FullAdder Circuits, which consists of two Quantum HalfAdder Circuits and one control not gate (CNot). Depending on the quantum circuits, one can implement the quantum basic arithmetic operations such as (addition, subtraction, multiplication and division). After each implementation, the computational complexity of each step is calculated.

Keywords

Quantum computing, Quantum Logic Gates, Truth Table, quantum mechanical, qubits, quantum mechanical, superposition
