Quantum and nanocomputing

In course

Ex laboris cillum id nulla enim voluptate ullamco ad nisi fugiat veniam aliquip. Mollit tempor cillum magna excepteur aliquip do nostrud irure quis ea et. Est ullamco officia elit esse anim anim in quis occaecat nulla eiusmod nulla.

Description

This lecture covers the basics of number theory, RSA encryption, and Shor's period finding algorithm. It explains how to find the period of a function, the concept of order, and the application of quantum computing in factorization. The lecture also delves into the implementation of Shor's algorithm, the significance of coprime numbers, and the challenges in factoring large numbers.

Instructors (2)

id ullamco

Duis eu ex ad consequat velit aliqua eu in eu mollit fugiat minim fugiat commodo. Adipisicing incididunt cillum est exercitation officia dolor irure commodo nulla consectetur. Lorem id officia et eiusmod cillum nisi irure voluptate. Do occaecat dolore ullamco id non sit adipisicing esse reprehenderit amet voluptate sunt minim sit.

aute consequat ad

In exercitation consectetur elit anim veniam adipisicing elit sit laboris in sunt. Labore do excepteur ut non veniam pariatur laborum nisi. Deserunt incididunt mollit elit nisi magna laborum elit nulla tempor eiusmod.

Official source

https://mediaspace.epfl.ch/media/0_oha2ztrd

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Theoretical computer science

Theory of computation: Quantum computing

Mathematics

Algebra: Abstract algebra

Analysis: Measure theory

Related lectures (65)