Bias-tailored single-shot quantum LDPC codes

• URL: http://arxiv.org/abs/2507.02239v1
• Date: Thu, 03 Jul 2025 02:18:16 GMT
• Title: Bias-tailored single-shot quantum LDPC codes
• Authors: Shixin Wu, Todd A. Brun, Daniel A. Lidar,
• Abstract summary: Quantum hardware rarely suffers equal amounts of bit-flip ($X$) and phase-flip ($Z$) errors.<n>A code that is bias-tailored'' can exploit this imbalance, lowering the fault-tolerance overhead.<n>A complementary idea, called "single-shot" error correction, aims to recover from data errors and noisy measurements in a single round of stabilizer readout.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum hardware rarely suffers equal amounts of bit-flip ($X$) and phase-flip ($Z$) errors; one type is often much more common than the other. A code that is ``bias-tailored'' can exploit this imbalance, lowering the fault-tolerance overhead. A complementary idea, called "single-shot" error correction, aims to recover from data errors and noisy measurements in a single round of stabilizer readout, avoiding slow repetition cycles. In this work, we combine these two ideas and build a hierarchy of new quantum codes. The full construction starts from the syndrome-encoded hypergraph product code and then tailors it to the dominant error type. The resulting code keeps the single-shot guarantee for every noise model while boosting the threshold whenever $X$ and $Z$ errors are asymmetric. By removing carefully chosen blocks of stabilizers we obtain two trimmed variants. The first, called the simplified code, cuts the physical-qubit count by $1/6$ and halves the number of stabilizer measurements, yet its minimum distance grows quadratically compared to the standard design and its biased noise threshold is unchanged. The second, called the reduced code, achieves the same hardware savings but trades away single-shot protection for purely $X$ or purely $Z$ noise; instead it remains single-shot under balanced, or depolarizing, noise. In settings where strongly biased noise is likely, either trimmed code offers a less resource-intensive alternative to the full construction. As a concrete illustration, we lift the two-dimensional XZZX surface code to a three-dimensional cubic lattice and show that this ``3D XZZX'' code is an explicit member of the simplified family. Taken together, these bias-tailored single-shot codes provide an adjustable set of code design alternatives, allowing tradeoffs between hardware overhead and noise types.

Related papers

• $ε$-Softmax: Approximating One-Hot Vectors for Mitigating Label Noise [99.91399796174602]
  Noisy labels pose a common challenge for training accurate deep neural networks.<n>We propose $epsilon$-softmax, which modifies the outputs of the softmax layer to approximate one-hot vectors with a controllable error.<n>We prove theoretically that $epsilon$-softmax can achieve noise-tolerant learning with controllable excess risk bound for almost any loss function.
  arXiv  Detail & Related papers  (2025-08-04T13:10:48Z)
• Single-shot and two-shot decoding with generalized bicycle codes [0.027042267806481293]
  Generalized-bicycle (GB) quantum error-correcting codes have naturally redundant minimum-weight stabilizer generators.<n>We constructed several short GB codes with relatively large dimensions, distances, and syndrome, also admitting fault-tolerant near-time-optimal syndrome measurement schedules.
  arXiv  Detail & Related papers  (2025-02-26T18:54:19Z)
• 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)
• Tailoring Dynamical Codes for Biased Noise: The X$^3$Z$^3$ Floquet Code [0.0]
  We propose the X$3$Z$3$ Floquet code, a dynamical code with improved performance under biased noise.<n>Our work establishes the X$3$Z$3$ code as a prime quantum error-correcting code, particularly for devices with reduced connectivity.
  arXiv  Detail & Related papers  (2024-11-07T18:49:16Z)
• $\mathbb{USCD}$: Improving Code Generation of LLMs by Uncertainty-Aware Selective Contrastive Decoding [64.00025564372095]
  Large language models (LLMs) have shown remarkable capabilities in code generation. The effects of hallucinations (e.g., output noise) make it challenging for LLMs to generate high-quality code in one pass. We propose a simple and effective textbfuncertainty-aware textbfselective textbfcontrastive textbfdecoding.
  arXiv  Detail & Related papers  (2024-09-09T02:07:41Z)
• Noise-adapted qudit codes for amplitude-damping noise [6.320926638892934]
  We identify a $[4,1]$ qudit error correcting code tailored to protect against amplitude-damping noise.<n>We show that this four-qudit code satisfies the error correction conditions for all single-qudit and a few two-qudit damping errors.<n>We generalize this construction to a family of $[2M+2, M]$ qudit codes that can approximately correct all the single-qudit and a few two-qudit amplitude-damping errors.
  arXiv  Detail & Related papers  (2024-06-04T16:07:26Z)
• 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)
• 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)
• One Loss for All: Deep Hashing with a Single Cosine Similarity based Learning Objective [86.48094395282546]
  A deep hashing model typically has two main learning objectives: to make the learned binary hash codes discriminative and to minimize a quantization error. We propose a novel deep hashing model with only a single learning objective. Our model is highly effective, outperforming the state-of-the-art multi-loss hashing models on three large-scale instance retrieval benchmarks.
  arXiv  Detail & Related papers  (2021-09-29T14:27:51Z)
• Avoiding coherent errors with rotated concatenated stabilizer codes [6.85316573653194]
  We integrate stabilizer codes with constant-excitation codes by code concatenation. We analyze this code's potential as a quantum memory.
  arXiv  Detail & Related papers  (2020-10-01T16:39:21Z)
• Single-shot error correction of three-dimensional homological product codes [3.6748639131154315]
  Single-shot error correction corrects data noise using only a single round of noisy measurements on the data qubits. We introduce a general concept of confinement for quantum codes, which roughly stipulates qubit errors cannot grow without triggering more measurement syndromes.
  arXiv  Detail & Related papers  (2020-09-24T16:33:35Z)

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.