YoVDO

Finding "L" from the Clues - Quantum Computer Programming - Lesson 87

Offered By: Ryan O'Donnell via YouTube

Tags

Quantum Computing Courses Number Theory Courses Algorithm Design Courses Computational Complexity Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore an efficient classical algorithm for determining the mystery cycle length "L" using random clues generated by Rotation Estimation in this 20-minute video lesson. Learn how to interpret and utilize these clues to uncover the hidden cycle length as part of the "Quantum Computer Programming in 100 Easy Lessons" series. Delve into the intersection of classical and quantum computing techniques, guided by Ryan O'Donnell from Carnegie Mellon University. Gain insights into problem-solving strategies applicable to quantum algorithms and their classical counterparts.

Syllabus

#87/100: Finding "L" from the clues || Quantum Computer Programming in 100 Easy Lessons


Taught by

Ryan O'Donnell

Related Courses

Natural Language Processing
Columbia University via Coursera
Intro to Algorithms
Udacity
Conception et mise en œuvre d'algorithmes.
École Polytechnique via Coursera
Paradigms of Computer Programming
Université catholique de Louvain via edX
Data Structures and Algorithm Design Part I | 数据结构与算法设计(上)
Tsinghua University via edX