Fault-tolerance of [[6, 1, 3]] non-CSS code family generated using measurements on graph states

• URL: http://arxiv.org/abs/2501.12072v1
• Date: Tue, 21 Jan 2025 11:55:44 GMT
• Title: Fault-tolerance of [[6, 1, 3]] non-CSS code family generated using measurements on graph states
• Authors: Harsh Gupta, Pranav Maheshwari, Ankur Raina,
• Abstract summary: We construct and analyze the fault tolerance of $[[6,1,3]]$ non-CSS quantum error correcting code under the anisotropic and depolarizing noise models.<n>This method was called fault-tolerance using bare ancilla by Brown emphet al.
• Score: 2.393694563816463
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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 rate-optimized code achieves fault-tolerance using a single ancilla qubit for syndrome measurement under anisotropic noise conditions. This method was called fault-tolerance using bare ancilla by Brown \emph{et al.} We give explicit construction of the code using measurements on non-planar graph states. We also argue that using our approach, we can construct a family of such fault-tolerant codes. This method fills a notable gap in constructing fault-tolerant non-CSS code families.

Related papers

• Addressable fault-tolerant universal quantum gate operations for high-rate lift-connected surface codes [0.8919684307774216]
  Quantum low-density parity check (qLDPC) codes are among the leading candidates to realize error-corrected quantum memories with low qubit overhead.<n>In this work, we introduce a construction to implement all Clifford quantum gate operations on the recently introduced lift-connected surface (LCS) codes.
  arXiv  Detail & Related papers  (2025-11-13T11:01:44Z)
• Fault-Tolerant Quantum Error Correction for Constant-Excitation Stabilizer Codes under Coherent Noise [11.41545154221656]
  Collective coherent noise poses challenges for fault-tolerant quantum error correction (FTQEC)<n>We introduce a complete fault-tolerant architecture for CE codes based on dual-rail concatenation.<n>Our results establish the first complete FTQEC framework for CE codes, demonstrating their robustness to coherent noise.
  arXiv  Detail & Related papers  (2025-07-14T15:37:12Z)
• Hierarchical Quantum Error Correction with Hypergraph Product Code and Rotated Surface Code [0.9002260638342727]
  We propose and analyze a hierarchical quantum error correction (QEC) scheme that encodes hypergraph product (HGP) codes with rotated surface codes.<n>The upper layer employs (3,4)-random HGP codes, known for their constant error rate.<n>The lower layer consists of a rotated surface code with distance 5, allowing hardware compatibility through lattice surgery.
  arXiv  Detail & Related papers  (2025-05-24T08:39:39Z)
• Sequential decoding of the XYZ$^2$ hexagonal stabilizer code [0.0]
  We study the XYZ$2$ code, defined on a honeycomb lattice, and use it to decode the syndrome information in two steps.<n>For depolarizing noise we find that the sequential matching decoder gives a threshold of 18.3%, close to optimal.<n>For phase-biased noise on data qubits, at a bias $eta = fracp_zp_x+p_y = 10$, we find that a belief-matching-based decoder reaches thresholds of 24.1%.
  arXiv  Detail & Related papers  (2025-05-06T16:53:51Z)
• Demonstrating dynamic surface codes [138.1740645504286]
  We experimentally demonstrate three time-dynamic implementations of the surface code. First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three. Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors. Third, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead.
  arXiv  Detail & Related papers  (2024-12-18T21:56:50Z)
• Fault-tolerance of the [[8,1,3]] non-CSS code [0.0]
  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.
  arXiv  Detail & Related papers  (2024-02-29T17:44:17Z)
• Fault-Tolerant Quantum Memory using Low-Depth Random Circuit Codes [0.24578723416255752]
  Low-depth random circuit codes possess many desirable properties for quantum error correction. We design a fault-tolerant distillation protocol for preparing encoded states of one-dimensional random circuit codes. We show through numerical simulations that our protocol can correct erasure errors up to an error rate of $2%$.
  arXiv  Detail & Related papers  (2023-11-29T19:00:00Z)
• A family of permutationally invariant quantum codes [54.835469342984354]
  We show that codes in the new family correct quantum deletion errors as well as spontaneous decay errors. Our construction contains some of the previously known permutationally invariant quantum codes. For small $t$, these conditions can be used to construct new examples of codes by computer.
  arXiv  Detail & Related papers  (2023-10-09T02:37:23Z)
• Fault-Tolerant Computing with Single Qudit Encoding [49.89725935672549]
  We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit. These codes can be customized to the specific physical errors on the qudit, effectively suppressing them. We demonstrate a Fault-Tolerant implementation on molecular spin qudits, showcasing nearly exponential error suppression with only linear qudit size growth.
  arXiv  Detail & Related papers  (2023-07-20T10:51:23Z)
• High threshold codes for neutral atom qubits with biased erasure errors [0.0]
  We identify a new type of structured noise motivated by neutral atom qubits, biased erasure errors. We study the performance of this model using gate-level simulations of the XZZX surface code. We discuss a potential physical implementation using a single plane of atoms and moveable tweezers.
  arXiv  Detail & Related papers  (2023-02-06T19:01:32Z)
• 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 computation on a 19-qubit wide 2d nearest neighbour qubit array [59.24209911146749]
  This paper explores the relationship between the width of a qubit lattice constrained in one dimension and physical thresholds. We engineer an error bias at the lowest level of encoding using the surface code. We then address this bias at a higher level of encoding using a lattice-surgery surface code bus.
  arXiv  Detail & Related papers  (2022-12-03T06:16:07Z)
• 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)
• Tailored XZZX codes for biased noise [60.12487959001671]
  We study a family of codes having XZZX-type stabilizer generators. We show that these XZZX codes are highly qubit efficient if tailored to biased noise.
  arXiv  Detail & Related papers  (2022-03-30T17:26:31Z)
• 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)
• Morphing quantum codes [77.34726150561087]
  We morph the 15-qubit Reed-Muller code to obtain the smallest known stabilizer code with a fault-tolerant logical $T$ gate. We construct a family of hybrid color-toric codes by morphing the color code.
  arXiv  Detail & Related papers  (2021-12-02T17:43:00Z)
• A decoder for the triangular color code by matching on a M\"obius strip [3.8073142980733]
  The color code is remarkable for its ability to perform fault-tolerant logic gates. This motivates the design of practical decoders that minimise the resource cost of color-code quantum computation. Our decoder is derived using relations among the stabilizers that preserve global conservation laws at the lattice boundary.
  arXiv  Detail & Related papers  (2021-08-25T18:00:03Z)
• 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)
• Achieving fault tolerance on capped color codes with few ancillas [0.0]
  We develop a notion of distinguishable fault set which captures both concepts of flags and weight parities. We also develop fault-tolerant protocols for error correction, measurement, state preparation, and logical T gate implementation.
  arXiv  Detail & Related papers  (2021-06-04T18:00:03Z)
• Between Shor and Steane: A unifying construction for measuring error syndromes [0.913755431537592]
  We find a unifying construction that generates a family of ancilla blocks that interpolate between Shor and Steane. This family increases the complexity of ancilla construction in exchange for reducing the rounds of measurement required to fault-tolerantly measure the error. Our method can be applied to any Calderbank-Shor-Steane codes and presents a new direction for optimizing fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2020-12-31T02:30:25Z)

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.