Incoherent Approximation of Leakage in Quantum Error Correction

• URL: http://arxiv.org/abs/2312.10277v2
• Date: Wed, 05 Mar 2025 00:47:33 GMT
• Title: Incoherent Approximation of Leakage in Quantum Error Correction
• Authors: Jeffrey Marshall, Dvir Kafri,
• Abstract summary: Quantum error correcting codes typically do not account for quantum state transitions - leakage - out of the computational subspace.<n>We introduce a Subspace Twirling Approximation (STA) on quantum channels that preserves the incoherence between the computational and leakage subspaces.
• Score: 0.03320194947871346
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum error correcting codes typically do not account for quantum state transitions - leakage - out of the computational subspace. Since these errors can last for multiple detection rounds they can significantly contribute to logical errors. It is therefore important to understand how to numerically model them efficiently. Fully quantum simulations of leakage require more levels per leaked qubit, which substantially limits the system sizes that may be simulated. To address this, we introduce a Subspace Twirling Approximation (STA) on quantum channels that preserves the incoherence between the computational and leakage subspaces. The assumption of incoherence enables the quantum simulation of leakage at little computational overhead. We motivate the approximation's validity by showing that incoherence is achieved naturally during repeated stabilizer measurements. Additionally, we provide various simulation results which show that the STA yields accurate error correction statistics in the repetition and surface codes with physical error parameters.

Related papers

• 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)
• Efficient Simulation of Leakage Errors in Quantum Error Correcting Codes Using Tensor Network Methods [0.2209921757303168]
  We present a computationally efficient simulation methodology for studying leakage errors in quantum error correcting codes (QECCs) Our approach enables the simulation of various leakage processes, including thermal noise and coherent errors, without approximations. By leveraging the small amount of entanglement generated during the error correction process, we are able to study large systems, up to a few hundred qudits, over many code cycles.
  arXiv  Detail & Related papers  (2023-08-16T07:36:33Z)
• 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)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Overcoming leakage in scalable quantum error correction [128.39402546769284]
  Leakage of quantum information out of computational states into higher energy states represents a major challenge in the pursuit of quantum error correction (QEC) Here, we demonstrate the execution of a distance-3 surface code and distance-21 bit-flip code on a Sycamore quantum processor where leakage is removed from all qubits in each cycle. We report a ten-fold reduction in steady-state leakage population on the data qubits encoding the logical state and an average leakage population of less than $1 times 10-3$ throughout the entire device.
  arXiv  Detail & Related papers  (2022-11-09T07:54:35Z)
• Validation tests of GBS quantum computers give evidence for quantum advantage with a decoherent target [62.997667081978825]
  We use positive-P phase-space simulations of grouped count probabilities as a fingerprint for verifying multi-mode data. We show how one can disprove faked data, and apply this to a classical count algorithm.
  arXiv  Detail & Related papers  (2022-11-07T12:00:45Z)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• Realizing Repeated Quantum Error Correction in a Distance-Three Surface Code [42.394110572265376]
  We demonstrate quantum error correction using the surface code, which is known for its exceptionally high tolerance to errors. In an error correction cycle taking only $1.1,mu$s, we demonstrate the preservation of four cardinal states of the logical qubit.
  arXiv  Detail & Related papers  (2021-12-07T13:58:44Z)
• Error-mitigated deep-circuit quantum simulation: steady state and relaxation rate problems [4.762232147934851]
  We show that digital quantum simulation of closed quantum systems are robust against the accumulation of Trotter errors. We propose a new error-mitigation technique based on the scaling behavior in the vicinity of the critical point of a quantum phase transition.
  arXiv  Detail & Related papers  (2021-11-18T11:01:45Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)
• Pauli channels can be estimated from syndrome measurements in quantum error correction [0.7264378254137809]
  We show that a stabilizer code can be used to estimate Pauli channels with correlations across a number of qubits given by the pure distance. It also allows for measurement errors within the framework of quantum data-syndrome codes. It is our hope that this work opens up interesting applications, such as the online adaptation of a decoder to time-varying noise.
  arXiv  Detail & Related papers  (2021-07-29T18:01:10Z)
• Removing leakage-induced correlated errors in superconducting quantum error correction [1.8397027011844889]
  Quantum computing can become scalable through error correction, but logical error rates only decrease with system size when physical errors are sufficiently uncorrelated. Here, we report a reset protocol that returns a qubit to the ground state from all relevant higher level states. We find lower rates of logical errors and an improved scaling and stability of error suppression with increasing qubit number.
  arXiv  Detail & Related papers  (2021-02-11T17:11:11Z)
• Multi-exponential Error Extrapolation and Combining Error Mitigation Techniques for NISQ Applications [0.0]
  Noise in quantum hardware remains the biggest roadblock for the implementation of quantum computers. Error extrapolation is an error mitigation technique that has been successfully implemented experimentally. We extend this to multi-exponential error extrapolation and provide more rigorous proof for its effectiveness under Pauli noise.
  arXiv  Detail & Related papers  (2020-07-02T17:18:47Z)
• The limits of quantum circuit simulation with low precision arithmetic [0.0]
  The goal is to estimate how much memory can be saved in simulations that involve random, maximally entangled quantum states. An arithmetic polar representation of $B$ bits is defined for each quantum amplitude. A model is developed to quantify the cumulative errors on a circuit of $Q$ qubits and $G$ gates.
  arXiv  Detail & Related papers  (2020-05-27T14:48:31Z)

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.