Towards the Characterization of Logical Errors in Distributed Lattice Surgery

• URL: http://arxiv.org/abs/2607.29186v1
• Date: Fri, 31 Jul 2026 09:06:26 GMT
• Title: Towards the Characterization of Logical Errors in Distributed Lattice Surgery
• Abstract summary: Inter-module quantum operations are noisier than intra-module local gates, which introduces additional noise into the system.<n>We analyze distributed lattice surgery under heterogeneous noise conditions, focusing in particular on the merge operation as one of its fundamental subroutines.<n>Our results provide practical insights into selecting the optimal surface-code distance, establishing target local-gate fidelities, and determining the tolerable entangled-pair fidelity required for logical operations in a distributed architecture.
• Score: 1.9622606672571925
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Distributed quantum computing offers a scalable alternative to monolithic quantum processors by networking smaller quantum modules through shared entangled pairs. A central challenge in this setting is that inter-module quantum operations are typically noisier than intra-module local gates, which introduces additional noise into the system. In this work, we analyze distributed lattice surgery under heterogeneous noise conditions, focusing in particular on the merge operation as one of its fundamental subroutines. Specifically, we discuss the XX merge operation between two rotated surface-code patches hosted on two different quantum processors. We characterize logical errors in the resulting H-shaped spacetime diagram and estimate thresholds using a minimum-weight perfect matching (MWPM) decoder. We use a phenomenological noise model and derive distinct bulk and seam error rates to approximate a circuit-level noise model that includes contributions from local CNOT gates, noisy entangled pairs, idle errors, and readout errors. Our results provide practical insights into selecting the optimal surface-code distance, establishing target local-gate fidelities, and determining the tolerable entangled-pair fidelity required for logical operations in a distributed architecture.

Related papers

• Fault-Tolerant Logical Operations and Efficient State Preparation in Modular Quantum Architectures with Noisy Interfaces [0.12314765641075438]
  We show that interfaces can tolerate noise up to an order of magnitude higher than intra-QPU noise, with only a minor reduction in the fault-tolerance threshold.<n>We develop a protocol for preparing fault-tolerant logical GHZ states, reducing overhead, time, and nonlocal Bellpair consumption.<n>Our results provide quantitative evidence that distributed quantum error can enable scalable, fault-tolerant quantum computation in modular architectures.
  arXiv  Detail & Related papers  (2026-07-29T17:59:57Z)
• Correlation-Assisted Odd-Parity Encoded Gates in Coupled Fluxonium Qubits under Non-Markovian TLS Noise [2.347018755209939]
  Cor longitudinal noise can be partially converted into common-mode fluctuations in an oddparity two-qubit subspace.<n>Projecting the exchange-coupled two-qubit Hamiltonian onto this subspace yields an effective logical Hamiltonian.<n>Results identify a noise-adapted control mechanism for odd-parity encoded operations in coupled fluxonium devices.
  arXiv  Detail & Related papers  (2026-06-05T08:07:36Z)
• Trapped-Ion Multiqubit Gates are Compatible with Scalable Quantum Error Correction [0.0]
  We construct a detailed microscopic noise model for multi-qubit (MQ) gate operations.<n>We find that phonon heating and motional dephasing are well captured by effective single- and two-qubit error channels.<n>We explore the scalability of a quantum error correction scheme based on the rotated surface code.
  arXiv  Detail & Related papers  (2026-05-27T14:31:22Z)
• 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)
• Lattice surgery with Bell measurements: Modular fault-tolerant quantum computation at low entanglement cost [0.0]
  We introduce a protocol for lattice surgery on surface codes in which all non-local operations are Bell measurements.<n>We evaluate our protocol's performance when two logical qubits on separate modules are prepared in a logical Bell state.
  arXiv  Detail & Related papers  (2025-10-15T13:38:31Z)
• Tensor-network decoders for process tensor descriptions of non-Markovian noise [0.0]
  Quantum error correction (QEC) is essential for fault-tolerant computation.<n>Here, we examine the performance of two paradigmatic QEC codes.
  arXiv  Detail & Related papers  (2024-12-18T11:17:09Z)
• Optimal and robust error filtration for quantum information processing [0.0]
  Error filtration is a hardware scheme that mitigates noise by exploiting auxiliary qubits and entangling gates.<n>We benchmark our approach against figures of merit that correspond to different applications.
  arXiv  Detail & Related papers  (2024-09-02T17:58:44Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Accurate and Honest Approximation of Correlated Qubit Noise [39.58317527488534]
  We propose an efficient systematic construction of approximate noise channels, where their accuracy can be enhanced by incorporating noise components with higher qubit-qubit correlation degree.<n>We find that, for realistic noise strength typical for fixed-frequency superconducting qubits, correlated noise beyond two-qubit correlation can significantly affect the code simulation accuracy.
  arXiv  Detail & Related papers  (2023-11-15T19:00:34Z)
• Mitigating crosstalk errors by randomized compiling: Simulation of the BCS model on a superconducting quantum computer [41.94295877935867]
  Crosstalk errors, stemming from CNOT two-qubit gates, are a crucial source of errors on numerous quantum computing platforms. We develop and apply an extension of the randomized compiling protocol that includes a special treatment of neighboring qubits. Our twirling of neighboring qubits is shown to dramatically improve the noise estimation protocol without the need to add new qubits or circuits.
  arXiv  Detail & Related papers  (2023-05-03T18:00:02Z)
• Witnessing entanglement in trapped-ion quantum error correction under realistic noise [41.94295877935867]
  Quantum Error Correction (QEC) exploits redundancy by encoding logical information into multiple physical qubits. We present a detailed microscopic error model to estimate the average gate infidelity of two-qubit light-shift gates used in trapped-ion platforms. We then apply this realistic error model to quantify the multipartite entanglement generated by circuits that act as QEC building blocks.
  arXiv  Detail & Related papers  (2022-12-14T20:00:36Z)
• Software mitigation of coherent two-qubit gate errors [55.878249096379804]
  Two-qubit gates are important components of quantum computing. But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications. We present two software methods to mitigate parasitic two-qubit gate errors.
  arXiv  Detail & Related papers  (2021-11-08T17:37:27Z)

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.