Happy to share our latest quantum error correction results on Willow. We scale the surface code stability experiment, realizing below-threshold logical error suppression in both space & time, and uncovering low-probability correlated errors.
arxiv.org/abs/2611.21578
With detailed modeling, we uncover data qubit leakage to |3> as a limiting mechanism. We suppress it with a walking circuit, realizing a logical error <3.2e-8, four orders of magnitude lower than any experiment in the literature at 60 cycles, and setting a new stability record.
Nearest-neighbour gates are all you need: High-rate quantum low-density parity-check codes on a planar grid
This is a piece of work I am particularly happy with. It shows that many of the advantages of quantum low-density parity-check (#qLDPC) codes can be realized on planar architectures, such as those available in superconducting quantum computing platforms.
scirate.com/arxiv/2606.19482
High-performance quantum low-density parity-check codes promise substantial reductions in the overhead of #faulttolerant quantum computation, but most constructions require long-range connectivity or qubit shuttling, both of which are difficult to realise in superconducting architectures. Here we introduce a family of qLDPC codes that, for the first time, combines planar open-boundary layouts, finite-size advantages over surface codes, and syndrome extraction using only nearest-neighbour gates on a square grid of qubits.
The key idea is to generate check-data connectivity #dynamically: nearest-neighbour #iSWAP walks both define the stabiliser supports and implement their measurement, avoiding the need for a long-range hardware graph. The resulting circuits achieve optimal constant-depth stabiliser measurement, independent of code size, and naturally remove leakage from the system by exchanging the role of check and data qubits at each syndrome extraction round.
We find finite-size instances such as a [[323,14,15]] code, whose code-efficiency ratio is nearly an order of magnitude larger than that of rotated surface-code patches. At around 30 circuit qubits per logical qubit, the best directional tile-code layouts reduce the per-logical per-round logical error rate by up to a factor of 1000 relative to rotated surface-code memories.
These results show that the advantages of quantum low-density parity-check codes can survive compilation into strictly planar nearest-neighbour circuits, bringing low-overhead fault-tolerant memories closer to near-term hardware.
BREAKING NEWS
The Royal Swedish Academy of Sciences has decided to award the 2025 #NobelPrize in Physics to John Clarke, Michel H. Devoret and John M. Martinis “for the discovery of macroscopic quantum mechanical tunnelling and energy quantisation in an electric circuit.”
I had a great time back at Yale at #QEC25. Here’s a recording of my talk on our realization of below-threshold quantum error correction:
yale.hosted.panopto.com/Pano…
Using time-dynamics, the surface code can be embedded on a hexagonal lattice rather than a square lattice. In our new paper, we show that these hex-grid circuits can still be adapted to broken qubits and couplers, despite their sparser connectivity: arxiv.org/abs/2508.08116.
Thrilled to share my PhD thesis is now public! 📖
📎 proquest.com/docview/3225356…
Aside from an introduction to quantum computing in CV and DV architectures, some unpublished ideas include:
Scientists have demonstrated that direct quantum info transfer is feasible at far lower transmission rates than previously thought — as low as 10% — with the help of GKP states. This work opens new possibilities for #quantum computing and communication.
go.aps.org/4ceAxfT
Our paper that tells you how to make millisecond transmons just appeared. Congrats, Matthew, Faranak and team! In collaboration with Nathalie de Leon and Bob Cava, and building on five years of work in @C2QAdvantagearxiv.org/abs/2503.14798
Thanks to my colleagues @mattjmcewen , @AlexisMorvan1 , and the rest of the Google Quantum AI team. Congrats to @NathanLacroix , Alex Bourassa, @KJSatz, and the rest of the team for the impressive color code results out today. It is a great year for experimental QEC!
Our results open the door to many new possibilities for QEC circuit design in hardware and software. This is one of two new preprints out by our team today, the second being a demonstration of the color code with logical operations, check it out here! - arxiv.org/abs/2412.14256
Each of these three time-dynamic circuits were first proposed by @mattjmcewen ,@dabacon, and @CraigGidney (arxiv.org/abs/2302.02192) and have now been realized experimentally with state-of-the-art performance enabled on the Willow architecture.
Finally, we realize the surface code using iSWAP gates instead of the standard CZ/CNOT gates. This opens the door to a range of new devices designed around this alternative entangling operation, which has superior leakage performance.
Next, we realize a walking surface code, where data and measure qubits are exchanged every round. This circuit has built-in removal of leakage and can be used to move a logical qubit.
First, we realize the surface code embedded on a hexagonal lattice (3 couplers per qubit instead of 4 !) without any degradation in error suppression performance compared to the standard square code.