Summer of Math Exposition

Nice video, especially visuals that help people understand what this video conveys. Could’ve been a lot better if some math expressions were included to back up the visuals more concretely. Great one!

You did a good job explaining the 2 goals at the beginning of the video. I always like to see the logs applied. You did a good job of explaining the logs. It’s also neat to see the rational and irrational numbers to come into play. Good connection to the history from Claude. Neat topic!

As a standalone entry not watched as part of your lecture series, the explanations felt handwavey and as such I felt I did not come out of this with a better understanding of the capabilities of QC

I’m glad to see a topic that might seem complicated explained so well, step by step and with clarity. The video may be a bit too long for high school students, but if I needed it, I would share it with the class. At the same time, perhaps it would have been possible to reach greater depth. Keep it up :)

This is a best explanation of quantum computing I have ever heard

Initial Thoughts

Good choice of topic. Quantum computing is coming up a lot recently, so learning more about this background information of different approaches to answering binary questions was helpful.

What Went Well

I thought your explanation of why log base 2 is the fastest we can reliably answer a question was really good. The decision trees were helpful for seeing that. You also kept your explanations in terms that high-schoolers would understand, so well done there.

Ideas for Improvement

Early on in the video, you said that you were going to cover the Deutsch algorithim, but by the end of the video, you changed your mind and saved it for another video. I think that was probably a good call to limit the scope of this video the way you did so you can dive into a specific algorithim in another video, I think it would have been good to trim those bits saying you were covering it in this one. They made it feel like something was missing from the video by the end.

The information theory you’re presenting here is fairly interesting, and I think you do a good job of presenting it in a way which is engaging for someone learning it for the first time. That said, I do find it a bit frustrating how the most nontrivial parts of what you’re saying (1 bit per question being the “speed limit” and the quantum computer having the ability to “hear the click”) are sort of handwaved: I’m trying not to be too harsh about it but it’s hard to come away with an understanding of why these things are true as opposed to just the fact that they are true.

Well done. I hadn’t heard about the “speed of information” before and it was well explained.

Good explanation of classical information. The method of presentation makes it intuitive and accessible to a non-technical audience. The lack of explanation of Grover’s algorithm was disappointing. The production quality could use some work.

Motivation: The video introduces the idea of the “speed of information,” which is interesting and worth exploring, but the introduction feels underdeveloped. While the author mentions the Deutsch-Jozsa algorithm as a motivating example, they defer the actual explanation to another video. This comes across as a missed opportunity, since the video raises a question but doesn’t fully answer it, relying instead on intuitive arguments. A stronger introduction would briefly explain why “speed of information” matters in the context of quantum computing and then directly tie that to the examples shown.

Clarity: The opening is a bit clunky: for a high-school-level audience, it might be better to first define what a quantum computer is in simple terms, then explain how “speed of information” is understood in that context. Similarly, instead of saying “we all know the speed of the universe is 300,000 km/s,” which risks alienating viewers, the video could simply state this fact and then connect it to the topic at hand. This would make the introduction more approachable and self-contained.

Later in the video, the use of examples (like guessing a number between 1 and 8) works well for motivating different “speeds of information.” However, when moving from specific examples to general cases, the underlying assumptions should be made explicit. For instance, the binary search example implicitly requires an ordering to be defined, but this is never mentioned which leaves a gap in clarity and can create confusion for questions that aren’t as simple as the one given in the initial example or the one with the coins.

The table shown at 10:55 could also confuse viewers. Since the video has the “high school level” label, it would help to provide a loose definition of asymptotic notation along the lines of: “As the input gets really large, this is how the number of steps (or time) grows compared to the input size.” Without such framing, the table risks coming across as technical rather than illuminating.

Novelty: The strength of the video lies in its use of intuitive examples to convey abstract concepts, such as tree structures and binary search. These choices make the topic more relatable than a purely theoretical treatment. The style feels like part of a larger series, which could make it more valuable if the pieces are viewed together.

Memorability: The specific examples (guessing numbers, binary search) are memorable teaching devices, but the lack of a clear, motivating introduction and a well-defined conclusion weakens the overall takeaway. To leave a stronger impression, the video could more directly answer its own central question: what is meant by the “speed of information” and can quantum computers break this speed?