Stories
Slash Boxes
Comments

SoylentNews is people

SoylentNews is powered by your submissions, so send in your scoop. Only 16 submissions in the queue.
posted by chromas on Saturday June 22 2019, @02:34AM   Printer-friendly
from the 575-zettaflops-by-2371-sounds-reasonable dept.

Neven's Law is an observation of the growth of the quantum computing, somewhat akin to Moore's famous law, and describes how quickly quantum computers are gaining on classical ones. It is faster than you might think.

In December 2018, scientists at Google AI ran a calculation on Google's best quantum processor. They were able to reproduce the computation using a regular laptop. Then in January, they ran the same test on an improved version of the quantum chip. This time they had to use a powerful desktop computer to simulate the result. By February, there were no longer any classical computers in the building that could simulate their quantum counterparts. The researchers had to request time on Google's enormous server network to do that.

Neven's law suggests that following current trending, quantum supremacy—that point where an efficient quantum calculation cannot be simulated in any reasonable time frame on the most powerful classical computer—could happen within one year.

The rule began as an in-house observation before [Hartmut Neven, director of Google's Quantum Artificial Intelligence lab] mentioned it in May at the Google Quantum Spring Symposium. There, he said that quantum computers are gaining computational power relative to classical ones at a "doubly exponential" rate—a staggeringly fast clip.

With double exponential growth, "it looks like nothing is happening, nothing is happening, and then whoops, suddenly you're in a different world," Neven said. "That's what we're experiencing here."

Even exponential growth is pretty fast. It means that some quantity grows by powers of 2[.]

The first few increases might not be that noticeable, but subsequent jumps are massive. Moore's law, the famous guideline stating (roughly) that computing power doubles every two years, is exponential.

Doubly exponential growth is far more dramatic. Instead of increasing by powers of 2, quantities grow by powers of powers of 2[.]

Not all are convinced; classical computers are still improving subject to Moore's law (more or less), and quasi-quantum algorithms on classical computers continue to improve, pushing the goal-posts out further as well.

Still, even though the rate at which quantum computers are gaining on classical ones is debatable, there's no doubt quantum technology is racing towards an inflection point and the writing is, or is not, on the wall.


Original Submission

 
This discussion has been archived. No new comments can be posted.
Display Options Threshold/Breakthrough Mark All as Read Mark All as Unread
The Fine Print: The following comments are owned by whoever posted them. We are not responsible for them in any way.
  • (Score: 2) by Rupert Pupnick on Sunday June 23 2019, @02:54PM

    by Rupert Pupnick (7277) on Sunday June 23 2019, @02:54PM (#859076) Journal

    I always considered Aaronson to be a Quantum Advocate, but only from the mathematical/theoretical side. I have his book, but only made it through three or four chapters before getting lost and picking up something else. I should take another crack at it. Check out his blog if you haven’t. I have a lot of respect for his work, but I don’t agree with what he says in that quote. The burden of proof is on those who say they can make it work.

    It’s when engineers start talking about QC implementations that things get even fuzzier, and my gut tells me that that shouldn’t happen. I’d love to hear an explanation of how the moleclur level I/O works. Guess it’s proprietary and I’d have to sign an NDA...

    Starting Score:    1  point
    Karma-Bonus Modifier   +1  

    Total Score:   2