Earlier quoted context omitted.
I think you’re going to need about 10,000,000 qbits to divert a transaction, but that’s still within foreseeable scale. I think it’s extreme likely that the foundation will have finished their quantum resistance planning before we get to 10MM coherent qbits, but still, it’s a potential scenario. More likely that other critical infrastructure failures will happen within trad-finance, much larger vulnerability footprin…
I agree that the scary scenario is stored SSL frames from 20 years of banking. That's nuclear meltdown scenarios.
Willow, Our Quantum Chip
331–340 of 557 posts
Re: Willow, Our Quantum Chip
#332I’m a quantum dabbler so I’ll throw out an armchair reaction: this is a significant announcement. My memory is that 256 bit keys in non quantum resistant algos need something like 2500 qubits or so; and by that I mean generally useful programmable qubits. To show a bit over 100 qubits with stability, meaning the information survives a while, long enough to be read, and general enough to run some benchmarks on is some…
You need to distinguish between "physical qubits" and "logical qubits." This paper creates a single "first-of-a-kind" logical qubit with about 100 physical qubits (using Surface Code quantum error correction). A paper from Google in 2019 estimates needing ~20 million physical qubits ("How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits" - https://arxiv.org/abs/1905.09749 ), though recent adva…
Use a key exchange that offers perfect forward secrecy (e.g. diffie Hellman) and you don’t need to worry about your RSA private key eventually being discovered.
Re: Willow, Our Quantum Chip
#333Re: Willow, Our Quantum Chip
#334Earlier quoted context omitted.
You need to distinguish between "physical qubits" and "logical qubits." This paper creates a single "first-of-a-kind" logical qubit with about 100 physical qubits (using Surface Code quantum error correction). A paper from Google in 2019 estimates needing ~20 million physical qubits ("How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits" - https://arxiv.org/abs/1905.09749 ), though recent adva…
> quantum computers would be able to retroactively break any public keys that were stored Use a key exchange that offers perfect forward secrecy (e.g. diffie Hellman) and you don’t need to worry about your RSA private key eventually being discovered.
Re: Willow, Our Quantum Chip
#335Earlier quoted context omitted.
You need to distinguish between "physical qubits" and "logical qubits." This paper creates a single "first-of-a-kind" logical qubit with about 100 physical qubits (using Surface Code quantum error correction). A paper from Google in 2019 estimates needing ~20 million physical qubits ("How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits" - https://arxiv.org/abs/1905.09749 ), though recent adva…
> quantum computers would be able to retroactively break any public keys that were stored Use a key exchange that offers perfect forward secrecy (e.g. diffie Hellman) and you don’t need to worry about your RSA private key eventually being discovered.
Re: Willow, Our Quantum Chip
#336Earlier quoted context omitted.
You need to distinguish between "physical qubits" and "logical qubits." This paper creates a single "first-of-a-kind" logical qubit with about 100 physical qubits (using Surface Code quantum error correction). A paper from Google in 2019 estimates needing ~20 million physical qubits ("How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits" - https://arxiv.org/abs/1905.09749 ), though recent adva…
> quantum computers would be able to retroactively break any public keys that were stored Use a key exchange that offers perfect forward secrecy (e.g. diffie Hellman) and you don’t need to worry about your RSA private key eventually being discovered.
Re: Willow, Our Quantum Chip
#337They opened the API for it and I'm sending requests but the response always comes back 300ms before I send the request, is there a way of handling that with try{} predestined{} blocks? Or do I need to use the Bootstrap Paradox library?
Have you tried using the Schrödinger Exception Handler? It catches errors both before and after they occur simultaneously, until you observe the stack trace.
A sort of quantum commenting conundrum, I guess.
Re: Willow, Our Quantum Chip
#338Earlier quoted context omitted.
He’s quoting the number of logical qubits (which is 1024 IIRC, not 2500), after error correction. ETA: Wikipedia 2330 qubits, but I'm not sure it is citing the most recent work: https://en.wikipedia.org/wiki/Elliptic-curve_cryptography#ci...
1024 is for RSA-1024, which is believed to be broken by classical means at this point. Everyone doing anything with RSA is on 4k or larger.
Re: Willow, Our Quantum Chip
#339If error is getting corrected, doesn’t it mean lower entropy? If so where else is entropy increasing, if it is a valid question to be asked.
Re: Willow, Our Quantum Chip
#340Earlier quoted context omitted.
He’s quoting the number of logical qubits (which is 1024 IIRC, not 2500), after error correction. ETA: Wikipedia 2330 qubits, but I'm not sure it is citing the most recent work: https://en.wikipedia.org/wiki/Elliptic-curve_cryptography#ci...
1024 is for RSA-1024, which is believed to be broken by classical means at this point. Everyone doing anything with RSA is on 4k or larger.