Related papers: Elevator Codes: Concatenation for resource-efficient quantum memory under biased noise

Elevator Codes: Concatenation for resource-efficient quantum memory under biased noise

URL: http://arxiv.org/abs/2601.10786v1
Date: Thu, 15 Jan 2026 19:00:00 GMT
Title: Elevator Codes: Concatenation for resource-efficient quantum memory under biased noise
Authors: Peter Shanahan, Diego Ruiz,
Abstract summary: Biased-noise qubits can significantly reduce the overhead of quantum error correction.<n>Codes such as the rectangular surface code or XZZX code substantially reduce the qubit overhead under biased noise.<n>We introduce a 2D local code construction that outperforms these codes for noise biases $ge 7times104$.
Score: 0.0
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: Biased-noise qubits, in which one type of error (e.g. $X$- and $Y$-type errors) is significantly suppressed relative to the other (e.g. $Z$-type errors), can significantly reduce the overhead of quantum error correction. Codes such as the rectangular surface code or XZZX code substantially reduce the qubit overhead under biased noise, but they still face challenges. The rectangular surface code suffers from a relatively low threshold, while the XZZX code requires twice as many physical qubits to maintain the same code distance as the surface code. In this work, we introduce a 2D local code construction that outperforms these codes for noise biases $η\ge 7\times10^{4}$, reducing the qubit overhead by over 50% at $p_Z=10^{-3}$ and $η= 2 \times 10^6$ to achieve a logical error rate of $10^{-12}$. Our construction relies on the concatenation of two classical codes. The inner codes are repetition phase-flip codes while the outer codes are high-rate bit-flip codes enabled by their implementation at the logical level, which circumvents device connectivity constraints. These results indicate that under sufficiently biased noise, it is advantageous to address phase-flip and bit-flip errors at different layers of the coding scheme. The inner code should prioritize a high threshold for phase-flip errors, while the bit-flip outer code should optimize for encoding rate efficiency. In the strong biased-noise regime, high-rate outer codes keep the overhead for correcting residual bit-flip errors comparable to that of the repetition code itself, meaningfully lower than that required by earlier approaches.

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)
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 [118.67046728951689]
We experimentally demonstrate three time-dynamic implementations of the surface code.<n>First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three.<n>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.<n>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)
Compare the Pair: Rotated vs. Unrotated Surface Codes at Equal Logical Error Rates [0.0]
Quantum computers will require resource-efficient error-correcting codes. Instead of distance, a more useful qubit-saving metric would be based on logical error rates. We find the well-below-threshold scaling of logical to physical error rates under circuit-level noise for both codes.
arXiv Detail & Related papers (2024-09-23T07:27:20Z)
Hardware-efficient quantum error correction via concatenated bosonic qubits [41.6475446744259]
Quantum computers will need to incorporate quantum error correction, where a logical qubit is redundantly encoded in many noisy physical qubits.<n>Here, using a microfabricated superconducting quantum circuit, we realize a logical qubit memory formed from the concatenation of encoded bosonic cat qubits.<n>We study the performance and scaling of the logical qubit memory, finding that the phase-flip correcting repetition code operates below threshold.
arXiv Detail & Related papers (2024-09-19T18:00:53Z)
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)
LDPC-cat codes for low-overhead quantum computing in 2D [3.9373541926236766]
Quantum low-density parity-check (qLDPC) codes are a promising construction for drastically reducing the overhead of fault-tolerant quantum computing. An alternative approach to reduce the hardware overhead of fault-tolerance is to use bosonic cat qubits. We propose an architecture based on cat qubits suppressed in classical LDPC codes for phase-flips.
arXiv Detail & Related papers (2024-01-17T19:00:05Z)
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)
Suppressing quantum errors by scaling a surface code logical qubit [147.2624260358795]
We report the measurement of logical qubit performance scaling across multiple code sizes. Our system of superconducting qubits has sufficient performance to overcome the additional errors from increasing qubit number. Results mark the first experimental demonstration where quantum error correction begins to improve performance with increasing qubit number.
arXiv Detail & Related papers (2022-07-13T18:00:02Z)
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)

This list is automatically generated from the titles and abstracts of the papers in this site.