Towards Fault-Tolerant Quantum Computing: Patrick Rall | QGSS 2025

Value of the Information & Strength of the Argument

The talk provides valuable insights into IBM’s approach to fault-tolerant quantum computing, offering a clear explanation of the gross code and its advantages. The argumentation is solid, supported by experimental data and numerical simulations. The speaker effectively justifies the choice of QLDPC codes over surface codes by highlighting the reduction in physical qubit overhead. The presentation is technically rigorous, with detailed explanations of the code construction and error correction mechanisms. However, the talk is primarily an expert opinion and does not include a comprehensive comparison with other approaches or a discussion of potential limitations.

Scientific Rigor, Source Quality, Title Accuracy

The talk is scientifically rigorous, with references to published research on QLDPC codes and IBM’s experimental work. The speaker cites specific experiments and numerical simulations, lending credibility to the claims. The title accurately reflects the content, which focuses on IBM’s roadmap and the gross code. The presentation is well-structured and technically detailed, though it assumes a certain level of familiarity with quantum error correction. No comments were provided for analysis.

The title accurately reflects the content, which focuses on IBM's roadmap for fault-tolerant quantum computing using QLDPC codes.

8/10

The talk is given by a research scientist at IBM Quantum, presenting technical details of quantum error correction codes and experimental results. The content is well-structured and based on published research, but as a conference talk it may omit some nuances and is not peer-reviewed in this format.

Markers derived by PSI from the transcript: the creator did not define chapters.

• 02:00Introduction to IBM's roadmap for fault-tolerant quantum computing by 2029.
• 05:00Overview of the bivariate bicycle family of QLDPC codes and the gross code.
• 10:00Technical construction of the gross code using check matrices and Tanner graphs.
• 15:00Explanation of the low-density parity check property and the degree-six connectivity.
• 20:00Discussion of the toric layout and long-range edges in the gross code.
• 25:00Experimental results on long-range couplers and degree-six connectivity.
• 30:00Syndrome measurement circuits and their low-depth design.
• 35:00Decoding process and linearized noise model.
• 40:00Numerical simulations showing logical error suppression.
• 45:00Comparison with surface codes and conclusion on scalability.

• IBM Quantum Roadmap — Referenced as the basis for IBM's plan to build a fault-tolerant quantum computer by 2029.
• Gross code paper — The gross code is introduced and described in this paper.
• Bivariate bicycle codes paper — The family of bivariate bicycle codes is defined and analyzed.

• Gross code paper — The paper presents the gross code and its properties, consistent with the talk.
• Bivariate bicycle codes paper — The paper introduces the family of codes and their advantages.