Details of PH5207 (Spring 2014)

Level: 5 Type: Theory Credits: 3.0

Course CodeCourse NameInstructor(s)
PH5207 Quantum Information Processing Ananda Dasgupta

Preamble
Intermediate Quantum Mechanics, Basic Statistical Mechanics, Basic Condensed Matter Physics

Syllabus

  • Motivation and Introduction: Classical and quantum computers; Strong and Weak Turing hypothesis (Church-Turing version etc); Efficient and Inefficient algorithms; Advantages of quantum computation; Single qubit operations and measurements; State space of two qubits; Multi-component systems and Product basis; Tensor products; multi-qubit operations.
  • Quantum Cryptography: Classical and Quantum Cryptography; The BB84 quantum key distribution protocol; Elementary discussion of security; Physical implementations.
    Entanglement: Entangled states; Bells inequality; Entanglement based cryptography; Quantum Dense Coding; Quantum Teleportation; Entanglement Swapping; von-Neumann entropy; Quantification of pure state entanglement. Mixed state entanglement; quantification of mixed state entanglement Concurrence.
  • Quantum Algorithms and Computation: Quantum no-cloning; The Deutsch-Jozsa algorithm; Quantum simulations; Quantum logic gates and circuits; Universal quantum gates; Quantum Fourier Transform; Phase Estimation; Shors algorithm; Grovers algorithm.
  • Decoherence and Quantum Error Correction: Decoherence; Errors in quantum computation and communication; Quantum error correcting codes; Elementary discussion of entanglement concentration and distillation.
  • Physical Realization of Quantum Computers

References

  1. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, South Asian Edition (2002)

Course Credit Options

Sl. No.ProgrammeSemester NoCourse Choice
1 IP 2 Not Allowed
2 IP 4 Not Allowed
3 MR 2 Not Allowed
4 MR 4 Not Allowed
5 MS 10 Elective
6 RS 1 Not Allowed
7 RS 2 Not Allowed