PennyLane
Install
Install
  1. Blog/
  2. Compilation/
  3. Top quantum compilation papers — Winter 2026 edition

March 04, 2026

Top quantum compilation papers — Winter 2026 edition

Danial Motlagh

Danial Motlagh

Top quantum compilation papers — Winter 2026 edition

This blog post is the first in our new series “Top quantum compilation papers”. Inspired by our “Top quantum algorithms papers” series, where we release a list of key results in quantum algorithms and applications research each quarter, we’re starting this new seasonal series on key papers in an increasingly important topic in the field of fault-tolerant quantum computing: quantum compilation.

Here are our favorite papers of winter 2026 based on their relevance to quantum compilation and fault-tolerant architectures! Xanadu papers won’t appear in the selection due to conflict of interest.

Contents

  • Top Papers
    • 1. The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes
    • 2. Any Clifford+T circuit can be controlled with constant T-depth overhead
    • 3. RASCqL: Reaction-time-limited Architecture for Space-time-efficient Complex qLDPC Logic
    • 4. DC-MBQC: A Distributed Compilation Framework for Measurement-Based Quantum Computing
  • Honorable mentions
    • 1. AlphaSyndrome: Tackling the Syndrome Measurement Circuit Scheduling Problem for QEC Codes
    • 2. FTCircuitBench: A Benchmark Suite for Fault-Tolerant Quantum Compilation and Architecture

Top Papers

1. The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes

Image taken from the paper The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes

First in-principle demonstration of the feasibility of breaking RSA-2048 with less than 100k physical qubits using a qLDPC-based architecture.

2. Any Clifford+T circuit can be controlled with constant T-depth overhead

Circuit taken from the paper Any Clifford+T circuit can be controlled with constant T-depth overhead

Major results showing any controlled Clifford circuit can be implemented with \mathcal{O}(1) T-depth, and any Clifford+T circuit with T-depth D can be controlled with T-depth \mathcal{O}(D), even without ancillas.

3. RASCqL: Reaction-time-limited Architecture for Space-time-efficient Complex qLDPC Logic

Image taken from the paper RASCqL: Reaction-time-limited Architecture for Space-time-efficient Complex qLDPC Logic

Introduces RASCqL, a Reaction-time-limited Architecture supporting key algorithmic subroutines such as quantum arithmetic, QROM, and magic-state distillation directly in co-designed qLDPC codes.

4. DC-MBQC: A Distributed Compilation Framework for Measurement-Based Quantum Computing

Image taken from the paper DC-MBQC: A Distributed Compilation Framework for Measurement-Based Quantum Computing

Introduces a distributed quantum compilation framework tailored for MBQC, tackling the QPU allocation and communication problem.

Honorable mentions

1. AlphaSyndrome: Tackling the Syndrome Measurement Circuit Scheduling Problem for QEC Codes

Image taken from the paper AlphaSyndrome: Tackling the Syndrome Measurement Circuit Scheduling Problem for QEC Codes

Introduces AlphaSyndrome, an automated framework that optimizes syndrome measurement scheduling to reduce logical error rates by an average of 80\% across various code families.

2. FTCircuitBench: A Benchmark Suite for Fault-Tolerant Quantum Compilation and Architecture

Image taken from the paper FTCircuitBench: A Benchmark Suite for Fault-Tolerant Quantum Compilation and Architecture

Introduces FTCircuitBench, a benchmark suite for the study and evaluation of fault-tolerant architectures and compilation strategies.


We hope you enjoyed our first ever collection of top quantum compilation papers. Stay tuned for the Spring 2026 edition! You can sign up to the Xanadu newsletter or follow PennyLane on LinkedIn or Twitter/X to get notified. If you haven't already, make sure to check out our series on top algorithm papers.

About the author

Danial Motlagh
Danial Motlagh

Danial Motlagh

Searching for real world applications of quantum computers.

Last modified: March 04, 2026

Related Blog Posts

PennyLane

PennyLane is a cross-platform Python library for quantum computing, quantum machine learning, and quantum chemistry. Built by researchers, for research. Created with ❤️ by Xanadu.

Research

  • Research
  • Performance
  • Hardware & Simulators
  • Demos
  • Quantum Compilation
  • Quantum Datasets

Education

  • Teach
  • Learn
  • Codebook
  • Coding Challenges
  • Videos
  • Glossary

Software

  • Install PennyLane
  • Features
  • Documentation
  • Catalyst Compilation Docs
  • Development Guide
  • API
  • GitHub
Stay updated with our newsletter

© Copyright 2026 | Xanadu | All rights reserved

TensorFlow, the TensorFlow logo and any related marks are trademarks of Google Inc.

Privacy Policy|Terms of Service|Cookie Policy|Code of Conduct