Concatenated Steane code with single-flag syndrome checks

• URL: http://arxiv.org/abs/2403.09978v3
• Date: Tue, 13 Aug 2024 17:28:03 GMT
• Title: Concatenated Steane code with single-flag syndrome checks
• Authors: Balint Pato, Theerapat Tansuwannont, Kenneth R. Brown,
• Abstract summary: A fault-tolerant error correction protocol with a high error suppression rate and low overhead is desirable for the near-term implementation of quantum computers. In this work, we develop a distance-preserving flag FTEC protocol for the [[49,1,9]]d Steane code.
• Score: 0.4369550829556578
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A fault-tolerant error correction (FTEC) protocol with a high error suppression rate and low overhead is very desirable for the near-term implementation of quantum computers. In this work, we develop a distance-preserving flag FTEC protocol for the [[49,1,9]] concatenated Steane code, which requires only two ancilla qubits per generator and can be implemented on a planar layout. We generalize the weight-parity error correction (WPEC) technique from [Phys. Rev. A 104, 042410 (2021)] and find a gate ordering of flag circuits for the concatenated Steane code which makes syndrome extraction with two ancilla qubits per generator possible. The FTEC protocol is constructed using the optimization tools for flag FTEC developed in [PRX Quantum 5, 020336 (2024)] and is simulated under the circuit-level noise model without idling noise. Our simulations give a pseudothreshold of $1.64 \times 10^{-3}$ for the [[49,1,9]] concatenated Steane code, which is better than a pseudothreshold of $1.43 \times 10^{-3}$ for the [[61,1,9]] 6.6.6 color code simulated under the same settings. This is in contrast to the code capacity model where the [[61,1,9]] code performs better.

Related papers

• Quantum error correction below the surface code threshold [107.92016014248976]
  Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit. We present two surface code memories operating below a critical threshold: a distance-7 code and a distance-5 code integrated with a real-time decoder. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.
  arXiv  Detail & Related papers  (2024-08-24T23:08:50Z)
• Lowering Connectivity Requirements For Bivariate Bicycle Codes Using Morphing Circuits [0.7980273012483661]
  We introduce a novel parity-check circuit design principle that we call morphing circuits. We show how to perform logical input/output circuits to an ancillary rotated surface code using morphing circuits. The new codes perform at least as well as those of Ref. [1] under uniform circuit-level noise.
  arXiv  Detail & Related papers  (2024-07-23T09:35:49Z)
• Reducing Quantum Error Correction Overhead with Versatile Flag-Sharing Syndrome Extraction Circuits [5.770351255180495]
  An efficient error syndrome extraction circuit should use fewer ancillary qubits, quantum gates, and measurements. We propose to design parallel flagged syndrome extraction with shared flag qubits for quantum stabilizer codes.
  arXiv  Detail & Related papers  (2024-06-30T06:35:48Z)
• Improving threshold for fault-tolerant color code quantum computing by flagged weight optimization [0.9002260638342727]
  thresholds of color codes under circuit-level noise are relatively low because of their high-weight stabilizer generators. We propose a method to suppress the impact of such errors using conditional error probabilities conditioned on the measurement outcomes of flag qubits. This method can also be applied to other weight-based decoders, making the color codes more promising for the candidate of experimental implementation of QEC.
  arXiv  Detail & Related papers  (2024-02-21T17:40:51Z)
• Bit-flipping Decoder Failure Rate Estimation for (v,w)-regular Codes [84.0257274213152]
  We propose a new technique to provide accurate estimates of the DFR of a two-iterations (parallel) bit flipping decoder. We validate our results, providing comparisons of the modeled and simulated weight of the syndrome, incorrectly-guessed error bit distribution at the end of the first iteration, and two-itcrypteration Decoding Failure Rates (DFR)
  arXiv  Detail & Related papers  (2024-01-30T11:40:24Z)
• Optimization tools for distance-preserving flag fault-tolerant error correction [0.3999851878220878]
  We develop tools that can potentially reduce the space and time overhead required for flag fault-tolerant quantum error correction (FTQEC) Our techniques include the compact lookup table construction, the Meet-in-the-Middle technique, the adaptive time decoding for flag FTQEC, and the separated $X$ and $Z$ counting technique. We evaluate the performance of our tools using numerical simulation of hexagonal color codes of 3, 5, 7, and 9 under circuit-level noise.
  arXiv  Detail & Related papers  (2023-06-22T13:17:03Z)
• Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices [60.02503434201552]
  We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix. This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
  arXiv  Detail & Related papers  (2022-12-20T13:41:27Z)
• 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)
• Realizing a class of stabilizer quantum error correction codes using a single ancilla and circular connectivity [0.0]
  We show that a class of "neighboring-blocks" stabilizer quantum error correction codes can be implemented in a resource-efficient manner using a single ancilla and circular near-neighbor qubit connectivity. We propose an implementation for syndrome-measurement circuits for codes from the class and illustrate its workings for cases of three-, five-, and nine-qubits stabilizer code schemes.
  arXiv  Detail & Related papers  (2022-07-27T08:25:38Z)
• 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)
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes [63.62764375279861]
  We compare two leading FT implementations of the T gate in 2D color codes under circuit noise. We find a circuit noise threshold of 0.07(1)% for the T gate via code switching, almost an order of magnitude below that achievable by state distillation in the same setting.
  arXiv  Detail & Related papers  (2021-01-06T19: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.