Quantum Computers: A review of Powers and Applications
Keywords:
Quantum computers, Quantum Computing, theoretical physicistAbstract
Computers based on quantum physics can store and conduct calculations using quantum physics. Even our most powerful supercomputers can't keep up with these machines in certain cases. Information is stored in binary bits on classic devices like laptops and smartphones. The qubit, or quantum bit, is the smallest unit of memory in quantum computers. An electron's spin may be used to make qubits; for example a photon can be used to make one. A characteristic known as quantum superposition allows these systems to be in a variety of configurations at once. Using quantum entanglement, which is a real possibility, two or more qubits may be made to be irrevocably connected. In the year 1900, Max Planck gave a lecture in which he introduced the concept of quantum mechanics. At the German Physical Society, Planck established the concept of discrete units of energy and matter. The contemporary knowledge of quantum theory is the result of more than three decades of research by a variety of scientists.
The discovery of quantum computing's fundamental components was the first step. At Argonne National Labs in 1981, Paul Benioff conceived the notion of a computer that used quantum mechanics. David Deutsch, a theoretical physicist at Oxford University, is widely credited with inventing quantum computing. Quantum computer design became an interest of his in 1984, leading him to write an important breakthrough work in the same year.
References
C.P. Williams & S.H. Clearwater, Exploration in quantum computing (New York: Springer-Verlag, 1997).
P.W. Shor, Algorithm for quantum computation: Discrete logarithm and factoring, Proc. 35th IEEE Annual Symp. On Foundations of Computer Science, Santa Fe, NM, November 1994, 24–134.
M. Oskin, F.T. Chong, & I. Chuang, A practical architecture for reliable quantum computers, IEEE Computer, January 2002, 79–87.
B. Preneel (Ed.), Factorization of a 512-bit RSA modules, Lecture Notes in Computer Science, Vol. 1807 (Berlin: Springer- Verlag, 2000).
L.K. Grover, A fast quantum mechanical algorithm for database search, Proc. STOC, Philadelphia, 1996, 212–219.
D.R. Simon, On the power of quantum computation, Proc. 35th Annual Symp. on Foundations of Computer Science, Sante Fe, NM, 1994, 116–123.
T. Nishino, Introduction to quantum computer (Tokyo: Tokyo Denki University Press, 1997) (in Japanese).
M.A. Nielsen & I.L. Chuang, Quantum computation and quantum information (Cambridge: Cambridge University Press, 2000).
D.P. DiVincenzo, The physical implementation of quantum computation, Fortschritte der Physik, 48(9–11), 2000, 771–783.
D.P. DiVincenzo, Two-bit gates are universal for quantum computation, Physical Review A, 51, 1995, 1015–1022.
IBM Research News, IBM’s test-tube quantum computer makes history: First demonstration of Shor’s historic factoring algorithm, 20011219_quantum.shtml.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2022 International Journal for Research Publication and Seminar
This work is licensed under a Creative Commons Attribution 4.0 International License.
Re-users must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use. This license allows for redistribution, commercial and non-commercial, as long as the original work is properly credited.