Загрузка видео...

Не удалось загрузить видео

На главную

The secret behind quantum search efficiency

3,241,785 просмотров • 7 месяцев назад •via X (Twitter)

Комментарии: 34

Фото профиля Axel
Axel7 месяцев назад

Why "quantum" tho? I'd just start a new thread every time I see a new path

Фото профиля Берлинский Олень
Берлинский Олень7 месяцев назад

It's called BFS and not quantum search 🤡

Фото профиля Dr. Md. Amir Khusru Akhtar
Dr. Md. Amir Khusru Akhtar7 месяцев назад

It’s not faster because it runs harder — it’s faster because it lets the wrong answers cancel themselves.

Фото профиля Govind
Govind7 месяцев назад

So grover's algorithm is basically Naruto using Shadow Clone Jutsu to search the whole forest at once, then cancels all clones except the one that found the ramen?

Фото профиля Moravyalı
Moravyalı7 месяцев назад

That's parallel computing and it's not faster than Dijkstra in terms of computational complexity.

Фото профиля Aanshul Sadaria
Aanshul Sadaria7 месяцев назад

Why does this look like BFS?

Фото профиля Hawkeye
Hawkeye7 месяцев назад

So slime mold is a biological quantum search? It searches all possible pathways, and then reinforces only the shortest path branches that have found food.

Фото профиля Rex⚡Volt
Rex⚡Volt7 месяцев назад

The improbability drive has arrived.

Фото профиля Pat the Irishman
Pat the Irishman7 месяцев назад

And this is why your binary passwords are worthless against quantum computers

Фото профиля Smit
Smit7 месяцев назад

I think it'll also help people to understand quantum computing:

Фото профиля TUVegeto137
TUVegeto1377 месяцев назад

You make it look like quantum computing is just parallel computing. It's not.

Фото профиля 𝓛𝓪𝓾𝓭𝓮𝓵𝓲𝓷𝓸
𝓛𝓪𝓾𝓭𝓮𝓵𝓲𝓷𝓸7 месяцев назад

Seems like a thread

Фото профиля MrBlindMouse
MrBlindMouse7 месяцев назад

So its just an async Breadth-First search?

Фото профиля Rahul
Rahul7 месяцев назад

Grover's algorithm is fascinating because it achieves quadratic speedup over classical search - O(√N) vs O(N). But the real challenge isn't the algorithm, it's maintaining quantum coherence long enough to run it at scale. Quantum error correction is the bottleneck we're solving now.

Фото профиля Lukas Süss
Lukas Süss7 месяцев назад

@sciencegirl — Not true or at least misleading. Quantum comuting is still strictly less powerful compared to true parallel computing due to the random sampling constraint. (Ignoring physical impossibility of such parallelism.)

Фото профиля Δημήτρης Βουζουναράς
Δημήτρης Βουζουναράς7 месяцев назад

Nothing to do with... quantum anything... The one is a linear pathfinder, while the second is a multi-threaded one, creating a new thread (job, worker) for any possible new path, killing it when it arrives to a dead-end. Quantum computing is still a myth.

Фото профиля Jason Dadness
Jason Dadness7 месяцев назад

@grok is this a good description of quantum computing?

Фото профиля Hemant
Hemant7 месяцев назад

So classical computers panic, quantum computers just vibe and arrive.

Фото профиля ItsBS
ItsBS7 месяцев назад

Quantum Computing is fake. Quantum State Superposition is a lie. Don't be fooled, like so many others, because this idea of "parallelism" has already been proven false in experiments. Classical superposition of the wavefunction exists, but Born's ad-hoc "probabilities" do not.

Фото профиля Craig Swann - model citizen, zero discipline
Craig Swann - model citizen, zero discipline7 месяцев назад

I've yet to find an explanation of how a bit being a 1 and 0 simultaneously, is useful.

Фото профиля AWeirdRobot
AWeirdRobot7 месяцев назад

Wrong

Фото профиля Anthony Schmitt
Anthony Schmitt7 месяцев назад

Stop searching like it's 2020. Classical linear search is officially a bottleneck for Big Data. The future? Quadratic speedup. Grover’s Algorithm isn't just theory—it’s the new strategic edge for 2026.👇 #QuantumComputing #Algorithm #DeepTech @sciencegirl

Фото профиля Miggy Ferrero Rocher
Miggy Ferrero Rocher7 месяцев назад

Like, oh my gawd, nooo way, that's totally not correct, duh! 🙄

Фото профиля Ludic labs
Ludic labs7 месяцев назад

The real magic isn’t speed. It’s exploring better paths before committing to one.

Фото профиля MoroAI
MoroAI7 месяцев назад

Why not look at it from above recognize where the exit is and then take the best path

Фото профиля G Labs
G Labs7 месяцев назад

This quantum search method for solving mazes looks like a backwards version of the Dead End Filling Algorithm, where false paths are colored in starting from dead ends, leaving the correct path revealed. Here's my mini lecture and demonstration of it:

Фото профиля Elena_ The HumanistPoet
Elena_ The HumanistPoet7 месяцев назад

I need an agent to navigate my life. Best path forward please.

Фото профиля Ben
Ben7 месяцев назад

A* algorithm entered the chat. If you're out here solving mazes by trying every goddamn dead-end like a drunk toddler with a death wish... congrats, you've discovered the slowest, most soul-crushing way possible. Real maze algorithms don't wander around like lost tourists.

Фото профиля Steve Nicklin
Steve Nicklin7 месяцев назад

I might be wrong but is the same approach that CHIP (Constraint Handling in Prolog) took in the 1980's (yes you read that right 1980's!) Try Quantum Search against the 8 Queens Problem on a 64x64 chess board and see if it is as quick!

Фото профиля Göktuğ
Göktuğ7 месяцев назад

This algorithm is not entirely suitable for parallelization. Some agents may have to follow the path for a very long time, which actually makes the algorithm inefficient to run both on CPU and GPU.

Фото профиля Hold this L~
Hold this L~7 месяцев назад

if quantum can search at multiple path in the same time, why cant normal search just go multiple path search too?

Фото профиля SereneLoop
SereneLoop7 месяцев назад

Wow thats great fo you that you know about quantum search efficiency

Фото профиля Potato
Potato7 месяцев назад

It's called BFS, and it's computationally heady in space. You're trading memory for time, as always. There is no miracle solutions.

Фото профиля Cloud.
Cloud.7 месяцев назад

And that's exactly how we humans are built in multiple universes.

Похожие видео