Lecture

Shor's Factoring Algorithm

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

PHYS-641: Quantum Computing

After introducing the foundations of classical and quantum information theory, and quantum measurement, the course will address the theory and practice of digital quantum computing, covering fundamental and advanced topics such as recent quantum algorithms ...

Description

This lecture covers Shor's factoring algorithm, which efficiently factors large numbers using quantum computers. The algorithm involves order finding, modular exponentiation, and quantum Fourier transform.

Instructor

Vincenzo Savona

Vincenzo Savona studied physics in Pisa at the Scuola Normale Superiore and the University of Pisa, prior to completing his PhD at the EPFL's Institute of Theoretical Physics. Subsequently he did post-doctoral work, first at the EPFL and then in the physics department of the Humboldt University of Berlin. In 2002, he returned to the EPFL to create his own research group, receiving a "professeur boursier" fellowship from the Swiss National Science Foundation. In 2006, he was appointed tenure-track assistant professor at the EPFL and joined the NCCR for Quantum Photonics. In 2010 he was appointed associate professor. Currently he directs the Laboratory of Theoretical Physics of Nanosystems.

Official source

Ontological neighbourhood

Theoretical computer science

Theory of computation: Quantum computing

Related concepts (32)

Quantum computing

A quantum computer is a computer that exploits quantum mechanical phenomena. At small scales, physical matter exhibits properties of both particles and waves, and quantum computing leverages this behavior, specifically quantum superposition and entanglement, using specialized hardware that supports the preparation and manipulation of quantum states. Classical physics cannot explain the operation of these quantum devices, and a scalable quantum computer could perform some calculations exponentially faster than any modern "classical" computer.

Shor's algorithm

Shor's algorithm is a quantum algorithm for finding the prime factors of an integer. It was developed in 1994 by the American mathematician Peter Shor. It is one of the few known quantum algorithms with compelling potential applications and strong evidence of superpolynomial speedup compared to best known classical (that is, non-quantum) algorithms. On the other hand, factoring numbers of practical significance requires far more qubits than available in the near future.

Quantum algorithm

In quantum computing, a quantum algorithm is an algorithm which runs on a realistic model of quantum computation, the most commonly used model being the quantum circuit model of computation. A classical (or non-quantum) algorithm is a finite sequence of instructions, or a step-by-step procedure for solving a problem, where each step or instruction can be performed on a classical computer. Similarly, a quantum algorithm is a step-by-step procedure, where each of the steps can be performed on a quantum computer.

Fourier transform

In physics and mathematics, the Fourier transform (FT) is a transform that converts a function into a form that describes the frequencies present in the original function. The output of the transform is a complex-valued function of frequency. The term Fourier transform refers to both this complex-valued function and the mathematical operation. When a distinction needs to be made the Fourier transform is sometimes called the frequency domain representation of the original function.

Quantum Fourier transform

In quantum computing, the quantum Fourier transform (QFT) is a linear transformation on quantum bits, and is the quantum analogue of the discrete Fourier transform. The quantum Fourier transform is a part of many quantum algorithms, notably Shor's algorithm for factoring and computing the discrete logarithm, the quantum phase estimation algorithm for estimating the eigenvalues of a unitary operator, and algorithms for the hidden subgroup problem. The quantum Fourier transform was discovered by Don Coppersmith.

Related lectures (64)

Shor Algorithm: Quantum Factorization

Covers the Shor algorithm for quantum factorization and the general formula for arithmetic periods.

The Period Finding Algorithm

Explores the Quantum Phase Estimation method for finding the period of a function using an oracle.

Quantum Phase Estimation

Explains the Quantum Phase Estimation (QPE) algorithm and its complexity using two registers and SWAP gates.

The Quantum Fourier Transform

Covers the Quantum Fourier Transform and its application in quantum computing, explaining the process of input values computation and the concept of complex numbers.

Quantum Jump: Theory and Algorithms