Automated discovery and optimization of autonomous quantum error correction codes for a general open quantum system

We develop a method to search for the optimal code space, induced decay rates and control Hamiltonian to implement autonomous quantum error correction (AQEC) for a general open quantum system. The system is defined by a free-evolution Lindbladian superoperator, which contains the free Hamiltonian and naturally occurring decoherence terms, as well as the control superoperators. The performance metric for optimization in our algorithm is the fidelity between the projector onto the code space and the same projector after Lindbladian evolution for a specified time. We use a gradient-based search to update the code words, induced decay matrix and control Hamiltonian matrix. We apply our algorithm to optimize AQEC codes for a variety of few-level systems. The four-level system with uniform decay rates offers a simple example for testing and illustrating the operation of our approach. The algorithm reliably succeeds in finding the optimal code in this case, while success becomes probabilistic for more complicated cases. For a five-level system with photon loss decay, the algorithm finds good AQEC codes, but these codes are not as good as the well-known binomial code. We use the binomial code as a starting point to search for the optimal code for a perturbed five-level system. In this case, the algorithm finds a code that is better than both the original binomial code and any other code obtained numerically when starting from a random initial guess. Our results demonstrate the promise of using computational techniques to discover and optimize AQEC codes in future real-world quantum computers.

💡 Research Summary

The paper presents a systematic, gradient‑based numerical framework for automatically discovering and optimizing autonomous quantum error‑correction (AQEC) codes in arbitrary open quantum systems. Starting from the Lindblad master equation under the Markovian approximation, the authors treat the free Hamiltonian, natural decay channels, and any added control terms as components of a single super‑operator 𝔏. By reshaping the density matrix into an n²‑dimensional vector, the time evolution becomes a simple matrix exponential ρ̃(t)=e^{𝔏t}ρ̃(0), which greatly facilitates the computation of a performance metric.

The target operation is the projector 𝑃 onto a two‑dimensional logical subspace spanned by codewords |0̃⟩ and |1̃⟩. The fidelity
F = (1/4) Tr