undefined | Better HN

0 pointsalmostgotcaught9mo ago0 comments

No it wouldn't? "Given f that hides a subgroup, and an oracle for f, determine the subgroup".

The Wikipedia phrases it backwards (as do you): "quantum computers" don't solve the hidden subgroup problem, the quantum fourier transform, which "measures" f in parallel, can be used to solve the hidden subgroup problem efficiently. The QFT is the fundamental thing, not the HSP, and it's the building block for basically any/all useful quantum algorithms.

0 comments

tylerhou9mo ago

Very late, but I meant it would be hard to summarize the details of the blog post (e.g. QFT implementation) even to the typical math undergraduate.

It's not hard to explain the problem, as most math undergraduates will have taken some group theory course. But even "subgroup" means nothing to most computer scientists (speaking from personal experience interacting with computer scientist academics).

dist-epoch9mo ago

That's very pedantic, like saying "computers don't solve integer addition, AND/OR/NOT/XOR gates solve it, those are the fundamental thing".

almostgotcaughtOP9mo ago

> That's very pedantic

Yes because we're talking about pure math here not popcorn and soda.

gsf_emergency9mo ago

My attempt at less offensive analogies:

"Efficiency of hw arithmetic is not the bottleneck, lack of a poly time algo to factor prime numbers is"

&, the closely related

"Ability to reduce everything to HSP is not the bottleneck, lack of a scaleable implementation of qFT is"

j / k navigate · click thread line to collapse