📄 Showing the "Simple" version — "Popular" is not ready yet. Add it to favorites to help prioritize it. Ask for the full read

Quantum computers make mistakes. Each step of a computation introduces a tiny inaccuracy, and if left uncorrected, the result degenerates into noise. One of the main challenges is rotating a phase by an arbitrary angle. The standard approach is to assemble the desired rotation from a set of simple operations, like a mosaic. But the mosaic is approximate, and the more precise you want it, the more pieces you need, the longer the computation, and the higher the chance of failure.

The authors of the new work propose a different path. They grow a special quantum state — a catalyst. A catalyst is like a perfectly tuned tuning fork. It is created once, checked, and cleansed of defects, then used over and over. Each time a precise rotation is needed, the catalyst 'lends' its phase through a controlled quantum gate. No approximation, no extra circuit depth. Errors do not accumulate because the source of error, the mosaic assembly, is simply removed from the main loop.

The process resembles crystal growth. First, you take a rough blank — nine blocks of surface code of size three. Then you repeatedly run them through verification operations, discarding defective instances. The surviving 'crystals' are grown to size seven, making them even more robust. The final check is a single one, because reading the phase is inherently error-tolerant. This sets the catalyst apart from 'magic states': those require repeated re-checks.

As a result, the quantum processor gets a precise phase shift without extra overhead in real time. The complexity is shifted to the preparation stage, while the computation itself remains fast and clean. This approach could become a standard tool for quantum computers with a limited set of native operations.