Bunny Codes: Broadening Superconducting Quantum Error Correction Capability through Advanced Control Engineering

• URL: http://arxiv.org/abs/2606.22853v1
• Date: Mon, 22 Jun 2026 04:57:16 GMT
• Title: Bunny Codes: Broadening Superconducting Quantum Error Correction Capability through Advanced Control Engineering
• Abstract summary: We find a set of qLDPC codes with various stabilizer weights and distances that can be implemented on the two-dimensional nearest-neighbor qubit connectivity native to superconducting hardware.<n>Our results demonstrate that high-performance quantum error correction can be achieved using an expanded gate set rather than long-range couplers.
• Score: 16.033236929372727
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Drawing on advances in superconducting qubit control schemes that unlock enriched native gate sets at the hardware level, we systematically examine how harnessing this enlarged physical two-qubit gate pool -- specifically CNOT and CXSWAP -- streamlines syndrome extraction for certain qLDPC codes with nonlocal stabilizers. Through an exhaustive search, we discover a set of qLDPC codes with various stabilizer weights and distances that can be implemented on the two-dimensional nearest-neighbor qubit connectivity native to superconducting hardware while achieving performance equivalent to that of the direct CNOT implementation requiring long-range interactions. We refer to those codes as Bunny codes. Across all code distances we examine, the best Bunny codes with weight-6 stabilizers in periodic boundary conditions have a code rate approximately $3\times$ that of the toric code; when converted to open boundary conditions, they retain an approximately $2\times$ code rate advantage over the rotated surface code. In circuit-level simulation, we find that some Bunny codes exhibit logical error rates an order of magnitude lower than toric codes with comparable code rates. Our results demonstrate that high-performance quantum error correction can be achieved using an expanded gate set rather than long-range couplers, thereby significantly reducing hardware complexity.

Related papers

• Nearest-neighbour gates are all you need: High-rate quantum low-density parity-check codes on a planar grid [3.6646002427839126]
  We introduce a family of quantum low-density parity-check codes, for the first time, using only nearest-neighbour gates on a square grid of qubits.<n>We find finite-size instances such as a [[323,14,15]] code, whose code-efficiency ratio is nearly an order of magnitude larger than that of rotated surface-code patches.<n>These results show that the advantages of quantum low-density parity-check codes can survive compilation into strictly planar nearest-neighbour circuits.
  arXiv  Detail & Related papers  (2026-06-17T18:14:23Z)
• Barbell Codes: qLDPC Codes for Superconducting Quantum Hardware [2.8712862578745018]
  We introduce a family of qLDPC "barbell" codes accompanied by a realistic chip layout that supports all required two-qubit interactions.<n>We find that, with a modest overhead of $30$ data qubits per logical qubit, barbell codes can preserve information at a physical noise strength of $10-4$ for several trillion QEC cycles.
  arXiv  Detail & Related papers  (2026-06-04T12:01:24Z)
• Error Correction of Beamsplitter-Generated Entangled GKP States [56.80803785296797]
  A promising bosonic code is the Gottesman-Kitaev-Preskill (GKP) code.<n>We generate entangled states of GKP qubits by interfering two qunaught states, which have a grid structure but carry no logical information, on a beamsplitter.<n>We generate all four Bell states with an average fidelity of 69%, and demonstrate an extension of the entangled state lifetime through the use of quantum error correction.
  arXiv  Detail & Related papers  (2026-05-08T17:01:19Z)
• Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures [1.5531887595047786]
  Quantum low-density parity-check codes offer superior encoding rates and large code distance compared to surface codes.<n>Long-range stabilizer measurements pose significant challenges for implementation on realistic hardware with limited connectivity.<n>We introduce a novel hardware-software co-design that leverages a programmable communication network architecture to address these limitations.
  arXiv  Detail & Related papers  (2026-04-20T18:14:28Z)
• Placing and routing quantum LDPC codes in multilayer superconducting hardware [0.6713975160553138]
  We develop Hardware-Aware Layout, HAL: a robust, efficient runtime algorithm.<n> HAL generates around 150 explicit layouts of quantum low-density parity-check (qLDPC) codes.<n>We lay out highly nonlocal qLDPC code families that achieve competitive tradeoffs between hardware complexity and logical efficiency.
  arXiv  Detail & Related papers  (2025-07-30T18:19:44Z)
• Directional Codes: a new family of quantum LDPC codes on hexagonal- and square-grid connectivity hardware [0.0]
  Utility-scale quantum computing requires quantum error correction (QEC) to protect quantum information against noise.<n>Currently, superconducting hardware is a promising candidate for achieving fault tolerance due to its fast gate times and feasible scalability.<n>We construct a new family of qLDPC codes, which outperforms the rotated planar code (RPC)<n>We numerically evaluate the performance of directional codes, encoding four, six and twelve logical qubits.
  arXiv  Detail & Related papers  (2025-07-25T16:57:21Z)
• Efficient and Universal Neural-Network Decoder for Stabilizer-Based Quantum Error Correction [44.698141103370546]
  GraphQEC is a code-agnostic decoder leveraging machine-learning on the graph structure of stabilizer codes with linear time complexity.<n>Our approach represents the first universal solution for real-time quantum error correction across arbitrary stabilizer codes.
  arXiv  Detail & Related papers  (2025-02-27T10:56:53Z)
• Accommodating Fabrication Defects on Floquet Codes with Minimal Hardware Requirements [44.99833362998488]
  Floquet codes provide good fault-tolerant characteristics while benefiting from reduced connectivity requirements in hardware.<n>This is an under-studied issue of crucial importance for running such codes on realistic hardware.<n>We introduce a new method of accommodating defective qubits on a wide range of two-dimensional Floquet codes.
  arXiv  Detail & Related papers  (2024-05-24T18:00:05Z)
• 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)
• 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)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)
• Building a fault-tolerant quantum computer using concatenated cat codes [44.03171880260564]
  We present a proposed fault-tolerant quantum computer based on cat codes with outer quantum error-correcting codes. We numerically simulate quantum error correction when the outer code is either a repetition code or a thin rectangular surface code. We find that with around 1,000 superconducting circuit components, one could construct a fault-tolerant quantum computer.
  arXiv  Detail & Related papers  (2020-12-07T23:22:40Z)

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.