Syllabus - Quantum Computing (CSIT-803(B))
Computer Science & Information Technology
Quantum Computing (CSIT-803(B))
VIII-Semester
UNIT I
Introduction to quantum mechanics
Postulates of quantum mechanics, Qubit and quantum states, Vector Spaces, Single Qubit Gates, multiple Qubit Gates, Controlled Gates, Composite Gates, Matrices and operators.
UNIT II
Density operators
Density Operator for a Pure State, Density Operator for a Mixed State, Properties of a Density Operator, Characterizing Mixed States, Completely Mixed States, Partial Trace and Reduced Density Operator.
Quantum measurement theory
Distinguishing Quantum States and Measurement, Projective Measurements, Measurements on Composite Systems, Generalized Measurements, Positive Operator Valued Measures.
UNIT III
Entanglement
Quantum state entanglement, Bell’s Theorem, The Pauli Representation, Using Bell States For Density Operator Representation, Quantum gates and circuits: Single Qubit Gates, The Z Y Decomposition, Basic Quantum Circuit Diagrams, Controlled Gates, Application of Entanglement in teleportation and supper dense coding., Distributed quantum communication Quantum Computer: Guiding Principles, Conditions for Quantum Computation, Harmonic Oscillator Quantum Computer, Optical Photon Quantum Computer – Optical cavity Quantum electrodynamics, Ion traps, Nuclear Magnetic resonance.
UNIT IV
Quantum Algorithm
Hadamard Gates, The Phase Gate, Matrix Representation of Serial and Parallel Operations, Quantum Interference, Quantum Parallelism and Function Evaluation, Deutsch -Jozsa Algorithm, Quantum Fourier Transform, Phase Estimation, Shor’s Algorithm, Quantum Searching and Grover’s Algorithm
UNIT V
Quantum Error Correction
Introduction, Shor code, Theory of Quantum Error Correction, Constructing Quantum Codes, Stabilizer codes, Fault Tolerant Quantum Computation, Entropy and information –Shannon Entropy, Basic properties of Entropy, Von Neumann, Strong Sub Additivity, Data Compression, Entanglement as a physical resource.
Course Objective
The objective of this course is to provide the students an introduction to quantum computation. Much of the background material related to the algebra of complex vector spaces and quantum mechanics is covered within the course.
Course Outcome
["Analyze the behavior of basic quantum algorithms", "Implement simple quantum algorithms and information channels in the quantum circuit model", "Simulate a simple quantum error-correcting code", "Prove basic facts about quantum information channels"]
Practicals
Reference Books
-
Quantum Computing Explained: David McMahon, Wiley Interscience (IEEE Computer Science)
-
Quantum Computing without Magic Devices: Zdzislaw Meglicki; PHI
-
Quantum Computation and Quantum Information: M.A. Nielsen & Isaac L. Chuang, Cambridge University Press
-
Quantum Computing and communications: An Engineering Approach: Sandor Imre and Ferenc Balazs, Wiley