Abstract
In this paper, a binary full adder circuit is designed with eight quantum rings where each ring is threaded by a magnetic flux which is an odd multiple of half of the magnetic flux quantum. The quantum rings are divided into two categories with four rings connected to each other in parallel. They are attached symmetrically to two semi-infinite one-dimensional metallic electrodes , and three gate voltages are applied as three inputs of the full adder. The Hamiltonian of the system is approximated by the tight-binding method, and the calculations are performed by using Green's function formalism. The current-voltage characteristics are obtained for different values of applied gate voltages in the strong and weak-coupling strengths between the quantum rings and source and drain electrodes. The results are in accordance with the truth table of a binary full adder and show this quantum circuit behaves as a binary full adder. • This work proposes a binary full adder consisting of eight quantum rings where a constant magnetic flux is passing through each of them. • The designed full adder with eight quantum rings is divided into two separate parts (Sum and Carry-out) which are connected symmetrically to the source and drain electrodes. • The values of the applied gate voltages are considered as the full adder inputs and the electric current is the output of the system. • The output current of the proposed circuit based on the system input voltages is in accordance with the truth table of a binary full adder.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Physica E: Low-dimensional Systems and Nanostructures
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.