Hardware-Aware Compilation and Execution of Bivariate Bicycle Codes on Neutral-Atom Systems

• URL: http://arxiv.org/abs/2608.17023v1
• Date: Mon, 17 Aug 2026 18:19:08 GMT
• Title: Hardware-Aware Compilation and Execution of Bivariate Bicycle Codes on Neutral-Atom Systems
• Abstract summary: Park-n-Ride is a system for compiling and executing the BB code on neutral-atom processors.<n>Park-n-Ride introduces a module layout and movement model aligned with neutral-atom constraints.<n>It exposes a compact BB-native logical interface for compilation, and integrates scheduling mechanisms.
• Score: 3.600426600039409
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum computers are noisy; without quantum error correction (QEC), deep programs fail as qubits lose information due to decoherence. Among QEC approaches, bivariate bicycle (BB) codes offer low overhead and constant-depth syndrome extraction, while neutral-atom arrays provide scalable, reconfigurable qubit layouts. However, executing BB-code primitives on neutral-atom systems requires a hardware-aware mapping that respects movement, zoning, and interaction constraints. We present Park-n-Ride, a system for compiling and executing the BB code on neutral-atom processors. Park-n-Ride introduces a module layout and movement model aligned with neutral-atom constraints, exposes a compact BB-native logical interface for compilation, and integrates scheduling mechanisms that enable efficient execution on zoned architectures. By co-designing BB-code abstractions with hardware execution, Park-n-Ride provides a practical path from qLDPC primitives to resource-efficient, high-throughput execution on reconfigurable neutral-atom arrays.

Related papers

• Structure-Aware Placement and Routing of Multi-Controlled Toffoli on Bivariate Bicycle Code Architectures [6.023860258848104]
  We introduce a targeted placement strategy that exploits the binary-tree structure of MCT decompositions to co-locate interacting subtrees.<n>We also evaluate the impact of factory placement across different topologies, demonstrating that grid-based layouts yield up to a $mathbf23.7%$ reduction in inter-module instructions.
  arXiv  Detail & Related papers  (2026-09-01T07:47:42Z)
• Surface code logical operations on a superconducting quantum processor [66.1042398805403]
  We experimentally realize key elements of patch-based surface-code logical processing on a 107-qubit superconducting quantum processor.<n>Our results advance superconducting surface-code experiments from protected logical memory to active, patch-based fault-tolerant logical operations.
  arXiv  Detail & Related papers  (2026-07-01T21:07:02Z)
• Routing Codes: High-Rate Quantum LDPC Codes with Short, Parallel Non-Local Connectivity [10.45558661301465]
  Quantum low-density parity-check (qLDPC) codes are promising candidates for realizing large-scale fault-tolerant quantum computing.<n>For mainstream quantum platforms such as superconductors and neutral atoms, the connectivity, the length of non-local couplings, and the complexity of wiring or atom rearrangement are key factors that dictate the difficulty of hardware realization.
  arXiv  Detail & Related papers  (2026-06-24T02:50:51Z)
• General circuit mapping algorithm for neutral atom quantum computers [1.047947389293086]
  Neutral atom quantum computers (NAQC) are emerging as a promising, scalable quantum computing platform.<n> circuit execution often requires physically moving qubits, making compilation a critical optimization challenge.<n>We propose a circuit independent mathematical framework built on graph-theoretic optimization that determines the minimal number of required qubit transfers.
  arXiv  Detail & Related papers  (2026-06-18T17:21:23Z)
• Distributed Quantum Error Correction with Bivariate Bicycle Codes in a Modular Architecture [1.8290236913635889]
  We study the realization of a BB code in a modular multiprocessor architecture, where quantum processors are interconnected through shared Bell pairs.<n>We partition the qubits of the [[144,12,12]] BB code across 4, 6, and 12 quantum processors and analyze the resulting logical error rates and pseudo-threshold performance.
  arXiv  Detail & Related papers  (2026-05-06T09:10:28Z)
• A Scalable Distributed Quantum Optimization Framework via Factor Graph Paradigm [46.08923284345648]
  We introduce a structure-aware framework for distributed quantum optimization.<n>We find that for a search space of size $N$, our framework achieves $O(sqrtN)$ query complexity up to processors and separator dependent factors.<n>We show that structure-aware decomposition delivers a practical path to scalable distributed quantum optimization on quantum networks.
  arXiv  Detail & Related papers  (2026-03-08T15:15:52Z)
• Exploiting Movable Logical Qubits for Lattice Surgery Compilation [43.290156259065554]
  We introduce a paradigm shift by exploiting movable logical qubits via teleportation during the logical lattice surgery CNOT gate.<n> Numerical simulations show that the proposed approach can substantially reduce the routed circuit depth.<n>An open-source implementation of our method is available on GitHub.
  arXiv  Detail & Related papers  (2025-12-03T19:00:04Z)
• Planar Fault-Tolerant Quantum Computation with Low Overhead [5.232949916418351]
  We introduce code craft, a framework for designing fault-tolerant logical operations on planar BB codes.<n>We show that logical operations, including controlled-NOT gates, state transfers, and Pauli measurements, can be efficiently implemented within this framework.
  arXiv  Detail & Related papers  (2025-06-22T15:07:03Z)
• 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)
• Accelerating Error Correction Code Transformers [56.75773430667148]
  We introduce a novel acceleration method for transformer-based decoders. We achieve a 90% compression ratio and reduce arithmetic operation energy consumption by at least 224 times on modern hardware.
  arXiv  Detail & Related papers  (2024-10-08T11:07:55Z)
• Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors [5.012570785656963]
  Dynamically field-programmable qubit arrays (DPQA) have emerged as a promising platform for quantum information processing. In this paper, we consider a DPQA architecture that contains multiple arrays and supports 2D array movements. We show that our DPQA-based compiled circuits feature reduced scaling overhead compared to a grid fixed architecture.
  arXiv  Detail & Related papers  (2023-06-06T08:13:10Z)
• Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
  We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions. We explore novel schemes for universal logic that improve resource overheads. Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
  arXiv  Detail & Related papers  (2021-12-22T19:00:03Z)

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.