Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
6 views

CSEN4211 Introduction to Quantum Computing

The CSEN4211 course on Introduction to Quantum Computing aims to equip students with knowledge and skills to develop quantum algorithms and programs. It covers fundamental concepts, quantum circuits, algorithms, and applications, with a focus on practical implementation and industry relevance. Upon completion, students will understand quantum computing principles, analyze quantum algorithms, and develop applications in machine learning and cryptography.

Uploaded by

venkatasaketh2004
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
6 views

CSEN4211 Introduction to Quantum Computing

The CSEN4211 course on Introduction to Quantum Computing aims to equip students with knowledge and skills to develop quantum algorithms and programs. It covers fundamental concepts, quantum circuits, algorithms, and applications, with a focus on practical implementation and industry relevance. Upon completion, students will understand quantum computing principles, analyze quantum algorithms, and develop applications in machine learning and cryptography.

Uploaded by

venkatasaketh2004
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

CSEN4211 INTRODUCTION TO QUANTUM L T P S J C

COMPUTING 3 0 0 0 0 3
Pre-requisite CSEN 2001 Data Structures, CSEN 3001 Design and Analysis of Algorithms
MATH2361 Probability and Statistics, MATH2291 Linear Algebra
CSEN1021 Programming in Python
Co-requisite None
Preferable
None
exposure

Course Description:

The objective of this course is to impart necessary knowledge of Quantum Computing


Technologies to the learner, so that he/she can develop and implement algorithms and write
programs using these algorithms to design and develop Quantum machines which is a cutting-
edge technology. Students will solve quantum computing problems with the knowledge gain
during this coursework
Course Objectives

1. Explain the working of a Quantum Computing program, its architecture and program model
2. Develop universal gates circuits on available simulators
3. Illustrate the advantage of superposition and entanglement
4. Understand and Develop quantum algorithms to solve real world quantum problems
5. Demonstrate the applications of quantum computing

UNIT - I Introduction to Quantum Computing 9 hours

Motivation for studying Quantum Computing, Major players in the industry (IBM, Microsoft,
Rigetti, D-Wave etc.), Origin of Quantum Computing, Overview of major concepts in Quantum
Computing: Qubits and multi-qubits states, Bra-ket notation, Bloch Sphere representation
(1.1., 1.2., 1.3.,)
Math Foundation for Quantum Computing (Matrix Algebra): basis vectors and orthogonality,
inner product and Hilbert spaces, matrices and tensors, unitary operators and projectors, Dirac
notation, Eigen values and Eigen vectors (2.1)
Learning Outcomes:
After completion of this unit, the student will be able to
• Examine the roles various Industry applications in Quantum Computing L3
• Distinguish Classical and Quantum bits L3
• Understand the elements and goals quantum computing L2
Pedagogy tools: Classroom teaching, self-reading, Lab work /demonstration

UNIT – II Quantum Circuits Building Blocks for Quantum Program 9 hours


Quantum Algorithms, Single Qubit operations, Controlled operations, Measurement, Universal
quantum gates, Simulation of quantum systems (4.1 to 4.5, 4.7)
Learning Outcomes:
After completion of this unit, the student will be able to
• Recognize strategies to build universal quantum gates (L2)
• Examine simulations of quantum systems ( L3 )
• Understand the purpose of quantum measurement (L2 )
Pedagogy tools: Classroom teaching, self-reading, Lab Work/demonstration
UNIT – III Tensor Products, Teleportation and Super Dense Coding 9 hours
Tensor Products, Multi Q-Bit system, Super Position, Entanglement, Decoherence, quantum
teleportation, no-cloning theorem super dense coding (10th chapter of Book 2), Quantum
Fourier transformations and its applications (5.1., 5.2., 5.3.)
Learning Outcomes:
After completion of this unit, the student will be able to
• Demonstrate engagement and superposition ( L3 )
• Use of tensor products to design development quantum algorithms ( L2)
• Illustrate applications of QFT (L2)
Pedagogy tools: Classroom teaching, self-reading, Lab Work/demonstration
UNIT – IV Quantum Algorithms 9 hours
Hadamard Gates, phase gate, Quantum interference, Quantum parallelism a function
evaluation, Deutsch-Jozsa Algorithm, Phase Estimation, Shor’s algorithm, Quantum Searching
and Grover’s Algorithm (9th chapter of Book 2)
Learning Outcomes:
After completion of this unit, the student will be able to
• Understand Shor’s algorithm for cryptography (L2 )
• Examine Deutsch-Jozsa algorithm for period function evaluation L3
• Analyze Grover’s algorithm for searching L2
Pedagogy tools: Classroom teaching, self-reading, Lab Work /demonstration

