Realizing Lattice Surgery on Two Distance-Three Repetition Codes with Superconducting Qubits
Abstract
Quantum error correction is needed for quantum computers to be capable of fault-tolerantly executing algorithms using hundreds of logical qubits. Recent experiments have demonstrated subthreshold error rates for state preservation of a single logical qubit. In addition, the realization of universal quantum computation requires the implementation of logical entangling gates. Lattice surgery offers a practical approach for implementing such gates, particularly in planar quantum processor layouts. In this work, we demonstrate lattice surgery between two distance-three repetition-code qubits by splitting a single distance-three surface-code qubit. Using a quantum circuit fault-tolerant to bit-flip errors, we achieve an improvement in the value of the decoded logical two-qubit observable compared to a similar non-encoded circuit. By preparing the surface-code qubit in initial states parametrized by a varying polar angle, we evaluate the performance of the lattice surgery operation for non-cardinal states on the logical Bloch sphere and employ logical two-qubit tomography to reconstruct the Pauli transfer matrix of the operation. In this way, we demonstrate the functional building blocks needed for lattice surgery operations on larger-distance codes based on superconducting circuits.
Cite
@article{arxiv.2501.04612,
title = {Realizing Lattice Surgery on Two Distance-Three Repetition Codes with Superconducting Qubits},
author = {Ilya Besedin and Michael Kerschbaum and Jonathan Knoll and Ian Hesner and Lukas Bödeker and Luis Colmenarez and Luca Hofele and Nathan Lacroix and Christoph Hellings and François Swiadek and Alexander Flasby and Mohsen Bahrami Panah and Dante Colao Zanuz and Markus Müller and Andreas Wallraff},
journal= {arXiv preprint arXiv:2501.04612},
year = {2026}
}
Comments
19 pages, 13 figures