正在加载视频...

视频加载失败

Normal search vs Quantum search

1,394,083 次观看 • 7 个月前 •via X (Twitter)

34 条评论

Lynn Cole 的头像
Lynn Cole7 个月前

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

Stefan-Iulian Tesoi 的头像
Stefan-Iulian Tesoi7 个月前

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

1ConcernedCitizen2 🇺🇸🇺🇦 的头像
1ConcernedCitizen2 🇺🇸🇺🇦7 个月前

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. 🤔

Gelu Timoficiuc 的头像
Gelu Timoficiuc7 个月前

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

zumblejack 的头像
zumblejack7 个月前

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

Tomas B 的头像
Tomas B7 个月前

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

Peter Araujo 的头像
Peter Araujo7 个月前

parallelism?

TMB Survivor of Danger ™ 的头像
TMB Survivor of Danger ™7 个月前

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

Priya 的头像
Priya7 个月前

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

Saddam Neet Hodlssein 🏴‍☠️ 的头像
Saddam Neet Hodlssein 🏴‍☠️7 个月前

how is the superposition logically working?

South Fox 的头像
South Fox7 个月前

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

Jaffar1908 的头像
Jaffar19087 个月前

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

mattmac 的头像
mattmac7 个月前

*not actual quantum computing

Drew Roberts 的头像
Drew Roberts7 个月前

BASEd explainer ty

Joao Zorro 的头像
Joao Zorro7 个月前

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

Hayes, GR 的头像
Hayes, GR7 个月前

Multi-threading with chunk testing would be far faster.

Cutie Mew Mew Boy :3 的头像
Cutie Mew Mew Boy :37 个月前

this is just Dijkstra's algorithm 🫩

Sean li 的头像
Sean li7 个月前

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

l0rinc 的头像
l0rinc7 个月前

@Engineering67 #multiverse

SaucyBeans 的头像
SaucyBeans7 个月前

The death of leet code, FUCK YEAH

indigenous 🖤 的头像
indigenous 🖤7 个月前

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

اود 的头像
اود7 个月前

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

SmartLearnXpress 的头像
SmartLearnXpress7 个月前

Great visual

נתן יצחקי 的头像
נתן יצחקי7 个月前

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

peroon_GD 的头像
peroon_GD7 个月前

BFS?

skywalker 的头像
skywalker7 个月前

cool shit

Tobias Brida 🧃 的头像
Tobias Brida 🧃7 个月前

Source: Trust Me Bro

TaiNgoc 的头像
TaiNgoc7 个月前

What is the price for creating more agents?

C F Frost 的头像
C F Frost7 个月前

Can we use quantum computing to clean India? 🇮🇳

Abdel builds.. 的头像
Abdel builds..7 个月前

Wow

DaQuteness 的头像
DaQuteness7 个月前

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

Lincoln Margison - Game Development 的头像
Lincoln Margison - Game Development7 个月前

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?

Friend the Shade 的头像
Friend the Shade7 个月前

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

Evil Chud 的头像
Evil Chud7 个月前

Once Quantum computers become a thing BTC is dead

相关视频