żìĂš¶ÌÊÓÆ”

Useful quantum computers are edging closer with recent milestones

Google, Microsoft and others have taken big steps towards error-free devices, hinting that quantum computers that solve real problems aren’t far away
An exhibition model of IBM’s Q System One quantum computer
Misha Friedman/Getty Images

Despite all the hype around quantum computers, they are still far too error-prone to be of real use. But recent experiments show that this may not always be the case, boosting the credibility of claims from companies like Google and IBM that we might get useful quantum computers as soon as 2029. These latest experiments represent key milestones and signal that we are entering a new age, say researchers.

“Suddenly, really useful devices seem tantalisingly close, in a way that they never have done before,” says at the University of Cambridge.

For much of the past decade, quantum computing companies were focused on building ever larger machines, steadily increasing the number of quantum bits, or qubits, in their systems. Qubits are units of quantum information, made using physical systems like the spin of an electron or the orientation of a photon. But these qubits were too prone to errors to reliably run algorithms of real-world use.

Companies now appear to be shifting their attention towards building error-free qubits, called logical qubits. These are collections of physical qubits that together can reduce errors to a good enough level to run such algorithms. “It’s marking a reset in the whole conversation around quantum computing and new benchmarks,” says Vicary. “This is exciting because this is the time when quantum computers start to be useful.”

In August, showing that as you build logical qubits by adding more physical qubits to a computer, the errors won’t snowball and become unmanageable – they will instead cross a threshold where, in principle, they will shrink as the system gets larger. This works by spreading information across a group of qubits, so if an error occurs in one, it won’t affect the overall computation.

“Ideally, you want to scale up while at the same time further reducing the error rates, improving the quality of your qubits,” says at University College London. “Trying to do all of those things at once is very difficult, but what makes me optimistic is this Google experiment is an example of them doing exactly that.”

However Google’s work didn’t involve performing computations on the qubits – instead, the researchers showed that these qubits can act as memory, says at Imperial College London.

, from researchers at Microsoft and quantum computing start-up Quantinuum, shows a combination of error-corrected qubits and computation. The team set up different combinations of qubits to make four logical qubits, then performed basic logical operations on the system, for example where the value of a qubit is flipped from positive to negative. “They have fewer rounds of error correction, so their quantum memory is stable for less time, but they can also do some computation with it,” says Bondesan.

The quantum computer in Microsoft’s study uses a different hardware design to Google’s, opting for a series of magnetically trapped charged particles instead of superconducting pieces of wire. This allows it to utilise an error-correction technique called a tesseract code, where qubits are arranged in a complex geometry known as a four-dimensional hypercube. “In principle, they can host more logical qubits, with fewer physical qubits,” says Bondesan. “In this sense, it’s more efficient.”

Other researchers have shown error correction working in more unusual quantum computers.  at Yale University and his colleagues tested a form of error correction called bosonic codes, which spreads out errors over vibrations in quantum computers. Instead of qubits, this system uses “qudits”, which can take more values than just 1 and 0 and are theoretically more powerful. Meanwhile, researchers at Amazon’s quantum computing team demonstrated , which, like Google’s work, could reduce errors as systems get larger.

“The Google and Microsoft approaches are really following more mainstream qubit-based quantum computing, whereas the introduction of bosonic codes in the Yale and the Amazon experiments are more novel and exploratory, but also very, very exciting,” says Browne.

Seeing error correction work over so many different designs and experiments is a sign that previous theoretical results could work for real-world systems, says Browne. “There were lots of nice theoretical ideas about fault-tolerant quantum computing and error correction, but none of them had been demonstrated, or [they were demonstrated] in a very limited way or special case,” says Browne. “That’s really changed a lot in the last couple of years. There have been a lot of key milestones reached, demonstrating one by one different aspects of fault-tolerant quantum computing.”

However, the rate of progress may yet falter and full fault-tolerant systems might still be a long way off, dashing the hopes raised by Google and IBM’s optimistic timetables. “I would be surprised if we see things moving at a very consistent rate. I think there will be roadblocks,” says Browne. “Each of these platforms is going to expand as far as they can until they hit the next roadblock. It’s a little bit hard to predict where those roadblocks will be.”

Topics: futurology / quantum computing