PHYS483: Quantum information processing—Lecture Notes Henning Schomerus, Lancaster University Contents I Quantum mechanics I.1 States I.2 Operators I.3 Dynamics I.4 Measurements I.5 Density matrix I.6 Two-state systems I.7 Composite systems and entanglement I.8 Bell inequalities II Classical computation II.1 von Neumann architecture II.2 Binary representation of information II.3 Quantifying classical information II.4 Operations II.5 Unary and binary gates II.6 Reversible gates II.7 Complexity of computational tasks II.8 Practical issues III Quantum information representation and manipulation III.1 Quantum bits III.2 Quantum information III.3 Quantum gates as unitary operations III.4 Single-qubit gates III.5 Two-qubit gates III.6 Composition of gates III.7 Function gates IV Quantum Communication IV.1 Superdense coding IV.2 Quantum teleportation IV.3 Secure communication V Quantum Computation V.1 Adding numbers V.2 Deutsch-Josza algorithm V.3 Grover’s quantum search algorithm V.4 Quantum Fourier transformation V.5 Applications: From phase estimation to prime factorization VI Error correction and practical issues VI.1 Errors and error correction VI.2 Practical requirements VII Further reading