Save this video free

L23 Shor's Algorithm Part III and Bloch Sphere I

Quantum Computing, TCAD, Semicond by Hiu-Yung Wong · 1:14:20 · Watch on YouTube

Part of San Jose State University EE 225. See all 26 lectures and search them

These notes were made with YouTube Collector. Paste any YouTube link and get the same: a summary, chapters and a searchable transcript.

Overview

The lecture completes the Shor factoring workflow by tracing how measurements after the quantum Fourier transform reveal an approximation to the period, then using continued fractions and greatest common divisors to recover factors. It applies the method to N = 21 with a = 11 and period 6, then introduces the Bloch sphere by reducing a normalized one-qubit state to two observable parameters after ignoring global phase.

Key takeaways

Chapters

0:00 Shor’s Algorithm: Registers, Oracle, and Factoring Goal
4:01 C3: The Quantum Fourier Transform’s Superposed Output
6:28 Encoding N = 21 with a = 11 and Five-Bit Registers
9:17 Period Six: Function-Register Measurement and C4
15:04 C5: Measuring the 2n-Qubit Fourier Register
20:34 Fourier-Phase Interference Selects Period Information
25:28 Constructive Interference Gives k₀ / 2^(2n) Near d / r
29:05 Recovering the Period from the Measured Rational Approximation
32:18 Continued Fractions: The 77/256 Example
38:37 Validate Candidate Periods and Turn Them into Factors
42:01 One-Qubit State Parameters and Normalization
48:55 Global and Relative Phase in Bloch-Sphere Coordinates
55:54 Why a Global Phase Does Not Change Measurement Outcomes
1:01:18 Bloch Sphere: Embedding Qubit States and Identifying the Poles

Keep these chapters and the full searchable transcript in your own library.

Transcript excerpt

0:07 Last time we talked about Shaw's algorithm and we went all the way to S4 uh C4, right? And now let's just step back look at C3 to see what happened first. After C3, you remember we have uh three N cubits, right? um n needs to be larger than the lumber you want to f I mean two to the power n need to be larger than the lumber you want to factoriize remember but we need free n in order to implement the short algorithm we have uh hard gate what's the purpose not a harder market gate but two nqb hard gate what's the purpose even you don't know algorithm If someone

0:58 asks you what's the purpose of hard market usually >> superposition >> to create superposition right I will give this as a interview question if I interview anyone who want to work in formal computing right this is very basic and then we have the quantum oracle what type of oracle is this we have learned two types or of oracle what type of oracle is this do you know do you remember which are the two types that we have learned exclusive or and >> face. So what what type of oracle is this? Exclusive or oracle. Yeah. So I'm trying to review, right? You you need to understand this for your final exam. So so in other words,

1:47 if I did not teach short algorithm, I give you this circus in principle, you should be able to come up with what I'm saying here. Right? Of course, it's too much for such a short time in final. That's why we won't test that directly. But that is what you are expected to know at this point already. Okay. So, we have this quantum oracle. Usually, we

This is the start of the transcript. Save this video free for the whole transcript, searchable and time-coded.

In this course

Related notes

Summary, takeaways, and chapters were generated by AI from the video's transcript and may contain errors. The video belongs to its creator, Quantum Computing, TCAD, Semicond by Hiu-Yung Wong.

Want the full transcript?

Save this video in YouTube Collector to get its complete searchable transcript, your own AI summaries, and a library that keeps every video you collect in one place.