Menu:

Quantum Computation Theory

"Nature isn't classical, dammit, and if you want to make a simulation of nature, you'd better make it quantum mechanical"
— Richard Feynman
Example content image - aligned to the right

Quantum Computing Theory is the field of study that explores how to harness the strange and powerful laws of quantum mechanics to perform computation in ways that are fundamentally impossible or impractical for classical computers. While classical computers process information using bits (0 or 1), quantum computers use qubits that can exist in superposition of 0 and 1 simultaneously, can be entangled with each other, and exhibit interference—properties that give quantum computers their extraordinary potential.

Check this blog (link) for details of "PC5228 Quantum Information and Computation (2025 fall)" in NUS. Also check this link for a short PDF lecture note that Dagomir and I wrote for PC5228 course.

Check this blog (link) for details of "PC5228 Quantum Information and Computation (2024 fall)" in NUS. Also check this blog (link) for an older version.

Lecture Notes

I will write lecture notes for quantum computation theory here. The lecture notes will cover the following topics: basics of quantum computation, quantum algorithms, quantum complexity theory, and quantum error-correction codes.

An incomplete PDF version of lecture note that I wrote is here: link.

Recently, I’ve been continuously updating some lecture notes on quantum algorithms on my blog:

Recommended Reading

For further reading, here are some excellent textbooks and lecture notes on quantum computation theory: The reader should also check out the following online lecture notes and resources on classical computation theory and complexity theory: The following websites provide overviews of quantum algorithms, quantum complexity classes, and quantum error-correction codes:

Some useful numerical tools