Hierarchical Logical Processor on the Rotated Surface Code with Shuttle Buses

• URL: http://arxiv.org/abs/2606.22594v1
• Date: Sun, 21 Jun 2026 17:03:15 GMT
• Title: Hierarchical Logical Processor on the Rotated Surface Code with Shuttle Buses
• Abstract summary: Quantum platforms with beyond-planar connectivity provide new opportunities for fault-tolerant quantum computation (FTQC)<n>We propose the Hierarchical Logical Processor (HLP), which suppressed a high-rate quantum code with the rotated surface code (RSC)<n>HLP can achieve beyond-RSC encoding efficiency while requiring long-range connectivity only once every $(d_0)$ rounds of level-0 error correction.
• Score: 3.2335877410044964
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum platforms with beyond-planar connectivity provide new opportunities for fault-tolerant quantum computation (FTQC). While quantum low-density parity-check (qLDPC) codes offer high encoding efficiency, their direct implementation requires non-local couplings in every round of syndrome extraction, incurring additional physical error and implementation complexity. To reduce the frequency of such couplings, we propose the Hierarchical Logical Processor (HLP), which concatenates a high-rate quantum CSS code with the rotated surface code (RSC). HLPs can achieve beyond-RSC encoding efficiency while requiring long-range connectivity only once every $Θ(d_0)$ rounds of level-0 error correction, where $d_0$ denotes the base-code distance, substantially reducing the frequency of non-local couplings relative to direct implementations of qLDPC codes. HLPs introduce elongated RSC patches called shuttle buses. Using transversal hybrid-unit CNOT gates, a single shuttle bus can simultaneously couple to multiple standard RSC patches. This capability enables efficient level-1 syndrome extraction with suppressed level-1 error correlations and supports highly parallel logical Pauli measurements. We perform circuit-level simulations of several concrete HLP constructions and benchmark both logical memory and logical Pauli measurement performance. At a physical error rate of $10^{-3}$, an HLP based on the [[256,194,4]] code achieves 3-4 times higher qubit efficiency than the standard RSC. Compared with the yoked surface code on the same level-1 code, this HLP reduces the space overhead per logical qubit by 100-200 physical qubits and shortens the logical error-correction cycle time by a factor of 20-30.

Related papers

• CAbLECAR: efficiently scheduling QLDPC codes on a tileable spin qubit chip with shuttling [2.6689579741750915]
  We investigate the implementation of QLDPC codes on a tileable, shuttling-based spin qubit architecture.<n>By tailoring syndrome extraction circuits to the shuttling noise model, we significantly improve on previous surface code proposals.<n>We find that the optimized schedules are up to 86% faster than hand-optimized schedules for certain code families.
  arXiv  Detail & Related papers  (2026-04-27T17:44:08Z)
• 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)
• Stairway Codes: Floquetifying Bivariate Bicycle Codes and Beyond [41.99844472131922]
  Floquet codes define fault-tolerant protocols through periodic measurement sequences.<n>We introduce Stairway codes, a family of high-rate Floquet protocols.<n>We demonstrate logical error rates surpassing those of other Floquet codes at comparable encoding rates.
  arXiv  Detail & Related papers  (2026-02-27T19:00:00Z)
• Decoding Correlated Errors in Quantum LDPC Codes [41.04211723135311]
  We introduce a decoding framework for correlated errors in quantum LDPC codes under circuit-level noise.<n>The core of our approach is a graph augmentation and rewiring for interference (GARI) method, which modifies the correlated detector error model.<n>Preliminary FPGA implementation results show that such high accuracy can be achieved in real time, with a per-round average decoding latency of 273 ns and sub-microsecond latency in 99.99% of the decoding instances.
  arXiv  Detail & Related papers  (2025-10-15T19:59:05Z)
• High-Rate Surgery: towards constant-overhead logical operations [3.085891666389647]
  We introduce high-rate surgery, a general scheme that can perform extensive, addressable logical Pauli-product measurements in parallel on arbitrary qLDPC codes.<n>Our results address a major bottleneck for performing complex, addressable logical operations on qLDPC codes in practice, advancing the prospect of scalable, constant-overhead fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2025-10-09T17:49:39Z)
• Batched high-rate logical operations for quantum LDPC codes [2.722479714583866]
  High-rate quantum LDPC codes reduce memory overhead by densely packing many logical qubits into a single block of physical qubits.<n>We extend this concept to high-rate computation by constructing emphbatched fault-tolerant operations that apply the same logical gate across many code blocks in parallel.
  arXiv  Detail & Related papers  (2025-10-07T17:26:10Z)
• Fast correlated decoding of transversal logical algorithms [67.01652927671279]
  Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead.<n>Recent advances have shown that by jointly decoding logical qubits in algorithms composed of logical gates, the number of syndrome extraction rounds can be reduced.<n>Here, we reform the problem of decoding circuits by directly decoding relevant logical operator products as they propagate through the circuit.
  arXiv  Detail & Related papers  (2025-05-19T18:00:00Z)
• Extractors: QLDPC Architectures for Efficient Pauli-Based Computation [39.98920557126034]
  We propose a new primitive that can augment any QLDPC memory into a computational block well-suited for Pauli-based computation.<n>In particular, any logical Pauli operator supported on the memory can be fault-tolerantly measured in one logical cycle.<n>Our architecture can implement universal quantum circuits via parallel logical measurements.
  arXiv  Detail & Related papers  (2025-03-13T14:07:40Z)
• Parallel Logical Measurements via Quantum Code Surgery [42.95092131256421]
  Quantum code surgery is a flexible and low overhead technique for performing logical measurements on quantum error-correcting codes.<n>We present a code surgery scheme, applicable to any qubit stabiliser low-density parity check (LDPC) code, that fault-tolerantly measures many logical Pauli operators in parallel.
  arXiv  Detail & Related papers  (2025-03-06T22:05:52Z)
• Fast and Parallelizable Logical Computation with Homological Product Codes [3.4338109681532027]
  High-rate quantum low-density-parity-check (qLDPC) codes promise a route to reduce qubit numbers, but performing computation while maintaining low space cost has required serialization of operations and extra time costs. We design fast and parallelizable logical gates for qLDPC codes, demonstrating their utility for key algorithmic subroutines such as the quantum adder.
  arXiv  Detail & Related papers  (2024-07-26T03:49:59Z)
• Constant-Overhead Fault-Tolerant Quantum Computation with Reconfigurable Atom Arrays [5.542275446319411]
  We propose a hardware-efficient scheme to perform fault-tolerant quantum computation with high-rate qLDPC codes on reconfigurable atom arrays. Our work paves the way for explorations of low-overhead quantum computing with qLDPC codes at a practical scale.
  arXiv  Detail & Related papers  (2023-08-16T19:47:17Z)

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.