Collaborating Authors

Quantum computing: Google researchers think they can now stop qubits going wrong


Google's researchers have successfully tested error correction methods with the company's Sycamore processor. Google's researchers have demonstrated that, subject to certain conditions, error correction works on the company's Sycamore quantum processor and can even scale exponentially, in what is yet another step towards building a fault-tolerant quantum computer. The breakthrough is likely to catch the attention of scientists working on quantum error correction, a field that is concerned not with qubit counts but rather with qubit quality. While increasing the number of qubits supported by quantum computers is often presented as the key factor in unlocking the unprecedented compute power of quantum technologies, equally as important is ensuring that those qubits behave in a way that allows for reliable, error-free results. This is the idea that underpins the concept of a fault-tolerant quantum computer, but quantum error correction is still in very early stages.

A quantum computer could catch its own errors on any calculation

New Scientist

A quantum computer made of charged atoms can catch its own errors when performing any operation – a meaningful step towards more reliable and practical quantum computers. Conventional computers routinely flag and correct their own errors, so to truly outperform them quantum computers will have to do the same. However, quantum effects can make errors cascade quickly through the qubits, or quantum bits, that make up these devices. Lukas Postler at the University of Innsbruck in Austria and his colleagues have now built a quantum computer that runs any calculation without errors. Any operation of a quantum computer can be broken down into simpler computations called quantum gates.

Fault-tolerant detection of a quantum error


A critical component of any quantum error–correcting scheme is detection of errors by using an ancilla system. We demonstrate a fault-tolerant error-detection scheme that suppresses spreading of ancilla errors by a factor of 5, while maintaining the assignment fidelity. The same method is used to prevent propagation of ancilla excitations, increasing the logical qubit dephasing time by an order of magnitude. Our approach is hardware-efficient, as it uses a single multilevel transmon ancilla and a cavity-encoded logical qubit, whose interaction is engineered in situ by using an off-resonant sideband drive. The results demonstrate that hardware-efficient approaches that exploit system-specific error models can yield advances toward fault-tolerant quantum computation.

Google: We'll build this 'useful' quantum computer by the end of the decade


Google has unveiled its new Quantum AI campus in Santa Barbara, California, where engineers and scientists will be working on its first commercial quantum computer – but that will probably be a decade way. The new campus has a focus on both software and hardware. On the latter front, these include its first quantum data center, quantum hardware research labs, and Google's own quantum processor chip fabrication facilities, says Erik Lucero, lead engineer for Google Quantum AI in a blogpost. Quantum computers offer great promise for cryptography and optimization problems. ZDNet explores what quantum computers will and won't be able to do, and the challenges we still face.

Closing In on Quantum Error Correction

Communications of the ACM

After decades of research, quantum computers are approaching the scale at which they could outperform their "classical" counterparts on some problems. They will be truly practical, however, only when they implement quantum error correction, which combines many physical quantum bits, or qubits, into a logical qubit that preserves its quantum information even when its constituents are disrupted. Although this task once seemed impossible, theorists have developed multiple techniques for doing so, including "surface codes" that could be implemented in an integrated-circuit-like planar geometry. For ordinary binary data, errors can be corrected, for example, using the majority rule: A desired bit, whether 1 or 0, is first triplicated as 111 or 000. Later, even if one of the three bits has been corrupted, the other two "outvote" it and allow recovery of the original data.