Page 26 - REC :: M.E. CSE Curriculum and Syllabus - R2019

CP19P07 QUANTUM COMPUTING Category L T P C
PE 3 0 0 3

Objectives:
⚫ To know the fundamentals of Quantum computing and its Applications.
To understand the efficient quantum algorithms for several basic promise problems
⚫
To gain knowledge about quantum noise and operations.
⚫
To gain knowledge about different quantum error correction techniques.
⚫
Solving various case studies by applying quantum information theory.
⚫

UNIT-I FOUNDATION 9
Introduction and overview - Quantum bits - Quantum computation - Quantum algorithms - Experimental quantum
information processing - Quantum information. Quantum mechanics - Linear algebra - The postulates of quantum
mechanics - Application: super dense coding. Models for computation - The analysis of computational problems.
UNIT-II QUANTUM MODEL OF COMPUTATION 9
Quantum circuits- Quantum algorithms - Single qubit operations - Controlled operations and Measurement - Universal
quantum gates. The quantum Fourier transforms - Phase estimation and applications. Quantum search algorithms -
Quantum search as a quantum simulation - Quantum counting - Speeding up the solution of NP-complete problems -
Quantum search of an unstructured database - Optimality of the search algorithm - Black box algorithm limits.
Quantum computers: physical realization.
UNIT-III QUANTUM INFORMATION 9
Quantum noise and quantum operations - Classical noise and Markov processes - Quantum operations – Examples –
Applications – Limitations. Distance measures for quantum information.
UNIT-IV QUANTUM ERROR CORRECTION 9
Introduction - The 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 entropy - Strong sub-additivity.
UNIT-V QUANTUM INFORMATION THEORY 9
Distinguishing quantum states and the accessible information - Data compression - Classical information over noisy
quantum channels - Quantum information over noisy quantum channels - Entanglement as a physical resource -
Quantum cryptography.
Total Contact Hours : 45

Course Outcomes:
Upon completion of the course, students will be able to:
⚫ Basics of Quantum computing and its Applications.
⚫ Solve various problems using quantum algorithms.
⚫ Solve problems using quantum noise and operations.
⚫ Gain knowledge about different quantum error correction techniques.
⚫ Apply quantum information theory in various case studies.

Reference Books(s) / Web links:
M.A. Nielsen and Chuang,“Quantum Computation and Quantum Information”, Cambridge University Press
1
2000.
2 V. Sahni, “Quantum Computing”, Tata McGraw-Hill Publishing
3 Nielsen M. A., “Quantum Computation and Quantum Information”, Cambridge University Press 2002.
Benenti G., Casati G. and Strini G., “Principles of Quantum Computation and Information, Vol. I: Basic
4
Concepts, Vol II: Basic Tools and Special Topics”, World Scientific 2004.
5 http://www.theory.caltech.edu/people/preskill/ph229/\