Paper

Demonstrating dynamic surface codes

Hilton, Jeremy, Rhodes, David M, Wing, Boixo, Sergio, Andersen, Trond I, Erickson, Catherine, Shorter, Aaron, Crook, L, Orosco, Raymond, Ballard, Brian, Aviv Moshe Elbag, Fowler, Austin G, Ramis Movassagh, Wang, Shannon X, Collins, Roberto, Meeks, Seneca, Sivak, Volodymyr, Nguyen, Anthony, Tomita, Eifu, Nguyen, Murray, White, Theodore, Ferreira, Vinicius S, Dunsworth, Andrew, Ryan Babbush, Noureldin Yosri, Livingston, William P, Agustin Di Paolo, Oas, Logan, Potter, Rebecca, Broughton, Michael, Shutty, Noah, Roushan, Pedram, Roberts, Gabrielle, Habegger, Steve, Gross, Jonathan, De Lorenzo, Laura, Lundahl, Daniel, Suchard, Jordan, Cleland, Agnetta Y, Small, Spencer, Schurkus, Henry F, Shvarts, Vladimir, Atalaya, Juan, McClean, Jarrod R, Torres, Alfredo, Loïck Le Guevel, Maloney, Ashley, Thor, Douglas, Ansmann, Markus, Ledford, Justin, Vargas, Justin, Donohoe, Paul, Lunt, Aaron, Martin, Leigh S, Heu, Paula, Langley, Brandon W, Hsin-Yuan, Huang, Cheng, Xing, Courtney, William, Maxfield, Cameron, Amir, Newman, Michael, Browne, David A, Buckley, Bob B, Tim, Arute, Sergey, Evan, Jeffrey, Quintana, Chris, Gasca, Robert, Das, Saya

2024

Overview

A remarkable characteristic of quantum computing is the potential for reliable computation despite faulty qubits. This can be achieved through quantum error correction, which is typically implemented by repeatedly applying static syndrome checks, permitting correction of logical information. Recently, the development of time-dynamic approaches to error correction has uncovered new codes and new code implementations. In this work, we experimentally demonstrate three time-dynamic implementations of the surface code, each offering a unique solution to hardware design challenges and introducing flexibility in surface code realization. First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three. Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors. Finally, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead. We measure the error suppression factor when scaling from distance-3 to distance-5 codes of \\(_35,hex = 2.15(2)\\), \\(_35,walk = 1.69(6)\\), and \\(_35,iSWAP = 1.56(2)\\), achieving state-of-the-art error suppression for each. With detailed error budgeting, we explore their performance trade-offs and implications for hardware design. This work demonstrates that dynamic circuit approaches satisfy the demands for fault-tolerance and opens new alternative avenues for scalable hardware design.

• Publisher: Cornell University Library, arXiv.org
• Subject: Building codes / Codes / Couplings / Error analysis / Error correction / Error correction & detection / Fault tolerance / Gates (circuits) / Hardware / Hexagonal lattice / Lattice design / Quantum computing / Qubits (quantum computing)