Manuscript Number : CSEIT2063118

Quantum Computers for Next Generation

Authors(6) :-Prof. Nagaraj Telkar, Prof. Pavankumar Naik, Akash Mabali, Girish S H, Gurusiddeshwar S H, Sahana Balikai

Computers reduce human effort and also focus on increasing the performance to push the technology forward. Many approaches have been devised to increase the performance of the computers. One such way is to reduce the size of the transistors used in the systems. Another very significant tactic is to use quantum computers. It proved to be very effective when used to factor large numbers. It was found that it could decrypt codes in 20 minutes which took billions of years with classical computers. This was a great motivation for focusing on this topic. A quantum computer allows a `quantum bit' or qubit to have three states - 0, 1, and 0 or 1. The last state is the coherent state. This enables an operation to be performed on two diverse values at the same time. However, this brings out a problem of decoherence. It becomes difficult to perform the computation using quantum computers. A quantum computer is desired to have five capabilities - scalable system, initialized state, long decoherence time, universal set of quantum gates, high efficiency measurements. Architecture of the quantum computer is the new research area. It is affected by quantum arithmetic, error management, and cluster-state computing. Without it, the quantum algorithms would not prove to be as efficient. To fully utilize the power of a quantum computer, the algorithms used should be based on quantum parallelism.

Authors and Affiliations

Prof. Nagaraj Telkar
Department of Computer Science and Engineering, SKSVMACET Laxmeshwar, Karnataka, India
Prof. Pavankumar Naik
Department of Computer Science and Engineering, SKSVMACET Laxmeshwar, Karnataka, India
Akash Mabali
Department of Computer Science and Engineering, SKSVMACET Laxmeshwar, Karnataka, India
Girish S H
Department of Computer Science and Engineering, SKSVMACET Laxmeshwar, Karnataka, India
Gurusiddeshwar S H
Department of Computer Science and Engineering, SKSVMACET Laxmeshwar, Karnataka, India
Sahana Balikai
Department of Computer Science and Engineering, SKSVMACET Laxmeshwar, Karnataka, India

Transistors, Quantum, Quantum Bit (Qubit) , Parallelism , Algorithm.

  1. Michael Nielsen, Isaac Chuang, “Quantum Computation and Quantum Information" , Cambridge University Press (2000).
  2. Peter Shor, “Algorithms for Quantum Computation: Discrete Logarithms and Factoring," Proceedings of the 35th Annual Symposium on Foundations of Computer Science 124-134(1994).
  3. R. Feynman Simulating physics with computers, Internat. J. Theoret. Phys., 21, pp. 467– 488(1982).
  4. P. Benioff The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines, J. Statist. Phys., 22, pp. 563–591(1980).
  5. D. Deutsch, “Quantum theory, the Church–Turing principle and the universal quantum computer”, Proc. Roy. Soc. London Ser. A, 400, pp. 96–117(1985).
  6. A. Berthiaume, D. Deutsch, and R. Jozsa, “The stabilisation of quantum computations”, in Proceedings of the Workshop on Physics of Computation: PhysComp ’94, IEEE Computer Society Press, Los Alamitos, CA, pp. 60–62(1994).
  7. C. Bennett, E. Bernstein,G. Brassard, and U. Vazirani. “Strengths andweaknesses of quantum computing”. SIAM Journal on Computing, 26(5):1510–1523(1997).
  8. D. Simon” On the power of quantum computation”, in Proceedings of the 35th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, pp. 116–123(1994).
  9. S. Lloyd , A potentially realizable quantum computer, Science, 261, pp. 1569– 1571(1993).
  10. R. Landauer, “Is quantum mechanics useful?” Philos. Trans. Roy. Soc. London Ser. A(1995).
  11. O. Goldreich. “On promise problems” (a survey in memory of Shimon Even [1935– 2004]). Electronic Colloquium on Computational Complexity, Report TR05-018, (2005).
  12. Barenco, A. et al. , ‘Elementary gates for quantum computation’, Phys. Rev., A 52: 3457–3467(1995).
  13. DiVicenzo, D. ‘Two-bit gates are universal for quantum computation’, Phys. Rev., A 51: 1015–1022(1995).
  14. Deutsch, D. and Jozsa, R.‘Rapid solution of problems by quantum computer’, Proc. Roy. Soc. Lond, A 439: 553–558(1992).
  15.   E. Knill. Quantum randomness and nondeterminism. Technical Report LAUR-96- 2186, Los Alamos National Laboratory, 1996. Available as arXiv.org e-Print quant- ph/9610012.

Publication Details

Published in : Volume 6 | Issue 3 | May-June 2020
Date of Publication : 2020-06-30
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 452-459
Manuscript Number : CSEIT2063118
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

Prof. Nagaraj Telkar, Prof. Pavankumar Naik, Akash Mabali, Girish S H, Gurusiddeshwar S H, Sahana Balikai, "Quantum Computers for Next Generation", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 6, Issue 3, pp.452-459, May-June-2020. |          | BibTeX | RIS | CSV

Article Preview