Realizing Lattice Surgery on Two Distance-Three Repetition Codes with Superconducting Qubits

  1. Ilya Besedin,
  2. Michael Kerschbaum,
  3. Jonathan Knoll,
  4. Ian Hesner,
  5. Lukas Bödeker,
  6. Luis Colmenarez,
  7. Luca Hofele,
  8. Nathan Lacroix,
  9. Christoph Hellings,
  10. François Swiadek,
  11. Alexander Flasby,
  12. Mohsen Bahrami Panah,
  13. Dante Colao Zanuz,
  14. Markus Müller,
  15. and Andreas Wallraff
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 ZZ 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.