Quantum Weight Reduction with Layer Codes

• URL: http://arxiv.org/abs/2603.04883v1
• Date: Thu, 05 Mar 2026 07:23:37 GMT
• Title: Quantum Weight Reduction with Layer Codes
• Authors: Andrew C. Yuan, Nouédyn Baspin, Dominic J. Williamson,
• Abstract summary: We introduce a simple and general procedure for quantum weight reduction that achieves check weight 6 and total qubit degree 6.<n>Our quantum weight reduction procedure replaces each qubit and check in an arbitrary Calderbank-Shor-Steane code with an ample patch of surface code.<n>This is a quantum analog of the simple classical weight reduction procedure where each bit and check is replaced by a repetition code.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum weight reduction procedures ease the implementation of quantum codes by sparsifying them, resulting in low-weight checks and low-degree qubits. However, to date, only few quantum weight reduction methods have been explored. In this work we introduce a simple and general procedure for quantum weight reduction that achieves check weight 6 and total qubit degree 6, lower than existing procedures at the cost of a potentially larger qubit overhead. Our quantum weight reduction procedure replaces each qubit and check in an arbitrary Calderbank-Shor-Steane code with an ample patch of surface code, these patches are then joined together to form a geometrically nonlocal Layer Code. This is a quantum analog of the simple classical weight reduction procedure where each bit and check is replaced by a repetition code. Due to the simplicity of our weight reduction procedure, bounds on the weight and degree of the resulting code follow directly from the Layer Code construction and hence are easily verified by inspection. Our procedure is well suited for implementation in modular architectures that consist of surface code patches networked via long-range interconnects.

Related papers

• Parsimonious Quantum Low-Density Parity-Check Code Surgery [38.902931077568795]
  We introduce a method to construct an ancilla system of qubit size $O(W log W)$ to measure an arbitrary logical operator of weight.<n>This new construction immediately reduces the overhead across various quantum code surgery schemes.
  arXiv  Detail & Related papers  (2026-03-05T11:52:57Z)
• Simplified Quantum Weight Reduction with Optimal Bounds [9.984974174262328]
  Low-weight codes are essential for implementing quantum error correction on physical hardware.<n>Weight reduction also serves as a critical theoretical tool, which may be relevant to the quantum PCP conjecture.<n>We introduce a new procedure for quantum weight reduction that combines geometric insights with coning techniques.
  arXiv  Detail & Related papers  (2025-10-10T17:58:31Z)
• Small Quantum Low Parity Density Check Codes for Near-Term Experiments [0.0]
  We present a simple construction recipe for small quantum LDPC codes based on recent developments in the field.<n>Our codes are approximately twice as efficient as comparable surface codes, yet require only weight-four parity checks.
  arXiv  Detail & Related papers  (2025-07-13T15:53:16Z)
• PTQ1.61: Push the Real Limit of Extremely Low-Bit Post-Training Quantization Methods for Large Language Models [64.84734437930362]
  Large Language Models (LLMs) suffer severe performance degradation when facing extremely low-bit (sub 2-bit) quantization.<n>We propose an extremely low-bit PTQ method called PTQ1.61, which enables weight quantization to 1.61-bit for the first time.<n>Experiments indicate our PTQ1.61 achieves state-of-the-art performance in extremely low-bit quantization.
  arXiv  Detail & Related papers  (2025-02-18T08:04:58Z)
• FlatQuant: Flatness Matters for LLM Quantization [58.28221892035609]
  We propose FlatQuant, a new post-training quantization approach that enhances the flatness of weights and activations.<n>Our approach identifies optimal affine transformations for each linear layer, calibrated in hours via a lightweight objective.<n>It achieves less than 1% accuracy drop for W4A4 quantization on the LLaMA-3-70B model, surpassing SpinQuant by 7.5%.
  arXiv  Detail & Related papers  (2024-10-12T08:10:28Z)
• Weight Reduced Stabilizer Codes with Lower Overhead [0.0]
  A stabilizer code is defined by a set of parity-check operators, which are measured in order to infer information about errors that may have occurred. Hastings proposed a method for reducing the parity checks of a stabilizer code, though it has previously only been studied in the regime. Here, we focus on the regime of small-to-medium size codes suitable for quantum computing hardware.
  arXiv  Detail & Related papers  (2024-02-07T20:08:38Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Gaussian conversion protocol for heralded generation of qunaught states [66.81715281131143]
  bosonic codes map qubit-type quantum information onto the larger bosonic Hilbert space. We convert between two instances of these codes GKP qunaught states and four-foldsymmetric binomial states corresponding to a zero-logical encoded qubit. We obtain GKP qunaught states with a fidelity of over 98% and a probability of approximately 3.14%.
  arXiv  Detail & Related papers  (2023-01-24T14:17:07Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• All-photonic one-way quantum repeaters [15.3862808585761]
  We propose a general framework for all-photonic one-way quantum repeaters based on the measurement-based error correction. We present a novel decoding scheme, where the error correction process is carried out at the destination based on the accumulated data from the measurements made across the network.
  arXiv  Detail & Related papers  (2022-10-18T18:07:19Z)
• Direct Quantization for Training Highly Accurate Low Bit-width Deep Neural Networks [73.29587731448345]
  This paper proposes two novel techniques to train deep convolutional neural networks with low bit-width weights and activations. First, to obtain low bit-width weights, most existing methods obtain the quantized weights by performing quantization on the full-precision network weights. Second, to obtain low bit-width activations, existing works consider all channels equally.
  arXiv  Detail & Related papers  (2020-12-26T15:21:18Z)

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.