Optimizing compilation of error correction codes for 2xN quantum dot arrays and its NP-hardness

• URL: http://arxiv.org/abs/2501.09061v2
• Date: Sun, 05 Oct 2025 17:56:24 GMT
• Title: Optimizing compilation of error correction codes for 2xN quantum dot arrays and its NP-hardness
• Authors: Anthony Micciche, Feroz Ahmed Mian, Anasua Chatterjee, Andrew McGregor, Stefan Krastanov,
• Abstract summary: Recent advancements have demonstrated the shuttling of electron and hole spin qubits through a quantum dot array with high fidelity.<n>We develop a suite of methods for compiling any Calderbank-Shor-Steane (CSS) error-correcting code's syndrome-extraction circuit.<n>We provide tables stating the number of required shuttles for many contemporary codes of interest.
• Score: 1.7616042687330637
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The ability to physically move qubits within a register allows the design of hardware-specific error-correction codes, which can achieve fault-tolerance while respecting other constraints. In particular, recent advancements have demonstrated the shuttling of electron and hole spin qubits through a quantum dot array with high fidelity. It is therefore timely to explore error correction architectures consisting merely of two parallel quantum dot arrays, an experimentally validated architecture compatible with classical wiring and control constraints. Upon such an architecture, we develop a suite of heuristic methods for compiling any Calderbank-Shor-Steane (CSS) error-correcting code's syndrome-extraction circuit to run with a reduced number of shuttling operations. We demonstrate how column-regular qLDPC codes can be compiled in a provably minimal number of shuttles that is exactly equal to the column weight of the code when Shor-style syndrome extraction is used. We provide tables stating the number of required shuttles for many contemporary codes of interest. In addition, we provide a proof of the NP hardness of minimizing the number of shuttle operations for general codes, even when using Shor syndrome extraction. We also discuss how one could get around this by placing blanks in the ancilla array to achieve minimal shuttles with Shor syndrome extraction on any CSS code, at the cost of longer ancilla arrays

Related papers

• Scalable modular architecture for universal quantum computation [45.989522481082986]
  We show that it is sufficient to connect two qubit arrays that are evolution operator controllable by a single entangling two-qubit gate.<n>We illustrate the approach with two examples, consisting of 10, respectively 127 qubits, inspired by IBM quantum processors.
  arXiv  Detail & Related papers  (2025-07-19T16:45:47Z)
• 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)
• Order-of-magnitude extension of qubit lifetimes with a decoherence-free subspace quantum error correction code [0.0]
  We report on a robust quantum memory design using a decoherence-free subspace quantum error correction code. The resulting encoding scheme is characterized for long probe times, and shown to extend the memory time by over an order of magnitude compared to physical qubits.
  arXiv  Detail & Related papers  (2025-03-28T02:58:34Z)
• Quantum LDPC codes for erasure-biased atomic quantum processors [0.0]
  Quantum Low-Density Parity-Check (LDPC) codes have been recently shown to provide a path towards fault-tolerant quantum computing. We demonstrate that when the dominant errors are erasures, quantum LDPC codes additionally provide high thresholds and even stronger logical error suppression.
  arXiv  Detail & Related papers  (2025-02-27T15:23:40Z)
• Demonstrating dynamic surface codes [138.1740645504286]
  We experimentally demonstrate three time-dynamic implementations of the surface code.<n>First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three.<n>Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors.<n>Third, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead.
  arXiv  Detail & Related papers  (2024-12-18T21:56:50Z)
• Coprime Bivariate Bicycle Codes and Their Layouts on Cold Atoms [4.891626000873199]
  This work contributes a novel subclass of BB codes suitable for quantum error correction.<n>In contrast to vanilla BB codes, where parameters remain unknown prior to code discovery, the rate of the proposed code can be determined beforehand.<n>Using this coprime-BB construction, we found a number of surprisingly short to medium-length codes that were previously unknown.
  arXiv  Detail & Related papers  (2024-08-19T13:55:50Z)
• Reducing Quantum Error Correction Overhead with Versatile Flag-Sharing Syndrome Extraction Circuits [5.770351255180495]
  An efficient error syndrome extraction circuit should use fewer ancillary qubits, quantum gates, and measurements. We propose to design parallel flagged syndrome extraction with shared flag qubits for quantum stabilizer codes.
  arXiv  Detail & Related papers  (2024-06-30T06:35:48Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• High-rate quantum LDPC codes for long-range-connected neutral atom registers [0.0]
  High-rate quantum error correcting (QEC) codes with moderate overheads in qubit number and control complexity are desirable for fault-tolerant quantum computing. We analyze a family of Low-Density Parity-Check (LDPC) codes with limited long-range interactions and outline a near-term implementation in neutral atom registers.
  arXiv  Detail & Related papers  (2024-04-19T17:14:03Z)
• Towards early fault tolerance on a 2$\times$N array of qubits equipped with shuttling [0.0]
  Two-dimensional grid of locally-interacting qubits is promising platform for fault tolerant quantum computing. In this paper, we show that such constrained architectures can also support fault tolerance. We demonstrate that error correction is possible and identify the classes of codes that are naturally suited to this platform.
  arXiv  Detail & Related papers  (2024-02-19T23:31:55Z)
• 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)
• Fault-Tolerant Computing with Single Qudit Encoding [49.89725935672549]
  We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit. These codes can be customized to the specific physical errors on the qudit, effectively suppressing them. We demonstrate a Fault-Tolerant implementation on molecular spin qudits, showcasing nearly exponential error suppression with only linear qudit size growth.
  arXiv  Detail & Related papers  (2023-07-20T10:51:23Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Dual-rail encoding with superconducting cavities [2.003418126964701]
  We introduce the circuit-Quantum Electrodynamics (QED) dual-rail qubit in which our physical qubit is encoded in the single-photon subspace of two superconducting microwave cavities. We describe how to perform a gate-based set of universal operations that includes state preparation, logical readout, and parametrizable single and two-qubit gates.
  arXiv  Detail & Related papers  (2022-12-22T23:21:39Z)
• Quantum computation on a 19-qubit wide 2d nearest neighbour qubit array [59.24209911146749]
  This paper explores the relationship between the width of a qubit lattice constrained in one dimension and physical thresholds. We engineer an error bias at the lowest level of encoding using the surface code. We then address this bias at a higher level of encoding using a lattice-surgery surface code bus.
  arXiv  Detail & Related papers  (2022-12-03T06:16:07Z)
• Low-overhead quantum error correction codes with a cyclic topology [0.0]
  We propose a resource-efficient scaling of a five-qubit perfect code with cyclic stabilizers for small distances on the ring architecture. We show an approach to construct the quantum circuit of a correction code with ancillas entangled with non-neighboring data qubits.
  arXiv  Detail & Related papers  (2022-11-06T12:22:23Z)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)
• Trapping Sets of Quantum LDPC Codes [9.482750811734565]
  We identify and classify quantum trapping sets (QTSs) according to their topological structure and decoder used. We show that the knowledge of QTSs can be used to design better QLDPC codes and decoders.
  arXiv  Detail & Related papers  (2020-12-30T19:35:17Z)
• 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.