The course provides the essential foundations of quantum physics by applying them to the world of computing and cryptography and highlights its most important aspects:
Quantum computing allows, in principle, dramatic increases in computing power thanks to the possibility of superposition of quantum bits.
Quantum cryptography is a realistic alternative to current cryptographic techniques, which would be vulnerable if quantum computing becomes feasible in the near future.
Teachers
Person in charge
Rosendo Rey Oriol (
)
Others
Lluis Ametller Congost (
)
Weekly hours
Theory
2
Problems
2
Laboratory
0
Guided learning
0
Autonomous learning
6
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
The student should be able to describe the behavior of micro particles.
Related competences:
G9.1,
The student should be able to list the postulates of quantum physics and apply them in specific cases.
Related competences:
G9.1,
The student should be able to work with quantum bits.
Related competences:
G9.1,
CT1.2B,
CT1.2C,
CCO1.1,
Students must be able to extract the probabilities of making measurements in Quantum Physics from a superposition state.
Related competences:
CT1.2B,
CT1.2A,
The student should be able to distinguish between separable states and entangled states.
Related competences:
G9.1,
Students must be able to apply entangled states in teleporting and dense coding.
Related competences:
CT1.1B,
CT1.2B,
Students must be able to describe the logic of some quantum encryption algorithms: BB84 and B92 protocols.
Related competences:
G9.1,
CT1.1B,
CT1.2B,
CCO1.1,
Students must be able to do simulations of the protocols BB84 and B92.
Related competences:
CT1.1B,
CT1.2B,
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.1A,
CT1.2B,
CT1.2C,
CCO1.1,
The student should be able to implement the algorithm of Grover search for an item within an unstructured database.
Related competences:
CT1.1A,
CT1.1B,
CT1.2A,
CT1.2B,
CT1.2C,
CCO1.1,
G9.1,
Students must be able to implement the classic encryption algorithm RSA.
Related competences:
G9.1,
CT1.1B,
CT1.2A,
CT1.2C,
CCO1.1,
Students must be able to implement all the basic ingredients of Shor's factoring algorithm.
Related competences:
CT1.1A,
CT1.2A,
G9.1,
CT1.2B,
CT1.2C,
CCO1.1,
Contents
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.
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.
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.
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.
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.
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
ActivityEvaluation act
Introduction and summary of the content of the course.
Slides with all the course's contents are displayed and commented, thus being an introduction and summary at the same time. Objectives:231 Contents:
Control of solving problems related to items 5 and 6.
It is a control about solving problems in class by students. Objectives:111012 Week:
14
Theory
0h
Problems
1h
Laboratory
0h
Guided learning
0h
Autonomous learning
10h
Final exam
Final test for those students who aim for a better grade or those that have failed the continued evaluation Objectives:231179101215468 Week:
15 (Outside class hours)
Theory
2h
Problems
0h
Laboratory
0h
Guided learning
0h
Autonomous learning
0h
Teaching methodology
The theoretical content is worked out in theory classes followed by sessions of classes of problems, or in mixed theory/problem classes.
Evaluation methodology
The technical skills grade results from 2 contributions:
- Arithmetic mean of 4 exams that are performed during the year (C)
- Arithmetic mean of exercises to do at home (E)
The continuous assessment (AC) grade is computed as: AC = 0.8 + 0.2 * C * E
There will be a final exam (with grade F) for those students who have not passed the continuous assessment, or wish to improve their AC grade.
The final grade will be the maximum between AC and F.
The grade of the transversal competence G9.1 will be determined from the exams of the continuous assessment, with grades: A (excellent), B (best), C (adequate), D (not completed).