Quantum computer breaking 15-bit key is fake.

Home page
Quantum computer cannot break keys

Quantum computers cannot factor 21, much less 215 (= 15-bit key )

This overhyped research just tried to randomly pick up and find right answers (= factors ) out of 215 = 32768 numbers, instead of quantum computers legitimately factoring 215 (= breaking 15-bit key ) in Shor algorithm, because today's error-prone quantum computers' calculations give only random meaningless numbers.

(Fig.1)  Quantum computer is too error-prone to break 15-bit ley legitimately.

Quantum computers cannot break 15-bit key.

Today's quantum computers cannot factor even 21, much less factor 215 (= so breaking 15-bit key is impossible, contrary to fake news ).

The recent "Quantum computers break (= factor ) the largest 15-bit elliptic curve cryptographic key by Shor algorithm in bitcoin" is overhyped fake news and No threat at all ( this-1st~3rd-paragraphs ).

The present useless quantum computers cannot factor even 21, so breaking 15-bit key by factoring 215 = 32768 integer ( this-3rd-paragraph ) is definitely impossible, contrary to the fake news.

Quantum computers gave only random useless numbers.

In this research, their error-prone quantum computers gave only random meaningless numbers, when they tried to factor 15-bit key.

The point is that today's error-prone (= noisy ) quantum computers cannot break cryptographic keys nor get right numbers by legitimately factoring in Shor's algorithm due to the quantum computer's inability to correct errors ( this-2nd~3rd-paragraphs ).

This overhyped research tried to factor 15-bit numbers, and ended up getting just meaningless random numbers due to too many errors.

Just finding right factors from random useless numbers.

Instead of legitimately breaking 15-bit key by factoring 215 numbers, this research just tried to find right answers (= factors ) out of 215 random meaningless numbers.

↑ So this research had to artificially picked up right answers or factors out of 215 =32768 random erroneous numbers given by the error-prone quantum computer, which was irrelevant to legitimately factoring 215 integers by Shor's algorithm.

This-3rd~4th-paragraphs say  -- Just random, No quantum computation
"Yuval Adam tested the method.. for recovering a 15-bit elliptic curve key using IBM quantum systems. Adam replaced the quantum output with random bytes.. and ran the same process."
"replaced it with random bytes.. The result suggests the system does Not rely on quantum computation."

This-Key takeaways say  -- Giving just random numbers
"Bitcoin developers showed Lelli's result (= allegedly breaking 15-bit key ) replicates with random noise, signaling zero quantum advantage over classical methods"

Quantum computers are too error-prone to get right numbers.

Today's error-prone quantum computers' success rate of factoring 215 was worse than just choosing answers from random meaningless numbers without computation.

This Lelli's research site-middle (= this-3rd-paragraph-link ) shows Estimated circuit fidelity (= 1 - error rate ) was extremely small = just 10-214 in factoring 15~16-bit keys (= too many errors ! ), which means they could get only one right answer in 10214 factoring trials (= success rate is almost zero = 1/10214 ).

↑ So just randomly choosing numbers out of 215 = 32768 (= this-6th-paragraph ) has higher success rate of getting right answer (= factor ) than this too error-prone quantum computer's Shor algorithm's factoring results that gave only one right answer out of 10214 trials ( success rate of random picking = 1/32768 > 1/10214 = error-prone quantum computer's Shor's algorithm's almost-zero success rate ).

They just found right factors from 215 random numbers.

This research just tried to find right answers (= factors ) from 215 random numbers, because today's error-prone quantum computers factoring gave only random meaningless numbers.

Actually this researcher just artificially picked up right number out of a lot of erroneous answers (= equal to just random meaningless numbers ) given by the useless error-prone IBM quantum computer in the artificial post-processing.

As a result, their claim of breaking 15-bit key by (meaningful) quantum computer Shor algorithm's factoring is false.  This overhyped research just tried to randomly find the right answer (= factors ) out of 215 = 32768 meaningless numbers.

 

to

Feel free to link to this site.