First-hand information for everyone
Researchers have devised a new quantum error‑correcting code that dramatically improves the trade‑off between how many logical qubits can be encoded and how well errors can be detected. The improvement applies to “fully addressable transversal phase gates,” which are essential for fault‑tolerant quantum computing.
The team introduced a deterministic, polynomial‑time algebraic‑geometric construction that layers a nested outer code with an inner uniform‑superposition check. This two‑step encoding keeps the logical phase control separate from the design of the code’s rate (the fraction of logical qubits) and its relative distance (the ability to catch errors). As a result, both the rate and the relative distance converge to a common lower bound of 52/(675 h) when the gate lies at level h (≥3) of the Clifford hierarchy. For the most common case, the T gate (h = 3), this bound equals 0.0257, or 2.57 %.
A second, exponential‑time version of the construction pushes the bound further to 0.0734, or 7.34 %. These numbers are orders of magnitude higher than earlier explicit schemes, which yielded bounds of 4.6 × 10⁻⁹ for San‑José, 4.1 × 10⁻⁶ for Lin et al., and 7.2 × 10⁻⁵ or 9.6 × 10⁻⁴ for Meiburg’s CSS and modular‑clock families.
| Construction | Common lower bound |
|---|---|
| San-José [14] | 4.6027×10−9 |
| Lin et al. [9] | 4.1356×10−6 |
| Meiburg (CSS) [15] | 7.1751×10−5 |
| Meiburg (modular clock) [15] | 9.6006×10−4 |
| This work (polynomial) | 2.5679×10−2 |
| This work (exponential) | 7.3352×10−2 |
Because the construction separates logical control from error‑detection, it retains the same number of logical qubits while effectively doubling the physical‑qubit distance with only a 25 % increase in block length. This makes the new codes more practical for near‑term quantum hardware.
However, an upper limit arises from the requirement that the transversal gate be fully addressable: the common asymptotic coefficient of rate and distance cannot exceed 0.2827/h. For h = 3 this becomes roughly 0.0942, meaning that even the most efficient codes are bounded below this value.
| Result and scope | Z(h) | T (h=3) |
|---|---|---|
| Polynomial-time AG | 52/(675h) | 0.0257 |
| Exponential-time | t⋆/h | 0.0734 |
| General upper bound | 0.2827 | 0.2827 |
| Upper bound (cyclic) | 0.2827/h | 0.0942 |
In short, the new algebraic‑geometric approach raises the attainable error‑correction performance for fully addressable transversal phase gates to realistic percentages, while respecting fundamental theoretical limits.