UNIT – V Quantum Errors & Quantum Computing Applications 9 hours


Single -Qubit error, Quantum Operations and Krauss Operations. Quantum Machine Learning
(SVM), Quantum Cryptography ( QKD, Post-Quantum Cryptography)
Learning Outcomes:
After completion of this unit, the student will be able to
• Understand what is qubit/quantum error L2
• Analyze QSVM for machine learning applications L3
• Illustrate QKd for key distribution L2
Pedagogy tools: Classroom teaching, self-reading, Lab Work /demonstration
Reference Book(s):
1.Michael A. Nielsen, “Quantum Computation and Quantum Information”, Cambridge
University Press
2.David McMahon, “Quantum Computing Explained”, Wiley
NPTEL Coursera Courses:
1. Introduction to Quantum Computing: Quantum Algorithms and Qiskit, IBM and IITM
2. Introduction to Quantum Information

Website(s)/ Other Resources:

https://nptel.ac.in/courses/106106232
https://www.coursera.org/programs/gitam-open-learning-7qv77/learn/introduction-to-
quantum-information?authProvider=gitam&source=search
Open Source Softwares/Toolkits

IBM quantum experience


Microsoft Q
Rigetti PyQuil (QPU/QVM)
List of Programs, Exercises & Further Study

Building Quantum dice


Building Quantum Random No. Generation
Composing simple quantum circuits with q-gates and measuring the output into classical bits.
Implementation of Shor’s Algorithms
Implementation of Grover’s Algorithm
Implementation of Deutsch’s Algorithm
Implementation of Deutsch-Jozsa’s Algorithm
Mini Project such as implementing an API for efficient search using Grover’s Algorithms or
Integer factorization using Shor’s Algorithm

List of Resources
Course Outcomes:

After successful completion of the course the student will be able to:
1. Understand underlying principles of Quantum Computing
2. Analyse the matrix operators for universal quantum gate
3. Demonstrate quantum Fourier transformation
4. Analyse quantum algorithms for searching
5. Develop a quantum computing application for machine learning/Key distribution

Programme Outcomes (POs) PSOs

1 2 3 4 5 6 7 8 9 10 11 12 1 2 3

CO1 1 3 2 1 2 1 1 3 1 2

CO2 1 2 1 2 1 1 1 2 1 2

CO3 2 1 2 1 1 1 1 3 2 2

CO4 1 1 1 2 2 1 1 2 1 2

CO5 2 1 1 1 1 1 1 2 2 2

1-Low, 2- Medium and 3- High Correlation

APPROVED IN:
BOS : :<< date >> ACADEMIC COUNCIL: :<< date >>

SDG No. & Statement:


SDG 8 - Decent work and Economic Growth
SDG 9 - Industry, Innovation and Infrastructure
SDG Justification: This course introduces quantum computing technologies which are future
generation computing systems. This computing may create a new paradigm of computing
and the industry is looking at this as great challenge. This course teaches Quantum algorithms
and various applications of quantum computing may seed the knowledge that directs
sustainable development of new innovations, infrastructure as well as industry in turn the
economic growth of the nation.

You might also like