Scalable Quantum Error Correction for Surface Codes using FPGA

Understand

A fault-tolerant quantum computer must decode and correct errors faster than they appear.

• The faster errors can be corrected, the more time the computer can do useful work.
• The Union-Find (UF) decoder is promising with an average time complexity slightly higher than $O(d^3)$.
• We report a distributed version of the UF decoder that exploits parallel computing resources for further speedup.