Quantum error correction has taken a significant step forward with the development of covariant approximate quantum codes, which can protect analog computations from decoherence. These codes exploit permutation symmetry to distribute logical information uniformly across the system, effectively circumventing the Eastin-Knill theorem's prohibition on exact codes with continuous transversal symmetries. By constructing explicit $SU(d)$-covariant approximate codes, researchers have made progress towards achieving robust analog quantum simulation. This breakthrough has the potential to significantly impact the field of quantum computing, as it enables the creation of more resilient and reliable quantum systems1. The implications of this development are far-reaching, as it could lead to significant advances in fields such as cryptography and optimization. So what matters to practitioners is that these codes may ultimately enable the creation of quantum systems that can perform complex computations while maintaining the integrity of the quantum information, thereby rewriting assumptions about computation and cryptography.