Contribution of Quantum Computing in Advance Computing with Practical Challenges

Yogesh Pant¹

Section:Research Paper, Product Type: Isroset-Journal
Vol.6 , Issue.4 , pp.82-87, Aug-2018

CrossRef-DOI:   https://doi.org/10.26438/ijsrpas/v6i4.8287

Online published on Aug 31, 2018

Copyright © Yogesh Pant . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
 

View this paper at   Google Scholar | DPI Digital Library

XML View     PDF Download

How to Cite this Paper

377 Views    150 Downloads    155 Downloads

Abstract :
Quantum computation is a nanotechnology that is getting quite a buzz in the field of technology over past few years because of in polynomial time its ability to solve exponentially hard problems. Alternatively, an important feature is having an ultra-low power dissipation and high frequency. CMOS technologies have some drawbacks in Nano-scales. There are 7 billion transistors in NVidia graphics chip so it is simply understood that it is about to achieve subatomic level. This paper explains the concept of quantum computing and quantum universal gates are also discussed in order to provide a good foundation for this emerging technology. This paper also covers the review of the current experimental status of quantum computers and various challenges faced by this technology are also discussed.

Key-Words / Index Term :
Boolean function; Circuit; Encoding; Quantum logic gates; Matrix transformation; D-Wave

References :
[1] R.Feynman, “simulating physics with Computers,” International Journal of Theoretical Physics, Vol. 21, No. 6/7, pp.467-488(1982).
[2] A. Turing, “On computable numbers with an application to the Entscheidungs-problem,” Proc. Lond. Math. Soc. Ser. 2, 42 (1936), 230-65.
[3] Church, “An unsolvable problem of elementary number theory,” American J. of Math., 58 (1936), 345-63.
[4] F. E. Hohn, “Applied Boolean Algebra – An Elementary Introduction”, theMacmillan Company, New York, (1966)
[5] M.Morris Mano, “Digital Design Prentice Hall”, Third Edition, (2002)
[6] Mikio Nakahara and Tetsuo Ohmi, “Quantum computing,” CRC press, (2008)
[7] Nielsen, M.A. and Chuang, I.L., “Quantum computation and quantum information” UK: Cambridge University Press,(2000)
[8] [M. A. Nielsen and I. L. Chuang, “Quantum Computation and Quantum Information”, Cambridge University Press , (2002)
[9] H.Thapliyal, and N.Ranganathan,“Reversible Logic-Based Concurrently Testable Latches for Molecular QCA” IEEE Transactions On Nanotechnology, Vol. 9, No. 1, January 2010
[10] R. Landauer, “Irreversibility and heat generation in the computational process,” IBM J. Res. Dev., vol. 5, pp. 183–191, (1961)
[11] R. P. Feynman, “Quantum mechanical computers,” Found. Phys., 16 (1986), 507
[12] D. P. DiVincenzo, “Two-bit gates are universal for quantum computation,” Phys. Rev. A, 51 (1995), 1015-18.
[13] T. Sleator, H. Weinfurter, “Realizable Universal Quantum Logic Gates,” Phys. Rev. Lett., 74 (1995), 4087-90
[14] Bruce Kane, “A silicon-based nuclear spin quantum computer”, Nature 393(1998), 133–137.
[15] N. Gershenfeld and I.L. Chuang, “Quantum computing with molecules”,Scientific American (1998).
[16] M. A. Nielsen and I.L. Chuang, “Quantum Computation and Quantum Information” Cambridge University Press, (2000)
[17] W.H. Zurek, “Decoherence and transition from quantum to classical”. Physics Today, October 1991.
[18] H.D. Zeh, “The roots and fruits of decoherence”. arXiv: quant-ph/0512078.
[19] P.W. Shor, “Fault-tolerant quantum computation”. arXiv: quant-ph/9605011
[20] S. Kak, “General qubit errors cannot be corrected”. Inform. Sc. 152, 195-202, 2003; arXiv: quant-ph/0206144.
[21] S. Kak, “The initialization problem in quantum computing”. Found. Phys., 29: 267- 279, 1999; arXiv: quant-ph/9805002.