← Latest papers
⚛️ quantum physics

A Compiler for Fault Tolerant Quantum Computing

This paper introduces FTQC, an open-source MLIR dialect designed for fault-tolerant quantum computing that preserves critical error-correction metadata through a multi-level compilation pipeline, enabling verifiable code-specific decisions and revealing hidden architectural costs across diverse hardware targets.

Original author: Narasinga Rao Miniskar, Elaine Wong, Seyong Lee, Vicente Leyton-Ortega, Jeffrey S. Vetter, Travis S. Humble

Published 2026-11-11
📖 5 min read🧠 Deep dive

Original author: Narasinga Rao Miniskar, Elaine Wong, Seyong Lee, Vicente Leyton-Ortega, Jeffrey S. Vetter, Travis S. Humble

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the author. For technical accuracy, refer to the original paper. Read full disclaimer

Quantum computers promise to solve problems that would take classical machines thousands of years, but they are incredibly fragile. The smallest disturbance from heat or vibration can scramble the information they hold, causing calculations to fail. To overcome this, scientists are building fault-tolerant quantum computers, which do not rely on perfect, error-free parts. Instead, they group many physical particles together to form a single, stable "logical" unit of information. If one particle in the group glitches, the others can detect the mistake and fix it without losing the data. This process, known as quantum error correction, is the foundation of the future machine, but it comes with a steep price: a single useful calculation might require millions of physical particles working in unison.

The challenge is not just building the hardware, but writing the software to control it. Current tools for programming quantum computers are designed for today's noisy, small-scale devices. They do not understand the complex rules needed to manage error correction, such as how to track the "syndromes" that signal an error or how to prepare special resources needed for difficult calculations. Without a software system that speaks the language of error correction, engineers cannot reliably translate a high-level idea into a physical circuit that a real machine can execute. A team of researchers at Oak Ridge National Laboratory has addressed this gap by creating a new compiler, a piece of software that acts as a translator between human logic and the rigid, error-corrected world of a future quantum computer.

The researchers built a system called FTQC, which stands for Fault-Tolerant Quantum Computing. Think of a compiler as a translator that takes a program written in a high-level language and converts it into the specific instructions a machine understands. In the quantum world, this is difficult because the machine does not just run a program; it must constantly monitor itself for errors and correct them in real time. The new system introduces a way to describe these error-corrected units directly in the code. Instead of treating a logical qubit as a simple variable, the software gives it a specific identity that includes its error-correction rules. This allows the compiler to check, at every step, whether the operations being performed are valid for that specific type of error protection. If a programmer tries to mix two different types of error correction that do not work together, the compiler stops and flags the error before the code ever reaches the machine.

To manage the complexity, the researchers designed the system with two distinct levels. The top level handles the logical instructions, the high-level math and logic that a scientist wants to perform. The bottom level handles the physical reality, the individual particles and the specific gates that manipulate them. A special process in the middle translates the logical instructions into the physical ones, expanding a single logical command into a large block of physical operations. This design ensures that the same logical program can be sent to different types of hardware without needing to be rewritten. The system also includes a built-in calculator that estimates how many physical particles will be needed for a given task. This is crucial because the cost of error correction is high; a simple calculation might require a factory of extra particles just to keep the main data safe.

The team tested their system using several standard quantum algorithms, including a method for searching data and a technique for analyzing the properties of molecules. They ran these tests on a simulator to see how the software handled the translation and resource counting. The results showed that the compiler could successfully convert logical programs into physical circuits for different types of error-correcting codes, including the Steane code and the surface code. One of the most revealing findings came from analyzing a three-qubit calculation known as a Quantum Fourier Transform. The compiler determined that to run this calculation with error correction, the system would need a "magic state factory"—a dedicated block of resources to prepare special states needed for the math. This factory required five times as many physical particles as the entire encoded circuit itself. This highlights a hidden cost in fault-tolerant computing: the resources needed to maintain the system often dwarf the resources needed for the calculation itself.

Beyond simulation, the researchers took their work to real hardware. They targeted a 20-qubit superconducting quantum computer at Oak Ridge National Laboratory. They used their compiler to translate a simple logical circuit into the native instructions of the machine. Because the machine is too small to run a full error-corrected calculation, they used the compiler to generate the physical circuit and then applied a classical decoding process to the results after the run. The results were promising: by using the error-correction information generated by the compiler, they were able to reduce the logical readout error by a factor of 3.3. This means that the final answer was significantly more accurate than the raw data from the machine, proving that the compiler's output could successfully reach physical hardware and improve the quality of the results.

The work does not claim to have solved the problem of building a fault-tolerant computer. The experiments were limited in size and did not demonstrate the full threshold where error correction becomes perfectly effective. The simulations used simplified models for certain complex operations, and the hardware tests were proof-of-concept runs rather than full-scale demonstrations. However, the system provides a practical foundation for the next stage of development. By making the rules of error correction visible and manageable within the software, the researchers have created a tool that allows engineers to inspect, verify, and optimize their designs before they are built. This clarity is essential for moving from theoretical ideas to the massive, complex systems required for the next generation of quantum computing.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →