Quantum computation is a remarkable subject building on the great computational discovery that computers based on quantum mechanics are exponentially powerful. This course aims to make this cutting-edge material broadly accessible to undergraduate students, including computer science majors who do not have any prior exposure to quantum mechanics. The course starts with a simple introduction to the fundamental principles of quantum mechanics using the concepts of qubits (or quantum bits) and quantum gates. This treatment emphasizes the paradoxical nature of the subject, including entanglement, non-local correlations, the no-cloning theorem and quantum teleportation. The course covers the fundamentals of quantum algorithms, including the quantum fourier transform, period finding, Shor’s quantum algorithm for factoring integers, as well as the prospects for quantum algorithms for NP-complete problems. It also discusses the basic ideas behind the experimental realization of quantum computers, including the recent Google quantum supremacy experiment. Before your course starts, try the new edX Demo where you can explore the fun, interactive learning environment and virtual labs. Learn more.
* Photos and promotional materials on this page are copyrighted on edx.com.
We only endorse high-quality online courses and educational content. This page contains affiliate links and we may earn a small commission when you click on the link at no additional cost to you. Thank you!
Read the full policy here.