CS2062 QUANTUM COMPUTING

CS2062 QUANTUM COMPUTING L T P C
3 0 0 3
UNIT I FOUNDATION 9
Overview of traditional computing – Church-Turing thesis – circuit model of computation
– reversible computation – quantum physics – quantum physics and computation – Dirac
notation and Hilbert Spaces – dual vectors – operators – the spectral theorem –
functions of operators – tensor products – Schmidt decomposition theorem
UNIT II QUBITS AND QUANTUM MODEL OF COMPUTATION 9
State of a quantum system – time evolution of a closed system – composite systems –
measurement – mixed states and general quantum operations – quantum circuit model –
58
quantum gates – universal sets of quantum gates – unitary transformations – quantum
circuits
UNIT III QUANTUM ALGORITHMS – I 9
Superdense coding – quantum teleportation – applications of teleportation – probabilistic
versus quantum algorithms – phase kick-back – the Deutsch algorithm – the Deutsch-
Jozsa algorithm – Simon's algorithm – Quantum phase estimation and quantum Fourier
Transform – eigenvalue estimation
UNIT IV QUANTUM ALGORITHMS – II 9
Order-finding problem – eigenvalue estimation approach to order finding – Shor's
algorithm for order finding – finding discrete logarithms – hidden subgroups – Grover's
quantum search algorithm – amplitude amplification – quantum amplitude estimation –
quantum counting – searching without knowing the success probability
UNIT V QUANTUM COMPUTATIONAL COMPLEXITY AND ERROR
CORRECTION 9
Computational complexity – black-box model – lower bounds for searching – general
black-box lower bounds – polynomial method – block sensitivity – adversary methods –
classical error correction – classical three-bit code – fault tolerance – quantum error
correction – three- and nine-qubit quantum codes – fault-tolerant quantum computation
TOTAL: 45 PERIODS
TEXT BOOK:
1. P. Kaye, R. Laflamme, and M. Mosca, “An introduction to Quantum Computing”,
Oxford University Press, 1999.
REFERENCES:
1. V. Sahni, “Quantum Computing”, Tata McGraw-Hill Publishing Company, 2007.