Quantum Computing

COMP39112 Quantum Computing 10 Semester 2 Undergraduate Level 3 Richard Banach Unit coordinator Department of Computer Science 1 FHEQ level (Framework for Higher Education Qualifications) ' Last part of a Bachelors ' European Credit Transfer & Accumulation System Rating : 5.0 Quantum computing is one of the most intriguing of modern developments at the interface of computing, mathematics and physics, whose long term impact is far from clear as yet. Trigger Warning: This course contains large amounts of mathematics of different kinds, and significant physics, which may upset some students.Quantum computing is one of the most intriguing of modern developments at the interface of computing, mathematics and physics, whose long term impact is far from clear as yet. The perspective that quantum phenomena bring to the questions of information and algorithm is quite unlike the conventional one. In particular, selected problems which classically have only slow algorithms, have in the quantum domain, algorithms which are exponentially faster. Most important among these is the factoring of large numbers, whose difficulty underpins the security of the RSA encryption protocol, used for example in the secure socket layer of the internet. If serious quantum computers could ever be built, RSA would become instantly insecure. This course aims to give the student an introduction to this unusual new field. ILO 1: Define concepts in quantum theory and be able to elicit the consequences of different quantum scenarios.ILO 2: Use a subset of linear algebra to express quantum concepts.ILO 3: Interpret and analyse simple quantum circuits. Analytical skills Innovation/creativity Problem solving Research State Transition Systems. Nondeterministic Transition Systems, Stochastic Transition Systems, and Quantum Transition Systems. The key issues: Exponentiality, Destructive Interference, Measurement.Review of Linear Algebra. Complex Inner Product Spaces. Eigenvalues and Eigenvectors. Diagonalisation. Tensor Products.Pure Quantum Mechanics. Quantum states. Unitary Evolution. Observables, Operators and Commutativity. Measurement. Simple Systems. The No-Cloning theorem. The Qubit.Entanglement. Schrodinger's cat. EPR states. Bell and CHSH Inequalities. The GHZ Argument. Basis copying versus cloning.Basic quantum gates. Simple quantum algorithms. Quantum Teleportation.Quantum Search (Grover's Algorithm). Quantum Fourier Transform. Phase estimation. Quantum Counting.Quantum Order Finding. Continued Fractions. Quantum Factoring (Shor's Algorithm). Lectures20Interactive sessionsInteractive sessions will be arranged as required    1 Written exam 100% Feedback is provided face to face or via email, in response to student queries regarding both the course exercises (5 formative exercise sheets with subsequently published answers) and the course material more generally. Pre-requisitesYou have to be happy to do plenty of mathematics, linear algebra in particular. The material is covered in the course itself (and includes topics in linear algebra not covered elsewhere), but it's a great help if you've seen (at least some) linear algebra before. By all means contact me if you're unsure. Y Quantum computing for computer scientists     Yanofsky, Noson S.,    Cambridge University Press    2008    ISBN: <a href="https://www.librarysearch.manchester.ac.uk/discovery/search?query=isbn,contains,9780511813887&search_scope=MyInst_and_CI&sortby=rank&vid=44MAN_INST:MU_NUI&lang=en&mode=advanced&offset=0" target="_blank">9780511813887</a> Quantum computation and quantum information     Nielsen, Michael A.,    Cambridge University Press    2010    ISBN: <a href="https://www.librarysearch.manchester.ac.uk/discovery/search?query=isbn,contains,9781107002173&search_scope=MyInst_and_CI&sortby=rank&vid=44MAN_INST:MU_NUI&lang=en&mode=advanced&offset=0" target="_blank">9781107002173</a> Lectures 24 0 76