Quantum computation is described as the future of computing. When fully realized it will make current asymmetric cryptography algorithms obsolete as it provides polynomial-time solutions to both prime factorization and discrete logarithm problems. This seminar targets audiences who have no background knowledge of quantum computation but have a desire to indulge in it. In this seminar, we will cover basics of quantum information such as bra-ket notation, qubits and quantum gates. Building on the basics, a very beautiful quantum algorithm, called Gover's algorithm, will be presented. Grover's algorithm proves that quantum computation provides a superior computing model as compared to the classical computers.