Quantum Computing (CSE063)
This course on Quantum Computing (CSE063) teaches the fundamentals of quantum information processing, including quantum computation, quantum cryptography, and quantum information theory. Beginning with the classical circuit model and the Strong Church–Turing thesis, it builds up the linear algebra and Dirac notation needed for quantum mechanics, introduces the quantum circuit model, qubits, unitary operators, measurement and entanglement, and develops the first quantum algorithms (Deutsch, Deutsch–Jozsa and Simon). It also covers tools for analysing probabilistic algorithms, the discrete logarithm problem and the computation of Schmidt decompositions. It is designed for students at Sharda University pursuing computer science and engineering. Main text: An Introduction to Quantum Computing by Phillip Kaye, Raymond Laflamme and Michele Mosca (Oxford University Press).
📘 Syllabus (CSE063 - Theory)
-
Unit 1: Introduction
- A. Computers and the Strong Church–Turing Thesis, Circuit Model of Computation.
- B. A Linear Algebra Formulation of the Circuit Model, Reversible Computation. CO1
- C. Quantum Physics and Computation. CO1CO2
-
Unit 2: Linear Algebra and the Dirac Notation CO1CO2CO4
- A. The Dirac Notation and Hilbert Spaces, Dual Vectors, Operators.
- B. The Spectral Theorem, Functions of Operators.
- C. Tensor Products, The Schmidt Decomposition Theorem. CO1CO2
-
Unit 3: A Quantum Model of Computation CO1CO2
- A. The Quantum Circuit Model, Quantum Gates. CO1CO2CO5CO6
- B. Universal Sets of Quantum Gates, Efficiency of Approximating Unitary Transformations.
- C. Implementing Measurements with Quantum Circuits.
-
Unit 4: Introductory Quantum Algorithms CO1CO2CO3
- A. Probabilistic Versus Quantum Algorithms, Phase Kick-Back. CO1CO2CO3
- B. The Deutsch Algorithm, The Deutsch–Jozsa Algorithm. CO1CO2CO3
- C. Simon’s Algorithm.
-
Unit 5: Analysis Tools, Discrete Logarithms & Schmidt Decompositions
- A. Tools for Analysing Probabilistic Algorithms. CO2CO3CO4
- B. Solving the Discrete Logarithm Problem When the Order of a Is Composite. CO3CO4
- C. Computing Schmidt Decompositions. CO2CO4CO5
🎯 Course Outcomes (COs)
On successful completion of this course, students will be able to:
- CO1: Analyze the behavior of basic quantum algorithms.
- CO2: Demonstrate simple quantum algorithms.
- CO3: Simulate a simple quantum error-correcting code.
- CO4: Prove basic facts about quantum information channels.
- CO5: Explain quantum computing and quantum protocols.
- CO6: Illustrate information channels in the quantum circuit model.
📊 Evaluation Schemes
| Component | Theory (CSE063) |
|---|---|
| Total Marks | 100 (CA: 25 + MSE: 25 + ESE: 50) |
| Continuous Assessment |
• Assessment 1: 10 Marks (Units 1 & 2) • Assessment 2: 5 Marks (Units 3 & 4) • Assignment 1: 5 Marks (Units 1 & 2) • Assignment 2: 5 Marks (Units 3, 4, and 5) |
| Mid Semester Exam (MSE) | 25 Marks |
| End Semester Exam (ESE) | 50 Marks |
📚 Lectures
Theory lecture materials have been uploaded unit-wise.
Unit 1: Introduction
- 📑 Lecture Slides on Church–Turing, Circuit Model, Reversible & Quantum Computation
- 📖 Reference Book Chapter 1 An Introduction to Quantum Computing by P. Kaye, R. Laflamme and M. Mosca, Oxford University Press.
- 🔗 Additional Resource IBM Quantum Learning — hands-on introduction to qubits, gates and circuits.
Unit 2: Linear Algebra and the Dirac Notation
- 📑 Lecture Slides on Dirac Notation, Hilbert Spaces, Operators, Spectral Theorem, Tensor Products & Schmidt Decomposition
- 📖 Reference Book Chapter 2 An Introduction to Quantum Computing by P. Kaye, R. Laflamme and M. Mosca, Oxford University Press.
- 📖 Additional Reference (§2.1 Linear Algebra) Quantum Computation and Quantum Information by M. A. Nielsen and I. L. Chuang, Cambridge University Press.
Unit 3: A Quantum Model of Computation
- 📑 Lecture Slides on The Quantum Circuit Model, Quantum Gates, Universal Gate Sets, Solovay–Kitaev & Measurements
- 📖 Reference Book Chapter 4 An Introduction to Quantum Computing by P. Kaye, R. Laflamme and M. Mosca, Oxford University Press.
- 📖 Additional Reference (Ch. 4 Quantum Circuits) Quantum Computation and Quantum Information by M. A. Nielsen and I. L. Chuang, Cambridge University Press.
Unit 4: Introductory Quantum Algorithms
- 📑 Lecture Slides on Phase Kick-Back, the Deutsch and Deutsch–Jozsa Algorithms, and Simon’s Algorithm
- 📖 Reference Book Chapter 6 An Introduction to Quantum Computing by P. Kaye, R. Laflamme and M. Mosca, Oxford University Press.
- 🔗 Additional Resource Qiskit — implement and simulate Deutsch–Jozsa and Simon’s algorithms.
Unit 5: Analysis Tools, Discrete Logarithms & Schmidt Decompositions
- 📑 Lecture Slides on Probabilistic-Analysis Tools, the Discrete Logarithm Problem (Composite Order) & Computing Schmidt Decompositions
- 📖 Reference (Appendices A.1, A.2, A.7) An Introduction to Quantum Computing by P. Kaye, R. Laflamme and M. Mosca, Oxford University Press.
- 📖 Additional Reference Probability and Computing by M. Mitzenmacher and E. Upfal, Cambridge University Press.
📑 Assignments
📌 Common Instructions
- All assignments must be submitted before the due date.
- Upload your solution in PDF format.
- Plagiarism will not be tolerated.
- Late submissions may not be accepted.
- All assignments must be handwritten. Answers and solutions should be presented in a clear, step-by-step illustrative manner. Running text format will not be accepted.
- Students may be asked to explain their answers and solutions while obtaining the instructor’s signature. Grades will be awarded based on the explanation and understanding demonstrated.
- If any AI tools (such as GPTs) are used in preparing the assignment, students must also submit the complete script or prompt history along with the assignment.
📘 Assignment 1: Based on Unit-1 and 2
Due Date: To be announced
- All questions are compulsory.
- Prepared and Submit as a single PDF file.
- Submit scanned handwritten PDF document using the link mentioned below.
🔗 Submit Here
📘 Assignment 2: Based on Unit-3, 4 and 5
Due Date: To be announced
- All questions are compulsory.
- Include clear reasoning steps.
- Submit scanned handwritten PDF document using the link mentioned below.
🔗 Submit Here
❓ Post Your Doubts
Please fill in your details and doubt. Your submission will be recorded securely.
📅 Important Dates
- Assessment 1: To be announced (Units 1 & 2)
- Assessment 2: To be announced (Units 3 & 4)
- Assignment 1: To be announced (Submission)
- Assignment 2: To be announced (Submission)
- Mid Semester Exam: As per University Schedule
- End Semester Exam: As per University Schedule
📝 Course Feedback
💡 Your feedback is extremely valuable in improving the course content and teaching effectiveness. Please take a few minutes to share your thoughts and suggestions with me.
🚀 Fill Out the Feedback FormThanks From Your Course Instructor
Dear Students,
Thank you for your active participation in the course.
Your enthusiasm, curiosity, and commitment make this learning journey inspiring.
Keep asking questions, keep exploring, and never stop learning!
— Dr. Gopal Chandra Jana
(Course Instructor)