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

Abstract

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.

37 pages (preprint), 9 figures

References in corpus (13)

• Quantum Computing
• Confining the state of light to a quantum manifold by engineered two-photon loss
• Optimum Quantum Error Recovery using Semidefinite Programming
• Learning to Decode the Surface Code with a Recurrent, Transformer-Based Neural Network
• Robust Quantum Error Correction via Convex Optimization
• Structured Near-Optimal Channel-Adapted Quantum Error Correction
• Quantum Error Correction of Qudits Beyond Break-even
• Universal control of a bosonic mode via drive-activated native cubic interactions
• Approximate Autonomous Quantum Error Correction with Reinforcement Learning
• Suboptimal quantum-error-correcting procedure based on semidefinite programming
• Simultaneous Discovery of Quantum Error Correction Codes and Encoders with a Noise-Aware Reinforcement Learning Agent
• Quantum circuit synthesis via a random combinatorial search
• Discovery of Optimal Quantum Error Correcting Codes via Reinforcement Learning