[SystemSafety] Google Willow

[Prof. Dr. Peter Bernard Ladkin]

I've read that Google's Willow chip can perform a Random Circuit Sampling computation in 5 minutes 
that would take 10^(25) years on the Frontier supercomputer under conservative assumptions (full 
access to secondary storage without bandwidth overhead).

https://blog.google/technology/research/google-willow-quantum-chip/

So, assuming that RCS is NP-complete or more complex, why can't we just transform OurFavoriteProblem 
(say Boolean theorem proving) into RCS (using a regular computer), solve the RCS with Willow, and 
transform back (using a regular computer)? Or, if we want to go for less, how about prime-factoring 
into RCS, solving, and back? RSA is thereby done for. Similarly for other one-way functions. 
Diffie-Hellmann is thereby history.

If this were possible, I suspect Google would have kept it secret until they had implemented 
transformations for all the most important problems. They would then "own" computing. At least until 
Apple, Meta and co had set up their own QC labs and caught up.

So what am I missing?

PBL

Prof. Dr. Peter Bernard Ladkin
Causalis Limited/Causalis IngenieurGmbH, Bielefeld, Germany
Tel: +49 (0)521 3 29 31 00