Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Quantum Order Finding with QPE

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 the Quantum Order Finding algorithm using Quantum Phase Estimation (QPE), focusing on Shor's factoring algorithm. It explains the process of finding the order of a number modulo N and its link to integer factorization.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

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.

Set theory

Set theory is the branch of mathematical logic that studies sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory, as a branch of mathematics, is mostly concerned with those that are relevant to mathematics as a whole. The modern study of set theory was initiated by the German mathematicians Richard Dedekind and Georg Cantor in the 1870s. In particular, Georg Cantor is commonly considered the founder of set theory.

Set (mathematics)

A set is the mathematical model for a collection of different things; a set contains elements or members, which can be mathematical objects of any kind: numbers, symbols, points in space, lines, other geometrical shapes, variables, or even other sets. The set with no element is the empty set; a set with a single element is a singleton. A set may have a finite number of elements or be an infinite set. Two sets are equal if they have precisely the same elements. Sets are ubiquitous in modern mathematics.

Related lectures (58)

Shor's Factoring Algorithm

Covers Shor's factoring algorithm, which efficiently factors large numbers using quantum computers.

Order finding algorithm

Explores the order finding algorithm, focusing on efficiently finding the period modulo N using Quantum Phase Estimation and C-U gates.

Shor's Factoring Algorithm

Covers Shor's factoring algorithm, aiming to find integer factors efficiently using quantum computation.

The Period Finding Algorithm

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

Quantum Phase Estimation: Basics and Applications