[a / b / c / d / e / f / g / gif / h / hr / k / m / o / p / r / s / t / u / v / vg / vm / vmg / vr / vrpg / vst / w / wg] [i / ic] [r9k / s4s / vip] [cm / hm / lgbt / y] [3 / aco / adv / an / bant / biz / cgl / ck / co / diy / fa / fit / gd / hc / his / int / jp / lit / mlp / mu / n / news / out / po / pol / pw / qst / sci / soc / sp / tg / toy / trv / tv / vp / vt / wsg / wsr / x / xs] [Settings] [Search] [Mobile] [Home]
Board
Settings Mobile Home
/sci/ - Science & Math

Name
Options
Comment
Verification
4chan Pass users can bypass this verification. [Learn More] [Login]
File
  • Please read the Rules and FAQ before posting.
  • Additional supported file types are: PDF
  • Use with [math] tags for inline and [eqn] tags for block equations.
  • Right-click equations to view the source.

08/21/20New boards added: /vrpg/, /vmg/, /vst/ and /vm/
05/04/17New trial board added: /bant/ - International/Random
10/04/16New board for 4chan Pass users: /vip/ - Very Important Posts
[Hide] [Show All]


[Advertise on 4chan]


File: quantumcomputingsh.jpg (216 KB, 1340x713)
216 KB
216 KB JPG
Or just another gimmick like nuclear fusion, perpetually being 20 years behind of being completed?
>>
Quantum is here, but the scope of problems it can solve has been over-hyped.

>Google has unveiled a new chip which it claims takes five minutes to solve a problem that would currently take the world's fastest super computers ten septillion – or 10,000,000,000,000,000,000,000,000 years – to complete.
>https://www.bbc.com/news/articles/c791ng0zvl3o


That being said, some of the problems it can solve change the problem from O(n) to O(sqrt(n)), which is something to hebold, but it's currently not worth the squeeze in most cases.
>https://www.youtube.com/watch?v=RQWpF2Gb-gU&t=43s
>>
>>16799429
Not an expert on the field. I think quantum computors are more of a mainstream thing, because everyone needs computational power, even guys in nuclear fusion lol
>>
>>16799509
Not to be weird, but isn't it true to say that we can make even simple tasks take a very long time to complete through inefficient algorithms?
Even something as simple as F(n) = n can be transformed into a never ending calculation.
Tell a computer to run some successor function for 10^100 iterations.
Shouldn't they be more precise in how they communicate so as to not have obvious counter examples?
>>
>>16799521
Yes, it is true, numerical analysis is literally about such things. (Not the original poster)
>>
>>16799509
>That being said, some of the problems it can solve change the problem from O(n) to O(sqrt(n)), which is something to hebold, but it's currently not worth the squeeze in most cases.

there are two big algorithms in quantum computing

what you mentioned is Grover's algorithm, which searches unstructured space in O(sqrt(n)) instead of O(n)
this is great for performance but the real issue is
Shor's algorithm, the second one

it can factor large integers and completely break modern cryptography, which would have massive implications, perhaps even destroy society

the only thing that stops it from happening already is we don't have a big enough quantum computer
but the crypto community is urging people to move away from traditional algos to post-quantum algos ASAP
>>
>>16799429
its a gimmick just like silicon computing was.
>>
File: 1648708246604.jpg (126 KB, 770x674)
126 KB
126 KB JPG
>>16799429
>gutentag i am the sabine hossenfelder, das scientifican kommunikateren
>i am of doing things the simpleren BUT NOT ANY SIMPLERENER
>just because of the watching my channelgeziet nicht ze meaning I AM DU FUCKING FRIEND
>having of the fun now BUT NOT MORE THEN IS OF REQUIREMENTEN



[Advertise on 4chan]

Delete Post: [File Only] Style:
[Disable Mobile View / Use Desktop Site]

[Enable Mobile View / Use Mobile Site]

All trademarks and copyrights on this page are owned by their respective parties. Images uploaded are the responsibility of the Poster. Comments are owned by the Poster.