Course Outline¶
Course Identification¶
| Field | Detail |
|---|---|
| Course Title | Quantum Computing and its Applications |
| L–T–P | 3 – 0 – 1 |
| Total Credits | 4 |
| Lecture Credits | 3 |
| Tutorial Credits | 0 |
| Practical / Practice Credits | 1 |
| Eligibility Criteria | Graduation |
| Pre-requisite | Basic knowledge of Number Theory or Information Security |
| Total Lecture Hours | 45 (10 + 15 + 10 + 10) |
| Total Practical Hours | 30 |
Course Objectives¶
This course provides a foundation for quantum computing, Post-Quantum Cryptography and quantum machine learning. It covers the fundamental concepts of quantum mechanics, quantum algorithms, and their applications in various areas, including cryptography, cybersecurity, machine learning, finance, the energy sector, etc. Students will gain a theoretical understanding of quantum computing and practical skills in implementing quantum algorithms for various tasks.
Course Learning Outcomes¶
On completing this course, the student will be able to:
- Understand the basic principles of quantum mechanics and their relevance to quantum computing.
- Comprehend quantum algorithms and their applications.
- Apply quantum optimisation techniques in problem-solving.
- Demonstrate practical skills in quantum computing in various areas, including cryptography and machine learning.
Units¶
Unit I — Fundamentals of Quantum Computing (10 hours)¶
Mathematical foundations: Vectors, Vector space, Inner product, Tensor Product; Qubits, Introduction to quantum mechanics and its relevance to Quantum gates, superposition principle, and entanglement; Quantum parallelism and interference; No cloning theorem; quantum teleportation; Introduction to quantum error correction.
Unit II — Quantum Algorithms and Post-Quantum Security (15 hours)¶
Phase Kick-Back Algorithm, Deutsch–Jozsa algorithm, Simon's algorithm, Bernstein–Vazirani, RSA algorithm and factorization attack on RSA, Shor's algorithm for integer factorization, Grover's algorithm for unstructured search, Hash preimage attack with Grover's algorithm, Quantum Fourier transform and its applications, Harrow–Hassidim–Lloyd (HHL) algorithm, Kyber Algorithm, Quantum attack resistant Digital Signature.
Unit III — Quantum Machine Learning and Optimization (10 hours)¶
Quantum machine learning (QML) models — QSVM, QNN, QCNN, Quantum Linear Regression, Variational Quantum Classifier (VQC), Quantum k-means clustering; kernel methods; Quantum Boltzmann Machines; Quantum optimization techniques: QAOA, quantum annealing.
Unit IV — Introduction to Quantum Simulation Tools and Platforms (10 hours)¶
Google CIRQ, Amazon Braket, IBM Qiskit, Pennylane, Q#, Tensorflow Quantum, Tket/pyket, XACC, Project Q, Quantum Development Kit (QDK).
Readings¶
- Noson S. Yanofsky and Mirco A. Mannucci. Quantum Computing for Computer Scientists. Cambridge University Press, 2008.
- Michael A. Nielsen, Isaac L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press.
- Elias F. Combarro, Samuel González-Castillo, and Alberto Di Meglio. A Practical Guide to Quantum Machine Learning and Quantum Optimization: Hands-on Approach to Modern Quantum Algorithms. Packt Publishing Ltd, 2023.
References¶
- Santanu Ganguly. Quantum Machine Learning: An Applied Approach. Apress, 2021.
- https://docs.quantum.ibm.com/
- https://quantumai.google/cirq/experiments/textbook_algorithms
List of Practicals (30 hours)¶
- Install and configure a quantum computing framework such as IBM Qiskit or Google Cirq, and create basic quantum circuits using single-qubit gates to perform measurements. (3 Hours)
- Write a program to visualise qubit states and their rotations on the Bloch Sphere using suitable simulation tools. (2 Hours)
- Implement a program to demonstrate the concepts of superposition and entanglement using multi-qubit circuits. (3 Hours)
- Write a program to simulate the process of quantum teleportation using an entangled qubit pair. (3 Hours)
- Implement the Deutsch–Jozsa algorithm to identify whether a given function is constant or balanced. (3 Hours)
- Write a program to implement Grover's search algorithm for an unstructured search problem and analyze its efficiency. (4 Hours)
- Implement a simplified version of the Quantum Fourier Transform (QFT) for a small number of qubits and observe the results. (3 Hours)
- Write a program to demonstrate the Quantum Approximate Optimisation Algorithm (QAOA) for solving simple optimisation problems. (3 Hours)
- Write a program to generate and analyze quantum random numbers using measurement of superposition states. (4 Hours)
- Write and execute quantum circuits on different quantum-computing platforms and compare their performance and features. (2 Hours)