Loading video...
Video Failed to Load
Normal search vs Quantum search
1,394,083 views • 7 months ago •via X (Twitter)
34 Comments

so we want to make search... vastly more resource intensive, and less efficient?

hopefully, they don't ask me how to implement quantum search in assembly for my next job interview

But in an actual physical maze, you will need to follow the normal search pattern, more-or-less. Unless you or a robotic avatar is able to see through the wall mazes, fly above them for a scan, or split into smaller simultaneous vehicles. 🤔

There may be worse explanations of quantum computing, but I don't know them yet

We really did all that just to reinvent DFS lol, still cool

A crappy explanation is when you are more confused than before. Bravo! You achieved that!

parallelism?

This video reminds me of Brian Greene in the 90’s promising the benefits of String Theory

@grok can you explain why quantum search is more complex than normal search

how is the superposition logically working?

I don't think this is what quantum is supposed to mean.

It's literally the same computational complexity. You just utilize more resources.

*not actual quantum computing

BASEd explainer ty

Impressive… Now the real question: can quantum computing also optimize ego and stupidity? Or are those still NP-hard problems?

Multi-threading with chunk testing would be far faster.

this is just Dijkstra's algorithm

is this just trading memory for speed like in dynamic programming?

@Engineering67 #multiverse

The death of leet code, FUCK YEAH

Quantum super position, So every possibility is first tried (at once) before taking a successful path, By the same agent.

Grover still needs ~√N iterations. This video is hiding a lot of underlying problems.

Great visual

Nothing is quantum about it it’s just BFS vs DFS

BFS?

cool shit

Source: Trust Me Bro

What is the price for creating more agents?

Can we use quantum computing to clean India? 🇮🇳

Wow

So... multi-threaded branching path search... why the Agent? Just why??

Is there a limit to the 'quantum' paths? Could you split it into two where it's searching from the end AND the start, until the two first meet? Would that be doubling the difficulty or does it come for free with the magic?

Це задачка 1 або 2 курсу з програмування, залежно від поблажливості викладача

Once Quantum computers become a thing BTC is dead
