The early days of fault-tolerant quantum computing (FTQC) are rapidly approaching. Many contemporary architecture proposals are built on quantum low-density parity-check (QLDPC) codes — a subject that...

After much procrastination, I am starting a blog with a fun AI-derived observation. Here is a note, the abstract says it all: Round-robin CCZ is All You Need.

Quantum low-density parity-check (QLDPC) codes are promising candidates for practical low-overhead quantum memories. For large-scale fault-tolerant quantum computation, we further need logical process...

Different quantum error correction schemes trade off overhead, error suppression, and hardware connectivity. Code concatenation can relax these tradeoffs by using an outer code whose non-local connect...

Quantum error correction is widely believed to be essential for large-scale quantum computation, but the required qubit overhead remains a central challenge. Quantum low-density parity-check codes can...

Invited Speakers Natalie C. Brown (Quantinuum) Vedika Khemani (Stanford University) Anthony Leverrier (Inria) Yue Wu (Microsoft) List of Accepted Contributed Talks (presented in order of submission) T...

An overview of how Google is accelerating its timeline for post-quantum cryptography migration.

Quantum code surgery offers a flexible, low-overhead framework for executing logical measurements within quantum error-correcting codes. It encompasses several fault-tolerant logical computation schem...

YouTube video by Quantum @ Sydney

Generalized code surgery is a versatile and low-overhead technique for performing fault-tolerant computation on quantum low-density parity-check (qLDPC) codes. In many settings, surgery exhibits pract...

Nature Computational Science - Quantum error correction is vital for scalable quantum computing, but it incurs high resource overheads. This Perspective outlines recent breakthroughs and explores...

Quantum code surgery is a promising technique to perform fault-tolerant computation on quantum low-density parity-check codes. Recent developments have significantly reduced the space overhead of surg...

We investigate layer codes, a family of three-dimensional stabilizer codes that can achieve optimal scaling of code parameters and a polynomial energy barrier, as candidates for self-correcting quantu...

The Clifford hierarchy is a fundamental structure in quantum computation whose mathematical properties are not fully understood. In this work, we characterize permutation gates -- unitaries which perm...

Proving threshold theorems for fault-tolerant quantum computation is a burdensome endeavor with many moving parts that come together in relatively formulaic but lengthy ways. It is difficult and rare ...

YouTube video by Simons Institute for the Theory of Computing

Nature - Experimental demonstration of logical magic state distillation

Constructing quantum codes with good parameters and useful transversal gates is a central problem in quantum error correction. In this paper, we continue our work in arXiv:2502.01864 and construct the...

Raymond Laflamme, a trailblazer in quantum information processing and pioneer of the Institute for Quantum Computing (IQC) at the University of Waterloo, died on June 19 after a lengthy battle with ca...

We present the bicycle architecture, a modular quantum computing framework based on high-rate, low-overhead quantum LDPC codes identified in prior work. For two specific bivariate bicycle codes with d...

We introduce a new heuristic decoder, Relay-BP, targeting real-time quantum circuit decoding for large-scale quantum computers. Relay-BP achieves high accuracy across circuit-noise decoding problems: ...

In pursuit of large-scale fault-tolerant quantum computation, quantum low-density parity-check (LPDC) codes have been established as promising candidates for low-overhead memory when compared to conve...