Fundamentals of quantum computing

Abstract

Following the excellent introduction presented by Mr. Joseph Chang, I will expand the discussion to provide a deeper understanding of the quantum circuit model and the universality of quantum computation. We will first focus on the definition and usefulness of quantum entanglement and briefly examine quantum teleportation and Bell’s inequality, which are key elements for quantum cryptography. Then we will examine the theorem that established the conditions for universal quantum computation. The goal is to better appreciate the quantum circuit model as an effectiveion tool to describe and implement quantum algorithms.