Quantum hardening

TL&DR
Good feedback. It’s well known that quantum computers could be a vulnerability to cryptographic systems with their current architectures, either by brute force or by implementing shor or gover’s algorithm - hence the title, QUNTUM HARDENING.

Classical computers that run slices of a quantum function don’t run as efficiently as naturally derived quantum computers, but they are stable.

THIS WAS 7 YEARS AGO - apply something like Moore’s Law to the amount of quibits a systems like this posses over that time frame, and although that is probably top secret classified information - we can imagine that these systems are well beyond 56 quibits now.
IBM Simulates a 56-Qubit Machine - IEEE Spectrum

I’ve known for several years that DARPA is running a program researching this - it’s not like they don’t make public the programs advancing the quantum/classical architecture.
DARPA-Funded Research Leads to Quantum Computing Breakthrough
The program pursued a hybrid concept to combine intermediate-sized “noisy”— or error-prone — quantum processors with classical systems focused specifically on solving optimization problems of interest* to defense and commercial industry.

Introducing quantum resistance into systems sooner is better than later.

  • Biggest threat
    • Loss of user funds

Solutions shared above.

1 Like