Live data from Hacker News

Willow, Our Quantum Chip

blog.google

231–240 of 557 posts

Re: Willow, Our Quantum Chip

#232

Earlier 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.

They are? The short term recommendation is 3072, and I still see lots of 2048. Actually, it's mostly 2048.

Re: Willow, Our Quantum Chip

#233

Earlier quoted context omitted.

The required number of qubits to execute Shor’s algorithm is way larger than 2500 qubits as the error ceiling for logical qubits must decrease exponentially with every logical qubit added to produce meaningful results. Hence, repeated applications of error correction or an increase in the surface code would be required. That would significantly blow up the number of physical qubits needed.

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...

I actually thought the number of logical qubits needed was around 20 for factorisation as the state space size is 2^(2^n) and hence did not recognise them as the number of logical qubits required. It is often misunderstood that error correction needs to be done only once, as with classical quantum computers, and the numbers would fit together with one pass of error correction.

The Shor's algorithm requires binary encoding; hence, 2048 logical qubits are needed to become a nuance for cryptography. This, in turn, means that one will always be easily able to run away from a quantum adversary by paying a polynomial price on group element computations, whereas a classical adversary is exponentially bounded in computation time, and a quantum adversary is exponentially bounded with a number of physical qubits. Fascinating...

Re: Willow, Our Quantum Chip

#234

Earlier quoted context omitted.

AI is essentially search. Quantum computers are really good at search.

Search of what?

Anything. Everything. In domains where the search space is small enough to physically enumerate and store or evaluate every option, search is commonly understood as a process solved by simple algorithms. In domains where the search space is too large to physically realize or index, search becomes "intelligence."

E.g. winning at Chess or Go (traditional AI domains) is searching through the space of possible game states to find a most-likely-to-win path.

E.g. an LLM chat application is searching through possible responses to find one which best correlates with expected answer to the prompt.

With Grover's algorithm, quantum computers let you find an answer in any disordered search space with O(sqrt(N)) operations instead of O(N). That's potentially applicable to many AI domains.

But if you're so narrow minded as to only consider connectionist / neural network algorithms as "AI", then you may be interested to know that quantum linear algebra is a thing too: https://en.wikipedia.org/wiki/HHL_algorithm

Re: Willow, Our Quantum Chip

#235

They 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?

What happens when you don't send the request after receiving the response? Please try and report back.

Please report back and try.*

Re: Willow, Our Quantum Chip

#236
>It lends credence to the notion that quantum computation occurs in many parallel universes, in line with the idea that we live in a multiverse, a prediction first made by David Deutsch.

Makes sense, or doesn't it? What's your take on the multiverse theory?

Re: Willow, Our Quantum Chip

#237

Earlier 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.

[deleted]

Re: Willow, Our Quantum Chip

#238

Earlier 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.

> Everyone doing anything with RSA is on 4k or larger.

The Let's Encrypt intermediate certificates R10 and R11 seem to be only 2048 bit.

Re: Willow, Our Quantum Chip

#239
post #223

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.

It is.. and I don’t see a way to avoid it.

Re: Willow, Our Quantum Chip

#240

Earlier 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.

I took this conversation to be about ECC, not RSA.
Post reply on HN