Video yükleniyor...

Video Yüklenemedi

Ana Sayfaya Dön

The secret behind quantum search efficiency

3,241,785 görüntüleme • 7 ay önce •via X (Twitter)

34 Yorum

Axel profil fotoğrafı
Axel7 ay önce

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

Берлинский Олень profil fotoğrafı
Берлинский Олень7 ay önce

It's called BFS and not quantum search 🤡

Dr. Md. Amir Khusru Akhtar profil fotoğrafı
Dr. Md. Amir Khusru Akhtar7 ay önce

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

Govind profil fotoğrafı
Govind7 ay önce

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ı profil fotoğrafı
Moravyalı7 ay önce

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

Aanshul Sadaria profil fotoğrafı
Aanshul Sadaria7 ay önce

Why does this look like BFS?

Hawkeye profil fotoğrafı
Hawkeye7 ay önce

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 profil fotoğrafı
Rex⚡Volt7 ay önce

The improbability drive has arrived.

Pat the Irishman profil fotoğrafı
Pat the Irishman7 ay önce

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

Smit profil fotoğrafı
Smit7 ay önce

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

TUVegeto137 profil fotoğrafı
TUVegeto1377 ay önce

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

𝓛𝓪𝓾𝓭𝓮𝓵𝓲𝓷𝓸 profil fotoğrafı
𝓛𝓪𝓾𝓭𝓮𝓵𝓲𝓷𝓸7 ay önce

Seems like a thread

MrBlindMouse profil fotoğrafı
MrBlindMouse7 ay önce

So its just an async Breadth-First search?

Rahul profil fotoğrafı
Rahul7 ay önce

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 profil fotoğrafı
Lukas Süss7 ay önce

@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.)

Δημήτρης Βουζουναράς profil fotoğrafı
Δημήτρης Βουζουναράς7 ay önce

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 profil fotoğrafı
Jason Dadness7 ay önce

@grok is this a good description of quantum computing?

Hemant profil fotoğrafı
Hemant7 ay önce

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

ItsBS profil fotoğrafı
ItsBS7 ay önce

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 profil fotoğrafı
Craig Swann - model citizen, zero discipline7 ay önce

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

AWeirdRobot profil fotoğrafı
AWeirdRobot7 ay önce

Wrong

Anthony Schmitt profil fotoğrafı
Anthony Schmitt7 ay önce

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 profil fotoğrafı
Miggy Ferrero Rocher7 ay önce

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

Ludic labs profil fotoğrafı
Ludic labs7 ay önce

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

MoroAI profil fotoğrafı
MoroAI7 ay önce

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

G Labs profil fotoğrafı
G Labs7 ay önce

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 profil fotoğrafı
Elena_ The HumanistPoet7 ay önce

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

Ben profil fotoğrafı
Ben7 ay önce

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 profil fotoğrafı
Steve Nicklin7 ay önce

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ğ profil fotoğrafı
Göktuğ7 ay önce

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~ profil fotoğrafı
Hold this L~7 ay önce

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

SereneLoop profil fotoğrafı
SereneLoop7 ay önce

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

Potato profil fotoğrafı
Potato7 ay önce

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. profil fotoğrafı
Cloud.7 ay önce

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

Benzer Videolar