Fault-tolerance of the [[8,1,3]] non-CSS code

• URL: http://arxiv.org/abs/2402.19389v3
• Date: Thu, 4 Jul 2024 17:03:37 GMT
• Title: Fault-tolerance of the [[8,1,3]] non-CSS code
• Authors: Pranav Maheshwari, Ankur Raina,
• Abstract summary: We present a fault-tolerant non-CSS quantum error correcting code and study its logical error rates. Considering two types of noise models for this study, we adopt the procedure of the bare ancilla method presented by Brown et al.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a fault-tolerant [[8, 1, 3]] non-CSS quantum error correcting code and study its logical error rates. We choose the unitary encoding procedure for stabilizer codes given by Gottesman and modify it to suit the setting of a class of non- CSS codes. Considering two types of noise models for this study, namely the depolarising noise and anisotropic noise, to depict the logical error rates obtained in decoding, we adopt the procedure of the bare ancilla method presented by Brown et al. to reorder the measurement sequence in the syndrome extraction step and upgrade it to obtain higher pseudo-thresholds and lower leading order terms of logical error rates.

Related papers

• Bayesian Optimization for Quantum Error-Correcting Code Discovery [3.0556222192221667]
  We propose a framework to discover quantum error-correcting codes that improves data efficiency and scalability.<n>Our main contribution is a multi-view chain-complex neural embedding that allows us to predict the logical error rate of quantum LDPC codes without performing expensive simulations.
  arXiv  Detail & Related papers  (2026-01-26T15:10:01Z)
• Decoding Multimode Gottesman-Kitaev-Preskill Codes with Noisy Auxiliary States [0.0]
  We show that leveraging the correlations between measurement results and the actual error affecting the multimode GKP state can decrease the logical error probability by at least an order of magnitude.
  arXiv  Detail & Related papers  (2025-10-14T16:14:33Z)
• Second-order Optimization under Heavy-Tailed Noise: Hessian Clipping and Sample Complexity Limits [53.773695219320125]
  We take a first step toward a theoretical understanding of second-order optimization under heavy-tailed noise.<n>We introduce a novel algorithm based on gradient and Hessian clipping, and prove high-probability upper bounds that nearly match the fundamental limits.
  arXiv  Detail & Related papers  (2025-10-12T16:36:54Z)
• Fault-tolerant correction-ready encoding of the [[7,1,3]] Steane code on a 2D grid [0.0]
  We investigate various correction-ready encoding methods to fault-tolerantly prepare the zero-logical state of the Steane code on a 2D grid. We show that parity-check encoding with a few Flag-Bridge qubits outperforms verification-based encoding by achieving lower error rates. Surprisingly, compared to the resource-intensive Steane error correction, this low-overhead method still offers a practical advantage in noisy settings.
  arXiv  Detail & Related papers  (2025-04-01T18:00:30Z)
• Efficient Mitigation of Error Floors in Quantum Error Correction using Non-Binary Low-Density Parity-Check Codes [0.0]
  We identify and classify cycle structures in the parity-check matrix where estimated noise becomes trapped. For Type-I cycles, we propose a method to make the difference between estimated and true noise degenerate. Type-II cycles are shown to be uncorrectable, while for Type-III cycles, we utilize the fact that cycles in non-binary LDPC codes do not necessarily correspond to codewords.
  arXiv  Detail & Related papers  (2025-01-23T18:59:08Z)
• Fault-tolerance of [[6, 1, 3]] non-CSS code family generated using measurements on graph states [2.393694563816463]
  We construct and analyze the fault tolerance of $[[6,1,3]]$ non-CSS quantum error correcting code under the anisotropic and depolarizing noise models. This method was called fault-tolerance using bare ancilla by Brown emphet al.
  arXiv  Detail & Related papers  (2025-01-21T11:55:44Z)
• Fault-tolerant noise guessing decoding of quantum random codes [0.0]
  We present a new decoder for quantum random linear codes (QRLCs) capable of dealing with imperfect decoding operations. We analyze the fault-tolerant characteristics of QRLCs with a new noise-guessing decoding technique.
  arXiv  Detail & Related papers  (2024-07-01T17:54:23Z)
• Circuit-level fault tolerance of cat codes [0.0]
  Bosonic codes encode quantum information into a single infinite-dimensional physical system endowed with error correction capabilities.<n>Recent discussions of bosonic codes centre around correcting only boson-loss errors.<n>We show how, through waiting-time optimization and the use of squeezing, we can restore the noise requirements to a regime achievable with near-term quantum hardware.
  arXiv  Detail & Related papers  (2024-06-06T15:18:25Z)
• Color code decoder with improved scaling for correcting circuit-level noise [2.440316110613964]
  Two-dimensional color codes are a promising candidate for fault-tolerant quantum computing. We introduce an efficient color-code decoder that combines two matching decoders for each color. Our simulations reveal that this decoding strategy nearly reaches the best possible scaling of logical failure.
  arXiv  Detail & Related papers  (2024-04-11T05:31:39Z)
• Correcting biased noise using Gottesman-Kitaev-Preskill repetition code with noisy ancilla [0.6802401545890963]
  Gottesman-Kitaev-Preskill (GKP) code is proposed to correct small displacement error in phase space. If noise in phase space is biased, square-lattice GKP code can be ancillaryd with XZZX surface code or repetition code. We study the performance of GKP repetition codes with physical ancillary GKP qubits in correcting biased noise.
  arXiv  Detail & Related papers  (2023-08-03T06:14:43Z)
• 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 error correction with dissipatively stabilized squeezed cat qubits [68.8204255655161]
  We propose and analyze the error correction performance of a dissipatively stabilized squeezed cat qubit. We find that for moderate squeezing the bit-flip error rate gets significantly reduced in comparison with the ordinary cat qubit while leaving the phase flip rate unchanged.
  arXiv  Detail & Related papers  (2022-10-24T16:02:20Z)
• Denoising Diffusion Error Correction Codes [92.10654749898927]
  Recently, neural decoders have demonstrated their advantage over classical decoding techniques. Recent state-of-the-art neural decoders suffer from high complexity and lack the important iterative scheme characteristic of many legacy decoders. We propose to employ denoising diffusion models for the soft decoding of linear codes at arbitrary block lengths.
  arXiv  Detail & Related papers  (2022-09-16T11:00:50Z)
• Correcting non-independent and non-identically distributed errors with surface codes [0.8039067099377079]
  We develop and investigate the properties of topological surface codes adapted to a known noise structure by Clifford conjugations. We show that the surface code locally tailored to non-uniform single-qubit noise in conjunction with a scalable matching decoder yields an increase in error thresholds and exponential suppression of sub-threshold failure rates.
  arXiv  Detail & Related papers  (2022-08-03T16:21:44Z)
• 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)
• Optimizing Stabilizer Parities for Improved Logical Qubit Memories [0.8431877864777444]
  We study variants of Shor's code that are adept at handling single-axis correlated idling errors. Even-distance versions of our Shor code variants are decoherence-free subspaces and fully robust to identical and independent coherent idling noise.
  arXiv  Detail & Related papers  (2021-05-11T14:20:15Z)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)
• Cellular automaton decoders for topological quantum codes with noisy measurements and beyond [68.8204255655161]
  We propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes. For simplicity, we focus on the three-dimensional (3D) toric code on the rhombic dodecahedral lattice with boundaries and prove that the resulting local decoder has a non-zero error threshold. We find that this error correction procedure is remarkably robust against measurement errors and is also essentially insensitive to the details of the lattice and noise model.
  arXiv  Detail & Related papers  (2020-04-15T18:00:01Z)

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.