• Open Access IconOpen Access
  • Cite Icon28
  • https://doi.org/10.26421/qic17.15-16-4Copy DOI Icon

Weight reduction for quantum codes

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

We present an algorithm that takes a CSS stabilizer code as input, and outputs another CSS stabilizer code such that the stabilizer generators all have weights O(1) and such that O(1) generators act on any given qubit. The number of logical qubits is unchanged by the procedure, while we give bounds on the increase in number of physical qubits and in the effect on distance and other code parameters, such as soundness (as a locally testable code) and “cosoundness” (defined later). Applications are discussed, including to codes from high-dimensional manifolds which have logarithmic weight stabilizers. Assuming a conjecture in geometry[11], this allows the construction of CSS stabilizer codes with generator weight O(1) and almost linear distance. Another application of the construction is to increasing the distance to X or Z errors, whichever is smaller, so that the two distances are equal.

Similar Papers
  • Research Article
  • Citations6

Weight-Reduced Stabilizer Codes with Lower Overhead

  • Oct 04, 2024
  • PRX Quantum
  • Eric Sabo +4
  • Research Article
  • Citations4

Engineering Quantum Error Correction Codes Using Evolutionary Algorithms

  • Jan 01, 2025
  • IEEE Transactions on Quantum Engineering
  • Mark A Webster +1
  • Research Article
  • Citations6

Layer codes

  • Nov 04, 2024
  • Nature Communications
  • Dominic J Williamson +1
  • Research Article
  • Citations13

Parallel decoding of multiple logical qubits in tensor-network codes

  • May 31, 2022
  • Physical Review A
  • Terry Farrelly +4
  • Conference Article
  • Citations17

Quantum Codes from High-Dimensional Manifolds.

  • Jan 01, 2017
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Matthew B Hastings
  • Book Chapter
  • Citations302

Quantum Error Correction

  • Feb 28, 2020
  • Todd A Brun
  • Research Article
  • Citations6

Hardness of Braided Quantum Circuit Optimization in the Surface Code

  • Jan 01, 2023
  • IEEE Transactions on Quantum Engineering
  • Kunihiro Wasa +6
  • Conference Article
  • Citations7

A lower bound on the space overhead of fault-tolerant quantum computation

  • Jan 31, 2022
  • arXiv (Cornell University)
  • Omar Fawzi +2
  • Research Article

Accessible Quantum Gates on Classical Stabilizer Codes.

  • Dec 24, 2025
  • Physical review letters
  • Victor Barizien +2
  • Research Article
  • Citations11

Minimal qubit resources for the realization of measurement-based quantum computation

  • Jul 17, 2018
  • Physical Review A
  • Monireh Houshmand +2
  • Research Article
  • Citations2

Energy and power scaling in quantum computers based on rotated surface codes with silicon flip-flop qubits

  • Jun 02, 2025
  • EPJ Quantum Technology
  • Marco De Michielis +1
  • PDF
  • Research Article
  • Citations59

Nested quantum annealing correction

  • Aug 02, 2016
  • npj Quantum Information
  • Walter Vinci +2
  • Research Article
  • Citations22

Tracking quantum error correction

  • Aug 22, 2018
  • Physical Review A
  • Kosuke Fukui +2
  • Research Article
  • Citations228

Fault-tolerant operation of a logical qubit in a diamond quantum processor

  • May 05, 2022
  • Nature
  • M H Abobeih +8
  • Research Article
  • Citations23

Low overhead Clifford gates from joint measurements in surface, color, and hyperbolic codes

  • Nov 15, 2018
  • Physical Review A
  • Ali Lavasani +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.