-
Quantum computing exploits the quantum mechanical nature of matter to simultaneously exist in multiple possible states. Building up on the digital binary logic of bits, quantum computing is built on the basis of interacting two-level quantum systems or ‘qubits’ that follow the laws of quantum mechanics. Addressability of the quantum system and its fragility to fidelity are the major issues of concern, which if addressed appropriately, will enable this new approach to revolutionize the present form of computing. After developing the basics, this course delves on various implementation aspects of quantum computing and quantum information processing.
INTENDED AUDIENCE: Both Senior UG and PG students
CORE/ELECTIVE: Core
INDUSTRY SUPPORT: Intel, Microsoft Research
Overview
Syllabus
-
COURSE LAYOUT
•Quantum Measurements Density Matrices
•Positive-Operator Valued Measure
•Fragility of quantum information: Decoherence
•Quantum Superposition and Entanglement
•Quantum Gates and Circuits
•No cloning theorem & Quantum Teleportation
•Bell’s inequality and its implications
•Quantum Algorithms & Circuits
•Deutsch and Deutsch–Jozsa algorithms
•Grover’s Search Algorithm
•Quantum Fourier Transform
•Shore’s Factorization Algorithm
•Quantum Error Correction: Fault tolerance
•Quantum Cryptography
•Implementing Quantum Computing: issues of fidelity
•Scalability in quantum computing
•NMR Quantum Computing
•Spintronics and QED approaches
•Linear Optical Approaches
•Nonlinear Optical Approaches
•Limits of all the discussed approaches
•How promising is the future?
