Authors

Wafa Idris

College of Computer Science and Information Technology, Sudan University of Science and Technology, Sudan

Amal Salih

College of Computer Science and Information Technology, Sudan University of Science and Technology, Sudan

Ahmed Elhassan

College of Computer Science and Information Technology, Sudan University of Science and Technology, Sudan

Abstract

Quantum computing represents a transformative computational paradigm that leverages quantum mechanical phenomena such as superposition, entanglement, and quantum interference to solve complex problems beyond the capabilities of classical computers. Unlike classical bits, which exist in binary states (0 or 1), quantum bits (qubits) can exist in superposition states, enabling parallel computation at an unprecedented scale. This paper presents a comprehensive overview of quantum computing fundamentals, system architectures, quantum algorithms, hardware implementations, and current challenges. The study also discusses emerging applications in cryptography, optimization, material science, and artificial intelligence. Furthermore, limitations such as decoherence, error rates, and scalability constraints are examined. The paper concludes with future research directions aimed at realizing fault-tolerant, large-scale quantum systems.

Keywords

Quantum Computing; Quantum Information Processing; Qubits; Superposition; Entanglement; Quantum Interference; Quantum Gates; Quantum Circuits; Quantum Algorithms; Shor’s Algorithm; Grover’s Algorithm; Variational Quantum Algorithms (VQA)

Citation of this Article

Wafa Idris, Amal Salih, & Ahmed Elhassan. (2026). An Overview of Quantum Computing: Principles, Architectures, and Emerging Applications. Current Journal of Engineering and Science Research. 3(2), 1-5. Article DOI: https://doi.org/10.47001/CJESR/2026.302001

Licence Copyright (c) 2026 Current Journal of Engineering and Science Research. This work is licensed under a Creative Commons Attribution Non Commercial 4.0 International Licence.

References

  1. R. Feynman, “Simulating physics with computers,” International Journal of Theoretical Physics, 1982.
  2. P. Shor, “Algorithms for quantum computation: Discrete logarithms and factoring,” Proceedings of FOCS, 1994.
  3. L. Grover, “A fast quantum mechanical algorithm for database search,” Proceedings of STOC, 1996.
  4. M. Nielsen and I. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2010.
  5. J. Preskill, “Quantum computing in the NISQ era,” Quantum, 2018.
  6. F. Arute et al., “Quantum supremacy using a programmable superconducting processor,” Nature, 2019.
  7. D. Deutsch, “Quantum theory, the Church–Turing principle and the universal quantum computer,” Proceedings of the Royal Society A, 1985.
  8. A.M. Childs and W. van Dam, “Quantum algorithms for algebraic problems,” Reviews of Modern Physics, 2010.
  9. J. Preskill, “Fault-tolerant quantum computation,” Introduction to Quantum Computation and Information, 1998.
  10. C. Monroe et al., “Programmable quantum simulations of spin systems,” Reviews of Modern Physics, 2021.
  11. S. Aaronson, “The complexity of quantum computing,” Theory of Computing, 2016.
  12. I.L. Chuang et al., “Experimental realization of a quantum algorithm,” Nature, 1998.
  13. J. Clarke and F. Wilhelm, “Superconducting quantum bits,” Nature, 2008.
  14. H.-S. Zhong et al., “Quantum computational advantage using photons,” Science, 2020.