KBCNMU TY AI & DS syllabus

KBCNMU · Third Year B.E. Artificial Intelligence & Data Science · NEP 2020

Quantum Computing

AIDS-506 C · Elective I · Semester V · 3 credits · ISE 40 + ESE 60

One of the Elective I options.

All notes for this subject
  1. Unit 1: Fundamentals of Quantum Mechanics and Linear Algebra

    9 hours

    Quantum systems, measurement theory and randomness, photons, polarisation and spin; complex numbers, vectors, orthogonality, bra–ket notation, and unitary and orthogonal matrices.

    Examined in the 60-mark end-semester paper

    • Postulates of quantum mechanics
    • Photons, polarisation and spin
    • Hilbert spaces and linear operators
    • Hermitian and unitary operators
  2. Unit 2: Qubits and Quantum States

    9 hours

    Probability and quantum spin mathematics, equivalent state vectors, qubits and probability amplitudes, quantum interference, and the BB84 key distribution protocol.

    Examined in the 60-mark end-semester paper

    • Qubits and the Bloch sphere
    • Superposition and entanglement
    • Probability amplitudes and quantum interference
    • Quantum key distribution
  3. Unit 3: Quantum Entanglement and Bell's Inequality

    9 hours

    Tensor products, entangled and unentangled states, entanglement with CNOT, Bell's inequality, the EPR paradox and local realism, and the Ekert key distribution protocol.

    Examined in the 60-mark end-semester paper

    • Tensor products
    • Bell states and quantum teleportation
    • Bell's inequality and the EPR paradox
  4. Unit 4: Quantum Gates, Circuits and Communication

    9 hours

    Classical logic and reversible computation, quantum and universal gates, CNOT, the no-cloning theorem, Bell circuits, superdense coding, teleportation and quantum error correction.

    Examined in the 60-mark end-semester paper

    • Reversible computation
    • Quantum gates
    • Quantum circuits and measurement
    • No-cloning theorem
    • Superdense coding
    • Quantum error correction
  5. Unit 5: Quantum Algorithms and Applications

    9 hours

    Complexity classes, Deutsch's, Deutsch–Jozsa, Simon's, Shor's and Grover's algorithms, quantum supremacy, cryptanalysis, chemistry simulation and hardware challenges.

    Examined in the 60-mark end-semester paper

    • Deutsch-Jozsa algorithm
    • Simon's algorithm
    • Shor's algorithm
    • Grover's search algorithm
    • Quantum supremacy and hardware challenges

Unit contents are summarised from the official KBCNMU syllabus . AiCanCode.org is not affiliated with Kavayitri Bahinabai Chaudhari North Maharashtra University (KBCNMU).