Abstract
Quantum computing is a Quantum Mechanism based computational framework, which has acquired a lot of interest in the early few decades. In contrast with the conventional computers, it has obtained an enhanced performance on various tasks. The study of Quantum Computers is Quantum Computing. Annealing, Entanglement, Tunneling and Superposition are some of the phenomena of Quantum mechanics used in Quantum computers to give the solutions to the problems which were unable to solve by human in their lifetime. The main objective of this paper is to reveal a brief idea about what is occurring in the Quantum Computing field and also the current state. In addition, the features of Quantum computing like Quantum parallelism, reverse computing and qubit computation is also summarized. The article also reveals the cause of great computing capabilities of Quantum computers in view of utilization of quantum entangled state. Based on the review concludes that the research on quantum computers requires the advanced sciences like Mathematics, Micro-Physics and Computer Technology.
Key Words: Quantum Computers, Quantum computing, Quantum Parallelism, Entanglement, Qubit.
Reference
[1] Quantum Architectures and Computation Team (Microsoft and Google), “Defining and detecting quantum speedup”, Center for Quantum Information Science & Technology, University of Southern California, January 2014.
[2] Vitányi P., “Time, space, and energy in reversible computing’, In Proceedings of the 2nd conference on Computing Frontiers , PP 435-444, Ischia, Italy May 04 - 06, 2005.
[3] Scott Aaronson, “The Learnability of Quantum States”, University of Waterloo Institute for Quantum Computing, June 2005.
[4] D- Wave Computing Company, Computational Power Consumption and Speedup Summery, D-wave white paper, 2017
[5] I.D James, (August 2017), “A History of Microprocessor Transistor Count 1971 to 2017” Available: https://en.wikipedia.org/wiki/Transistor_count
[6] Yuanhao Wang,Ying Li, Zhang-qi Yin, and Bei Zeng, “16-qubit IBM universal quantum computer can be fully entangled”, March 2018, Unpublished.
[7] Gabriel Târziu, “Quantum Vs. Classical Logic:The Revisionist Approach”, Logos & Episteme,Vol. 3, Iss. 4, pp 579-590 , 2012.
[8] Janet Anders, Saroosh Shabbir, Stefanie Hilt, Eric Lutz, “Landauer’s principle in the quantum domain, Developing in computational model”, Cornell University Library quant-Phy, Vol-1 pp. 13-18, 2010
[9] Vishal Kumar, Asif Ali Laghari, Shahid Karim, Muhammad Shakir, Ali Anwar Brohi , “Comparison of Fog Computing & Cloud Computing” I.J. Mathematical Sciences and Computing, 2019, 1, 31-41, DOI: 10.5815/ijmsc.2019.01.03
[10] Zuhi Subedar, Ashwini Araballi, “ Hybrid Cryptography: Performance Analysis of Various Cryptographic Combinations for Secure Communication” I. J. Mathematical Sciences and Computing, 2020, 4, 35-41.
[11] Peter W. Shor, “Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer”, IEEE Computer Society Press, January 1996
[12] Rodney Van Meter, “Quantum Computing’s Classical Problem, Classical Computing’s Quantum Problem”, Keio University, Japan Foundations of Physic, August 2014
[13] Andrew Lutomirski, Scott Aaronson, Edward Farhi, Peter Shor, “Breaking and making quantum money: toward a new quantum cryptographic protocol”, Massachusetts Institute of Technology, Cambridge, December 2009 [14] Scott Aaronson, Adam Bouland, Joseph Fitzsimons, and Mitchell Lee, “The Space Just Above BQP”, Massachusetts Institute of Technology, Cambridge, December 2014
[15] Paul Isaac Hagouel and Ioannis G. Karafyllidis, “Quantum Computers: Registers, Gates and Algorithms”, Proc. 28th International Conference on Microelectronics, Serbia, 2012,