Leveraging Atom Loss Errors in Fault Tolerant Quantum Algorithms

• URL: http://arxiv.org/abs/2502.20558v1
• Date: Thu, 27 Feb 2025 21:59:25 GMT
• Title: Leveraging Atom Loss Errors in Fault Tolerant Quantum Algorithms
• Authors: Gefen Baranes, Madelyn Cain, J. Pablo Bonilla Ataides, Dolev Bluvstein, Josiah Sinclair, Vladan Vuletic, Hengyun Zhou, Mikhail D. Lukin,
• Abstract summary: Errors associated with qubit loss constitute an important source of noise in many quantum hardware systems.<n>We develop a theoretical framework to handle these errors in logical algorithms, incorporating decoding techniques and circuit-level optimizations.<n>We simulate such a teleportation-based algorithm, involving a toy model for small-angle synthesis and find a significant improvement in logical error rates as the loss fraction increases.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Errors associated with qubit loss constitute an important source of noise in many quantum hardware systems, particularly in neutral atom quantum computers. We develop a theoretical framework to handle these errors in logical algorithms, incorporating decoding techniques and circuit-level optimizations. Focusing on experimentally-motivated error models, we introduce a delayed-erasure decoder which leverages information from state-selective readout to accurately correct loss errors, even when their precise locations are unknown. Our decoding technique is compatible with a wide range of quantum error correction codes and general logical circuits. Using this decoder, we identify strategies for detecting and correcting atom loss based on the logical circuit structure. For deep circuits with a large number of gate layers prior to logical measurements, we explore methods to integrate loss detection into syndrome extraction with minimal overhead, identifying optimal strategies depending on the qubit loss fraction in the noise. In contrast, many algorithmic subroutines involve frequent gate teleportation, shortening the circuit depth before logical measurement and naturally replacing qubits without additional overhead. We simulate such a teleportation-based algorithm, involving a toy model for small-angle synthesis and find a significant improvement in logical error rates as the loss fraction increases, with loss handled solely through teleportation. These results provide a path forward for advancing large-scale fault tolerant quantum computation in systems with loss errors.

Related papers

• Learning to decode logical circuits [26.510386591426112]
  We introduce a data-centric modular decoder framework, Multi-Core Circuit Decoder (MCCD) MCCD handles both single-qubit and entangling gates within a unified framework. Our approach represents a noise-model solution to the decoding challenge for deep logical quantum circuits.
  arXiv  Detail & Related papers  (2025-04-23T18:00:04Z)
• Exact Decoding of Repetition Code under Circuit Level Noise [8.281330924913446]
  Repetition code forms a fundamental basis for quantum error correction experiments.<n>Current methods for decoding repetition codes under circuit level noise are suboptimal.<n>We propose an optimal maximum likelihood decoding algorithm called planar.
  arXiv  Detail & Related papers  (2025-01-07T07:14:01Z)
• Algorithmic Fault Tolerance for Fast Quantum Computing [37.448838730002905]
  We show that fault-tolerant logical operations can be performed with constant time overhead for a broad class of quantum codes. We prove that the deviation from the ideal measurement result distribution can be made exponentially small in the code distance. Our work sheds new light on the theory of fault tolerance, potentially reducing the space-time cost of practical fault-tolerant quantum computation by orders of magnitude.
  arXiv  Detail & Related papers  (2024-06-25T15:43:25Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• The END: An Equivariant Neural Decoder for Quantum Error Correction [73.4384623973809]
  We introduce a data efficient neural decoder that exploits the symmetries of the problem. We propose a novel equivariant architecture that achieves state of the art accuracy compared to previous neural decoders.
  arXiv  Detail & Related papers  (2023-04-14T19:46:39Z)
• Fault Tolerant Non-Clifford State Preparation for Arbitrary Rotations [3.47670594338385]
  We propose a postselection-based algorithm to efficiently prepare resource states for gate teleportation. Our algorithm achieves fault tolerance, demonstrating the exponential suppression of logical errors with code distance. Our approach presents a promising path to reducing the resource requirement for quantum algorithms on error-corrected and noisy intermediate-scale quantum computers.
  arXiv  Detail & Related papers  (2023-03-30T13:46:52Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Deterministic correction of qubit loss [48.43720700248091]
  Loss of qubits poses one of the fundamental obstacles towards large-scale and fault-tolerant quantum information processors. We experimentally demonstrate the implementation of a full cycle of qubit loss detection and correction on a minimal instance of a topological surface code.
  arXiv  Detail & Related papers  (2020-02-21T19:48:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.