Asymmetry-aided measurement-based quantum repeaters and distributed quantum computing with a decoder-free client

• URL: http://arxiv.org/abs/2607.11238v1
• Date: Mon, 13 Jul 2026 08:24:01 GMT
• Title: Asymmetry-aided measurement-based quantum repeaters and distributed quantum computing with a decoder-free client
• Abstract summary: We show that a rectangular Bacon-Shor subsystem code transmits a logical qubit markedly more efficiently than transmission-unaware encodings.<n>We extend the framework to a central-to-client round trip in which a code-level, distance-preserving code switch joins the transmission legs to the client's computation.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Distributed quantum computation needs to move logical qubits across lossy optical links, yet this transmission layer is usually designed separately from the computation it serves. We treat the two together by recognizing that a measurement-based quantum repeater is a two-dimensional code foliated along the transmission axis, so that the dominant channel loss is concentrated on the transmitted sector while the locally measured qubits are largely spared. Matching a code's distance to this structural asymmetry, we show that a rectangular Bacon-Shor subsystem code transmits a logical qubit markedly more efficiently than transmission-unaware encodings. Over continental distances, its cost-optimal repeater density is about an order of magnitude lower than that of a recent $[[48,6,8]]$ benchmark at comparable transmission rate, and roughly half that of a symmetric code of equal size. Moreover, we extend the framework to a central-to-client round trip in which a code-level, distance-preserving code switch joins the transmission legs to the client's computation, and joint decoding of the heterogeneous syndrome record at the central node lets distributed quantum computation proceed with a decoder-free client.

Related papers

• 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)
• Asymptotic Limits of Entanglement Distribution [43.748379918040854]
  We investigate the limits of entanglement distribution across quantum networks utilizing intermediate stations and local operations.<n>We establish a strict dichotomy: the preservation of entanglement over arbitrarily long distances is possible if the underlying quantum channel admits a correctable subspace.<n>We derive a fundamental lower bound on the physical resource requirements, proving that for channels without a correctable subspace, the number of parallel channels per link must scale at least logarithmically with the number of intermediate stations to sustain a non-zero amount of entanglement.
  arXiv  Detail & Related papers  (2026-05-22T09:56:38Z)
• Loss-Tolerant Quantum Communication via Bosonic-GKP-Parity-Encoding [0.34376560669160394]
  Quantum repeaters constitute a promising platform for enabling long distance quantum communication.<n>We focus on the bosonic Gottesman Kitaev Preskill (GKP) code as a natural candidate for loss correction based quantum repeaters.
  arXiv  Detail & Related papers  (2026-04-10T06:14:47Z)
• Quantum repeaters based on stationary and flying Gottesman-Kitaev-Preskill qudits [0.0]
  We explore a quantum repeater scheme that employs quantum error correction (QEC) both on the flying (light) qubits and on the stationary (matter) qubits.<n>The idea is to combine the benefits of encoded one-way and two-way schemes where effective channel transmission and loss scaling are enhanced.
  arXiv  Detail & Related papers  (2025-08-01T11:12:39Z)
• Performance of Rotation-Symmetric Bosonic Codes in a Quantum Repeater Network [0.0]
  Quantum error correction codes based on continuous variables play an important role for the implementation of quantum communication systems. A natural application of such codes occurs within quantum repeater systems which are used to combat severe channel losses and local gate errors. Here we consider a cavity-QED based repeater scheme to address the losses in the quantum channel.
  arXiv  Detail & Related papers  (2023-08-30T07:39:11Z)
• The END: An Equivariant Neural Decoder for Quantum Error Correction [73.4384623973809]
  We introduce a data efficient neural decoder that exploits the symmetries of the problem. We propose a novel equivariant architecture that achieves state of the art accuracy compared to previous neural decoders.
  arXiv  Detail & Related papers  (2023-04-14T19:46:39Z)
• 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)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• Bandwidth-efficient distributed neural network architectures with application to body sensor networks [73.02174868813475]
  This paper describes a conceptual design methodology to design distributed neural network architectures. We show that the proposed framework enables up to a factor 20 in bandwidth reduction with minimal loss. While the application focus of this paper is on wearable brain-computer interfaces, the proposed methodology can be applied in other sensor network-like applications as well.
  arXiv  Detail & Related papers  (2022-10-14T12:35:32Z)
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
  We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
  arXiv  Detail & Related papers  (2021-09-26T07:29:54Z)
• Computation-aided classical-quantum multiple access to boost network communication speeds [61.12008553173672]
  We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC. We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
  arXiv  Detail & Related papers  (2021-05-30T11:19:47Z)

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.