Enhancing Quantum Memory Lifetime with Measurement-Free Local Error Correction and Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
Reliable quantum computation requires systematic identification and correction of errors that occur and accumulate in quantum hardware. To diagnose and correct such errors, standard quantum error-correcting protocols utilize textitglobal error information across the system obtained by mid-circuit readout of ancillary qubits. We investigate circuit-level error-correcting protocols that are measurement-free and based on textitlocal error information. Such a local error correction (LEC) circuit consists of faulty multi-qubit gates to perform both syndrome extraction and ancilla-controlled error removal. We develop and implement a reinforcement learning framework that takes a fixed set of faulty gates as inputs and outputs an optimized LEC circuit. To evaluate this approach, we quantitatively characterize an extension of logical qubit lifetime by a noisy LEC circuit. For the 2D classical Ising model and 4D toric code, our optimized LEC circuit performs better at extending a memory lifetime compared to a conventional LEC circuit based on Toom's rule in a sub-threshold gate error regime. We further show that such circuits can be used to reduce the rate of mid-circuit readouts to preserve a 2D toric code memory. Finally, we discuss the application of the LEC protocol on dissipative preparation of quantum states with topological phases.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 27 of its 117 references that are in the map. First posted on arXiv 18 Aug 2024.
Builds on
27 of 117 references.
References · 27
- 2017Attention Is All You Needcited by 59,932
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,455
- 2017Robust Adversarial Reinforcement Learningcited by 439
- 2015Deep Reinforcement Learning in Large Discrete Action Spacescited by 158
- 2017Data-efficient Deep Reinforcement Learning for Dexterous Manipulationcited by 61
- 2021Quantum Architecture Search via Deep Reinforcement Learningcited by 58
- 2021Instabilities of Offline RL with Pre-Trained Neural Representationcited by 38
- 2024Curriculum reinforcement learning for quantum architecture search under hardware errorscited by 37
- 2023Foundations of Reinforcement Learning and Interactive Decision Makingcited by 33
- 2018Optimizing Quantum Error Correction Codes with Reinforcement Learningcited by 28
- 2018Reinforcement Learning Decoders for Fault-Tolerant Quantum Computationcited by 27
15 more
- 2020Single-step deep reinforcement learning for open-loop control of laminar and turbulent flowscited by 14
- 2024A Reinforcement Learning Environment for Directed Quantum Circuit Synthesiscited by 10
- 2024Reinforcement learning-assisted quantum architecture search for variational quantum algorithmscited by 10
- 2018Advantages of versatile neural-network decoding for topological codescited by 9
- 2023Transformer-QEC: Quantum Error Correction Code Decoding with Transferable Transformerscited by 9
- 2021A scalable and fast artificial neural network syndrome decoder for surface codescited by 8
- 2018Proximal Policy Optimization and its Dynamic Version for Sequence Generationcited by 7
- 2021Simulated annealing for optimization of graphs and sequencescited by 5
- 2023The END: An Equivariant Neural Decoder for Quantum Error Correctioncited by 5
- 2023Discovery of Optimal Quantum Error Correcting Codes via Reinforcement Learningcited by 4
- 2023An Open-Loop Baseline for Reinforcement Learning Locomotion Taskscited by 4
- 2023Benchmarking Machine Learning Models for Quantum Error Correctioncited by 2
- 2024Qubit-Wise Architecture Search Method for Variational Quantum Circuitscited by 2
- 2019Neural Decoder for Topological Codes using Pseudo-Inverse of Parity Check Matrixcited by 1
- 2021Quantum circuit synthesis of Bell and GHZ states using projective simulation in the NISQ eracited by 1
Built on by
Citing papers per year: 2025: 1.
1 paper.