Papers
Topics
Authors
Recent
Search
2000 character limit reached

Erasure-tolerance scheme for the surface codes on neutral atom quantum computers

Published 19 Apr 2024 in quant-ph | (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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 3 tweets with 9 likes about this paper.