A fault-tolerant quantum computer based on bivariate bicycle codes

ORAL  · Invited

Abstract

Last year, we debuted the bicycle architecture [1], a modular quantum computing framework which performs universal, fault-tolerant quantum computation on information encoded into bivariate bicycle codes. As a first of its kind quantum computer employing high-rate, low-density parity-check (LDPC) codes and generalized code surgery, we anticipated the blueprint to evolve based on further research. Here, I will review the design principles and advantages of the bicycle architecture, including its low qubit overhead and flexibility, and present updates, including new benchmarking results. In parallel, IBM is excited to be making quantum LDPC codes a reality in superconducting hardware, and I will present some updates from that effort.

Publication: [1] Theodore J. Yoder, Eddie Schoute, Patrick Rall, Emily Pritchett, Jay M. Gambetta, Andrew W. Cross, Malcolm Carroll, and Michael E. Beverland. "Tour de gross: A modular quantum computer based on bivariate bicycle codes." arXiv preprint arXiv:2506.03094 (2025).

Presenters

  • Ted Yoder

    • IBM Quantun
    • IBM Quantum

Authors

  • Ted Yoder

    • IBM Quantun
    • IBM Quantum