←
Alec Eickbusch223 posts
Alec Eickbusch avatar

Alec Eickbusch

@AEickbusch

Research Scientist @GoogleQuantumAI | PhD in applied physics from @Yale_QI | quantum error correction research with superconducting circuits

◷ Joined March 2018▧ 18 Photos and videos
Alec Eickbusch avatar
Alec Eickbusch@AEickbusch·Nov 17

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

Post attachment
Alec Eickbusch avatar
Alec Eickbusch@AEickbusch·Nov 17

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.

Post attachment
Jens Eisert avatar
⟳ Alec Eickbusch retweeted
Jens Eisert@jenseisert·Jun 19

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.

Post attachment
Alec Eickbusch avatar
Alec Eickbusch@AEickbusch·7 Oct 2025

Congratulations Michel, John Clarke and John Martinis!

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.”

Post attachment
Oscar Higgott avatar
⟳ Alec Eickbusch retweeted
Oscar Higgott@oscarhiggott·13 Aug 2025

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.

Physical Review X avatar
⟳ Alec Eickbusch retweeted
Physical Review X@PhysRevX·3 Apr 2025

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

Post attachment
Andrew Houck avatar
⟳ Alec Eickbusch retweeted
Andrew Houck@nanonoodle·20 Mar 2025

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 @C2QAdvantage arxiv.org/abs/2503.14798

Andreas Wallraff avatar
⟳ Alec Eickbusch retweeted
Andreas Wallraff@AndreasAtETH·26 Feb 2025

Check out our newest manuscript on Experimentally Informed Decoding of Stabilizer Codes Based on Syndrome Correlations (arxiv.org/abs/2502.17722) which appeared on the @arxiv server today. In this work we discuss how we decode experimental error syndromes that are generated when executing the surface code with superconducting circuits. If you like the manuscript rate it on Scirate: scirate.com/arxiv/2502.17722. The work was done in a collaboration between @RWTH Aachen University, @fz_juelich, @IQ_USherbrooke at @USherbrooke, the @qudev lab at the @ETH_physics Department, member of the @ETHQuantumCntr and the @ETH_en Zürich - @psich_en Paul Scherrer Institut #Quantum Computing Hub by Ants Remm, @NathanLacroix, Lukas Bödeker, Elie Genois, Christoph Hellings, @FrancoisSwiadek, Graham J. Norris, @eichler__chris, @circuitqed , Markus Müller, @SebKrinner, and @AndreasAtETH with support from @IARPAnews and many more.

Post attachmentPost attachmentPost attachmentPost attachment
Alec Eickbusch avatar
Alec Eickbusch@AEickbusch·20 Dec 2024

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

Alec Eickbusch avatar
Alec Eickbusch@AEickbusch·20 Dec 2024

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.

Post attachment
Alec Eickbusch avatar
Alec Eickbusch@AEickbusch·20 Dec 2024

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.

Post attachment
Alec Eickbusch avatar
Alec Eickbusch@AEickbusch·20 Dec 2024

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.

Post attachment