Preprint FZJ-2025-01517

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png
Realizing Lattice Surgery on Two Distance-Three Repetition Codes with Superconducting Qubits

 ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;

2025

This record in other databases:

Report No.: arXiv:2501.04612

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


Note: 19 pages, 13 figures

Contributing Institute(s):
  1. Theoretische Nanoelektronik (PGI-2)
Research Program(s):
  1. 5221 - Advanced Solid-State Qubits and Qubit Systems (POF4-522) (POF4-522)

Appears in the scientific report 2025
Click to display QR Code for this record

The record appears in these collections:
Document types > Reports > Preprints
Institute Collections > PGI > PGI-2
Workflow collections > Public records
Publications database

 Record created 2025-01-31, last modified 2025-01-31


External link:
Download fulltext
Fulltext by arXiv.org
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)