Google says it has cracked a quantum computing challenge with new chip

Google on Monday said that it has overcome a key challenge in quantum computing with a new generation of chip, solving a computing problem in five minutes that would take a classical computer more time than the history of the universe.

Google on Monday said that it has overcome a key challenge in quantum computing with a new generation of chip, solving a computing problem in five minutes that would take a classical computer more time than the history of the universe.

Like other tech giants such as Microsoft and IBM, Alphabet’s Google is chasing quantum computing because it promises computing speeds far faster than today’s fastest systems. While the math problem solved by the company’s Santa Barbara, California, quantum lab does not have commercial applications, Google hopes quantum computers will one day solve problems in medicine, battery chemistry and artificial intelligence that are out of reach for today’s computers.

The results released Monday came from a new chip called Willow that has 105 “qubits,” which are the building blocks of quantum computers. Qubits are fast but error-prone, because they can be jostled by something as small as a subatomic particle from events in outer space.

As more qubits are packed onto a chip, those errors can add up to make the chip no better than a conventional computer chip. So since the 1990s, scientists have been working on quantum error-correction.

In a paper published in the journal Nature on Monday, Google said that it has found a way to string together the Willow chip’s qubits so that error rates go down as the number of qubits goes up. The company also says it can correct errors in real time, a key step toward making its quantum machines practical.

“We are past the break even point,” Hartmut Neven, who leads the Google Quantum AI unit, said in an interview.

In 2019, IBM challenged Google’s claim that Google’s quantum chip solved a problem that would take a classical computer 10,000 years, saying the problem could be solved in two-and-a-half days using different technical assumptions about a classical system.