Quantum Computing and Cryptography

• Teachers
• Weekly hours
• Competences
• Objectives
• Contents
• Activities
• Teaching methodology
• Evaluation methodology
• Bibliography
• Previous capacities

Teachers

Person in charge

• Rosendo Rey Oriol ( )

Others

• Lluis Ametller Congost ( )

Weekly hours

Competences

Technical Competences

Common technical competencies

• CT1 - To demonstrate knowledge and comprehension of essential facts, concepts, principles and theories related to informatics and their disciplines of reference.
  • CT1.1A - To demonstrate knowledge and comprehension about the fundamentals of computer usage and programming, about operating systems, databases and, in general, about computer programs applicable to the engineering.
  • CT1.1B - To demonstrate knowledge and comprehension about the fundamentals of computer usage and programming. Knowledge about the structure, operation and interconnection of computer systems, and about the fundamentals of its programming.
  • CT1.2A - To interpret, select and value concepts, theories, uses and technological developments related to computer science and its application derived from the needed fundamentals of mathematics, statistics and physics. Capacity to solve the mathematical problems presented in engineering. Talent to apply the knowledge about: algebra, differential and integral calculus and numeric methods; statistics and optimization.
  • CT1.2B - To interpret, select and value concepts, theories, uses and technological developments related to computer science and its application derived from the needed fundamentals of mathematics, statistics and physics. Capacity to understand and dominate the physical and technological fundamentals of computer science: electromagnetism, waves, circuit theory, electronics and photonics and its application to solve engineering problems.
  • CT1.2C - To use properly theories, procedures and tools in the professional development of the informatics engineering in all its fields (specification, design, implementation, deployment and products evaluation) demonstrating the comprehension of the adopted compromises in the design decisions.

Transversal Competences

Reasoning

• G9 [Avaluable] - Capacity of critical, logical and mathematical reasoning. Capacity to solve problems in her study area. Abstraction capacity: capacity to create and use models that reflect real situations. Capacity to design and perform simple experiments and analyse and interpret its results. Analysis, synthesis and evaluation capacity.
  • G9.1 - Critical, logical and mathematical reasoning capacity. Capacity to understand abstraction and use it properly.

Technical Competences of each Specialization

Computer science specialization

• CCO1 - To have an in-depth knowledge about the fundamental principles and computations models and be able to apply them to interpret, select, value, model and create new concepts, theories, uses and technological developments, related to informatics.
  • CCO1.1 - To evaluate the computational complexity of a problem, know the algorithmic strategies which can solve it and recommend, develop and implement the solution which guarantees the best performance according to the established requirements.

Objectives

1. The student should be able to describe the behavior of micro particles.
   Related competences: G9.1,
2. The student should be able to list the postulates of quantum physics and apply them in specific cases.
   Related competences: G9.1,
3. The student should be able to work with quantum bits.
   Related competences: G9.1, CT1.2C, CCO1.1, CT1.2B,
4. Students must be able to extract the probabilities of making measurements in Quantum Physics from a superposition state.
   Related competences: CT1.2A, CT1.2B,
5. The student should be able to distinguish between separable states and entangled states.
   Related competences: G9.1,
6. Students must be able to apply entangled states in teleporting and dense coding.
   Related competences: CT1.1B, CT1.2B,
7. Students must be able to describe the logic of some quantum encryption algorithms: BB84 and B92 protocols.
   Related competences: G9.1, CCO1.1, CT1.1B, CT1.2B,
8. Students must be able to do simulations of the protocols BB84 and B92.
   Related competences: CT1.1B, CT1.2B,
9. Students must be able to describe the logic of quantum algorithms of academic interest: Deutsch, Deutsch-Jozsa generalizations and Vazirani.
   Related competences: G9.1, CT1.2C, CCO1.1, CT1.2B, CT1.1A,
10. The student should be able to implement the algorithm of Grover search for an item within an unstructured database.
    Related competences: G9.1, CT1.2A, CT1.2C, CCO1.1, CT1.1B, CT1.2B, CT1.1A,
11. Students must be able to implement the classic encryption algorithm RSA.
    Related competences: G9.1, CT1.2A, CT1.2C, CCO1.1, CT1.1B,
12. Students must be able to implement all the basic ingredients of Shor's factoring algorithm.
    Related competences: G9.1, CT1.2A, CT1.2C, CCO1.1, CT1.2B, CT1.1A,

Contents

1. Topic 1: Quantum Physics.
   Brief introduction to quantum physics and its importance in the microcosm world.
   The historical motivation is given and deepens especially in the wave-particle duality.
   The postulates of quantum physics are introduced, with special emphasis on the Schrödinger equation and the probabilistic nature of the measure.
   The solution to the Schrödinger equation for a potential well of infinite-dimensional is presented. The example contains all the basic ingredients for understanding the stationary states and also the superposition of states, which
   will have a prominent role for the description of quantum bits.
2. Topic 2: Qubits.
   Systems of two states: quantum bits (qubits).
   The basic operations through Kets and bras are introduced, the brackets as scalar products, superpositions of base's states.
3. Topic 3: Quantum cryptography.
   The basic principles of quantum cryptography are outlined. Protocols that use entanglement, such as Eckert's one and others, based on the measure's postulate such as BB84 and B92,
   are given detailed attention.
4. Topic 4: Quantum Logic. Gates and simple quantum algorithms.
   A description is given of:
   a) The temporal evolution of the qubits is given in terms of unitary operators operators and their connection with quantum logic gates.
   b) The minimal set of quantum logic gates that allows any computation performed on any system implying an arbitrary number of qubits.
   c) Quantum gate diagrams, as a flowchart of the computation.
   d) The evaluation of quantum functions, implemented by unitary operators.
   e) Simple quantum algorithms of academic interest are worked out:
   Deutsch, Deutsch-Jozsa and Vazirani.
5. Topic 5: Grover algorithm about finding elements of an unstructured database.
   The algorithm to find an item in an unstructured database, known as Grover's algorithm, which is able to locate it with an efficiency that scales as
   square root of N, N being the total number of items in the database.
6. Topic 6: Shor's factoring algorithm.
   From the foundations of the classical RSA encryption's algorithm, the Shor's quantum factoring algorithm is introduced.
   A detailed description is given, distinguishing those parts of the purely classical algorithm, requiring concepts of number theory, modular arithmetic and continuous fractions, from the quantum part, which uses the principle of superposition and quantum Fourier transform to extract the period of a periodic function, from which one can deduce the factors of the number to be factorized.

Activities

Activity Evaluation act

Teaching methodology

Evaluation methodology

Bibliography

Basic:

• Introducción a la física cuántica - French, A. P; Taylor, Edwin F, Reverté, 1982. ISBN: 8429141677
  https://discovery.upc.edu/discovery/fulldisplay?docid=alma991000372509706711&context=L&vid=34CSUC_UPC:VU1&lang=ca
• Quantum computation and quantum information - Nielsen, M.A.; Chuang, I.L, Cambridge University Press, 2000. ISBN: 0521635039
  http://cataleg.upc.edu/record=b1208065~S1*cat

Previous capacities