International Journal of Theoretical and Mathematical Physics
p-ISSN: 2167-6844 e-ISSN: 2167-6852
2021; 11(2): 67-70
doi:10.5923/j.ijtmp.20211102.02
Received: Mar. 19, 2021; Accepted: Apr. 7, 2021; Published: Apr. 15, 2021
Asmaa Mo. S.1, Ali M. Kh.2, Zynab A.1, Shimaa S. A.1
1Department of Physics, Al-Azhar University (Girls' Branch), Egypt
2Department of Physics, Al-Azhar University, Egypt
Correspondence to: Asmaa Mo. S., Department of Physics, Al-Azhar University (Girls' Branch), Egypt.
Email: | ![]() |
Copyright © 2021 The Author(s). Published by Scientific & Academic Publishing.
This work is licensed under the Creative Commons Attribution International License (CC BY).
http://creativecommons.org/licenses/by/4.0/
We propose here a model Hamiltonian of double quantum dots with the armchair boundary to produce a theoretical study of a quantum computer. Then we solve it using Dirac fermions equations. Solving the Hamiltonian model and investigate the exchange interactions between two electrons captured in the double dots. Then we investigate the effect of different parameters on exchange interaction. We have found the dependence of the exchange interaction for various potential barrier height and barrier thickness between double dots. Our result shows that; the change of exchange interaction under the effect of this parameter leads to studying coherence time for this model and get the smallest value of switching time. Changing of exchange interaction is accompanied by a transition of electrons between different states. This reality can examine this model as a quantum gate for quantum information.
Keywords: Quantum dot, Graphen, Qubit, Exchange interaction
Cite this paper: Asmaa Mo. S., Ali M. Kh., Zynab A., Shimaa S. A., Quantum Gate Based on Graphene Quantum Dot Modeling, International Journal of Theoretical and Mathematical Physics, Vol. 11 No. 2, 2021, pp. 67-70. doi: 10.5923/j.ijtmp.20211102.02.
![]() | Figure (1). Structured of double quantum dot of GNB with armchair edge separated by barrier with thickness d |
![]() | (1) |
![]() | (2) |
![]() | (3) |
![]() | (4) |
![]() | (5) |
![]() | (6) |
![]() | (7) |
![]() | (8) |
![]() | Figure (2). The exchange coupling ![]() ![]() |
![]() | Figure (3). The exchange coupling ![]() ![]() |
![]() | Figure (4). The exchange coupling ![]() ![]() ![]() ![]() |
![]() | Figure (5). The exchange coupling ![]() ![]() ![]() |