Efficient Simulation of Leakage Errors in Quantum Error Correcting Codes
Using Tensor Network Methods
- URL: http://arxiv.org/abs/2308.08186v1
- Date: Wed, 16 Aug 2023 07:36:33 GMT
- Title: Efficient Simulation of Leakage Errors in Quantum Error Correcting Codes
Using Tensor Network Methods
- Authors: Hidetaka Manabe, Yasunari Suzuki, Andrew S. Darmawan
- Abstract summary: 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.
- Score: 0.2209921757303168
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Leakage errors, in which a qubit is excited to a level outside the qubit
subspace, represent a significant obstacle in the development of robust quantum
computers. We present a computationally efficient simulation methodology for
studying leakage errors in quantum error correcting codes (QECCs) using tensor
network methods, specifically Matrix Product States (MPS). Our approach enables
the simulation of various leakage processes, including thermal noise and
coherent errors, without approximations (such as the Pauli twirling
approximation) that can lead to errors in the estimation of the logical error
rate. We apply our method to two QECCs: the one-dimensional (1D) repetition
code and a thin $3\times d$ surface code. 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. We
consider a realistic noise model of leakage relevant to superconducting qubits
to evaluate code performance and a variety of leakage removal strategies. Our
numerical results suggest that appropriate leakage removal is crucial,
especially when the code distance is large.
Related papers
- 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) - Incoherent Approximation of Leakage in Quantum Error Correction [0.03922370499388702]
Quantum error correcting codes typically do not account for quantum state transitions - leakage - out of the computational subspace.
We introduce a Random Phase Approximation (RPA) on quantum channels that preserves the incoherence between the computational and leakage subspaces.
We show that RPA yields accurate error correction statistics in the repetition and surface codes with physical error parameters.
arXiv Detail & Related papers (2023-12-16T00:52:23Z) - 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) - Improved quantum error correction with randomized compiling [0.0]
Current hardware for quantum computing suffers from high levels of noise.
We explore the role and effectiveness of using noise tailoring techniques to improve the performance of error correcting codes.
arXiv Detail & Related papers (2023-03-13T04:24:24Z) - 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) - 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) - Improved decoding of circuit noise and fragile boundaries of tailored
surface codes [61.411482146110984]
We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes.
Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC.
We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
arXiv Detail & Related papers (2022-03-09T18:48:54Z) - Performance of teleportation-based error correction circuits for bosonic
codes with noisy measurements [58.720142291102135]
We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit.
We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
arXiv Detail & Related papers (2021-08-02T16:12:13Z) - Exponential suppression of bit or phase flip errors with repetitive
error correction [56.362599585843085]
State-of-the-art quantum platforms typically have physical error rates near $10-3$.
Quantum error correction (QEC) promises to bridge this divide by distributing quantum logical information across many physical qubits.
We implement 1D repetition codes embedded in a 2D grid of superconducting qubits which demonstrate exponential suppression of bit or phase-flip errors.
arXiv Detail & Related papers (2021-02-11T17:11:20Z) - Efficiently computing logical noise in quantum error correcting codes [0.0]
We show that measurement errors on readout qubits manifest as a renormalization on the effective logical noise.
We derive general methods for reducing the computational complexity of the exact effective logical noise by many orders of magnitude.
arXiv Detail & Related papers (2020-03-23T19:40:56Z)
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.