Quantum Computing And Quantum Algorithms

• Author(s): Duke Vaishnav
• Paper ID: 1700338
• Page: 143-153
• Published Date: 03-04-2018
• Published In: Iconic Research And Engineering Journals
• Publisher: IRE Journals
• e-ISSN: 2456-8880
• Volume/Issue: Volume 1 Issue 9 March-2018

Abstract

Generally , a classical computer (which works on a layer of millions of transistors) is said to be an efficient computing device which can find out the solution of any computational problem in polynomial order of time .But with the advent of quantum computers and quantum algorithms it was found that such computational problems and the other problems which cannot be solved even by the classical computers were solved in much lesser time by these quantum computers. Introductory Topics covered by this paper include: introduction to quantum computing and quantum algorithms, a brief description about vector complex numbers, complex vector spaces, quantum states, quantum systems, bits, qbits and cbits .the further sections will include LAS VEGAS algorithm for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, these problems are generally thought to be hard on a classical computer and which have been used as the basis of several proposed cryptosystems. This review paper is written with the aim to lay out a foundation for quantum computing in the minds of readers

Citations

IRE Journals:
Duke Vaishnav "Quantum Computing And Quantum Algorithms" Iconic Research And Engineering Journals Volume 1 Issue 9 2018 Page 143-153

IEEE:
Duke Vaishnav "Quantum Computing And Quantum Algorithms" Iconic Research And Engineering Journals, 1(9)