KBCNMU TY Computer syllabus

KBCNMU · Third Year B.E. Computer Engineering · NEP 2020

Quantum Computing

CS-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: Quantum Mechanics and Linear Algebra

    9 hours

    Quantum systems, measurement 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
    • Linear algebra for quantum computing
    • Complex vectors, Dirac notation and the Bloch sphere
  2. Unit 2: Qubits and Quantum States

    9 hours

    Probability and 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, superposition and entanglement
    • Qubit states, measurement and probability
    • Quantum cryptography
  3. Unit 3: Entanglement and Bell's Inequality

    9 hours

    Tensor products, entangled and unentangled states, generating 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

    • Multi-qubit states and tensor products
    • Controlled gates and Bell states
    • 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, the Bell circuit, superdense coding, teleportation, and quantum error correction.

    Examined in the 60-mark end-semester paper

    • Single-qubit gates
    • Universal quantum gates
    • Quantum circuits and the no-cloning theorem
    • Superdense coding
    • Quantum teleportation
    • Quantum error correction
  5. Unit 5: Quantum Algorithms and Applications

    9 hours

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

    Examined in the 60-mark end-semester paper

    • Quantum computational complexity
    • Deutsch and Deutsch–Jozsa algorithms
    • Simon's algorithm
    • Shor's algorithm
    • Grover's search algorithm
    • Quantum simulation

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