Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

An Efficient Quantum Factoring Algorithm - Quantum Colloquium

Simons Institute via YouTube

Overview

Explore an innovative quantum factoring algorithm presented by Oded Regev from NYU in this 1 hour 53 minute Quantum Colloquium talk. Delve into the details of a method that can factorize n-bit integers using a quantum circuit with \tilde{O}(n^{3/2}) gates, run \sqrt{n}+4 times independently, followed by classical post-processing. Compare this approach to Shor's algorithm, which requires circuits with \tilde{O}(n^2) gates. Understand the number-theoretic heuristic assumption underlying the algorithm's correctness, similar to those used in subexponential classical factorization algorithms. Consider the potential implications and limitations of this method for practical physical implementations. The talk includes a panel discussion starting at 1:08:21, providing further insights and perspectives on this cutting-edge research in quantum computing and cryptography.

Syllabus

An Efficient Quantum Factoring Algorithm | Quantum Colloquium

Taught by

Simons Institute

Reviews

Start your review of An Efficient Quantum Factoring Algorithm - Quantum Colloquium

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.