Erasure-tolerance scheme for the surface codes on neutral atom quantum computers (2404.12656v3)
Abstract: Neutral atom arrays manipulated with optical tweezers are promising candidates for fault-tolerant quantum computers due to their advantageous properties, such as scalability, long coherence times, and optical accessibility for communication. A significant challenge to overcome is the presence of non-Pauli errors, specifically erasure errors and leakage errors. Previous work has shown that leakage errors can be converted into erasure errors; however, these (converted) erasure errors continuously occur and accumulate over time. Prior proposals have involved transporting atoms directly from a reservoir area--where spare atoms are stored--to the computational area--where computation and error correction are performed--to correct atom loss. While coherent transport is promising, it may not address all challenges--particularly its effectiveness in dense arrays and alternative methods must help. In this study, we evaluate the effects of erasure errors on the surface code using circuit-based Monte Carlo simulations that incorporate depolarizing and accumulated erasure errors. We propose a new scheme to mitigate this problem: a k-shift erasure recovery scheme. Our scheme employs code deformation to repeatedly transfer the logical qubit from an imperfect array with accumulated erased qubits to a perfect array, thereby tolerating many accumulated erasures. Furthermore, our scheme corrects erasure errors in the atom arrays while the logical qubits are evacuated from the area being corrected; thus, manipulating optical tweezers for erasure correction does not disturb the qubits that constitute the logical data. Our scheme provides a practical pathway for neutral atom quantum computers to achieve feasible fault tolerance.
- T. M. Stace and S. D. Barrett, Phys. Rev. A 81, 022317 (2010).
- M. Saffman, J. Phys. B At. Mol. Opt. Phys. 49, 202001 (2016).
- M. Grassl, T. Beth, and T. Pellizzari, (1996), arXiv:quant-ph/9610042 [quant-ph] .
- N. Delfosse and G. Zémor, (2017), arXiv:1703.01517 [quant-ph] .
- V. Kolmogorov, Math. Program. Comput. 1, 43 (2009).
- A. C. Whiteside and A. G. Fowler, (2014), arXiv:1409.4880 [quant-ph] .
- S. D. Barrett and T. M. Stace, Phys. Rev. Lett. 105, 200502 (2010).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.