Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Science and Technology

A Code-Centric Design Space for Error Management over Quantum Network Links

Huiping Lin, Kai Zhang, Jianxin Chen, Zhengfeng Ji

Published Nov 5, 2026• 0 citations
Publisher

Abstract

Abstract Quantum networks are expected to form a foundational infrastructure for quantum communication and distributed quantum computation, and their central challenge is reliable transmission of quantum states across noisy links. In classical networks this reliability is the job of the link layer, a role expected to be more critical for quantum networks, whose states cannot be copied or amplified. While quantum error correction (QEC) offers a powerful theory for protecting quantum information, the protocols that manage errors over quantum links, such as entanglement distillation, encoded-entanglement distribution, and direct encoded transmission, have evolved as separate families, obscuring their common coding structure and limiting cross-level optimization. Here we establish a unified, code-centric framework for error management over quantum network links. We prove that, with noise-free local operations, these protocol families are equivalent realizations of one underlying process: applying a quantum error-correcting code and extracting an error syndrome, differing only in what is encoded and how the syndrome is used. This equivalence induces a design space organized along two orthogonal axes, the encoding paradigm and the error management strategy, which exposes design choices and engineering optimizations, including localized preparation of logical entanglement and pipelined classical signaling. Within this design space, error detection and error correction emerge as two extreme modes of syndrome usage, naturally introducing hybrid error management strategies that interpolate between them. Through circuit-level simulations, we show that hybrid error management can reduce logical error rates by one to two orders of magnitude compared with pure error detection or pure error correction for small surface codes, while enabling explicit trade-offs between logical fidelity and acceptance probability. By reframing quantum-link error management as a quantum error correction problem, this work unifies previously disparate protocols, pushes the boundaries of performance, and lays a principled foundation for the quantum-network link layer.

DOI
10.1088/2058-9565/aebe5a

Related papers

Reliable Quantum Links: Entanglement, Error Correction, and Classical Communication

Mahmoud Saad Abouamer, Jaemin Kim, Jaron Skovsted Gundersen +5 more

This paper is a tutorial-style introduction to methods and protocols for reliable transmission of quantum information over noisy quantum links. The exposition is based on a design philosophy that parallels classical link-layer mechanisms such as forward error correction and Automatic Repeat reQuest (ARQ). It starts by drawing analogies and highlights differences between classical and quantum links. Such analogies are used as guiding principles, with explicit attention to where the classical correspondence no longer applies and where non-classical constraints and resources govern the protocol design. The emphasis is on the fact that classical reliability is achieved through fungible and cloneable bits, whereas unknown quantum states cannot be copied or freely retransmitted. In addition, quantum information is subject to stringent physical constraints due to decoherence as well as the need for transduction between stationary and flying qubits. Quantum error correction is presented as the analogue of classical forward error correction, where logical qubits are protected by encoding them into larger entangled code spaces and using syndrome measurements to infer and correct errors without collapsing the encoded state. It then introduces teleportation-based link abstractions, in which transmission of an unknown qubit is realized by consuming shared Bell pairs together with classical messages. Entanglement purification protocols play a role similar to ARQ-style reliability enhancement by converting many noisy entangled pairs into fewer, higher-fidelity pairs at the cost of additional resources. The paper is written from the perspective of classical communication engineering and is intended as a guide for translating the relevant ideas toward reliable quantum links and networks.

IEEE Open Journal of the Communications Society•Jan 1, 2026•0 citations

Design, decoding, and fault-tolerant implementation of quantum error-correcting codes

Diego Forlivesi

Quantum computation promises to revolutionize information processing by exploiting superposition and entanglement, enabling applications such as quantum simulation, combinatorial optimization, and secure quantum communication. Beyond individual processors, the quantum internet aims to connect quantum nodes through entanglement distribution, enabling distributed computation. However, quantum states are fragile: environmental interactions, imperfect gate operations, and measurement errors can quickly degrade encoded information. Reliable quantum computation therefore requires carefully designed quantum error-correcting codes and fault-tolerant protocols. Unlike classical redundancy schemes, quantum error correction must preserve delicate phase relationships and relies on indirect error detection through syndrome extraction with ancillary qubits, enabling error identification without collapsing encoded states. Topological codes, in particular, emerged early as the preferred choice for many architectures due to their planar structure, local interactions, and natural support for fault-tolerant logical operations. Color codes, for instance, allow transversal implementation of all Clifford gates, whereas non-Clifford operations require magic-state injection. More recent constructions, including quantum low-density parity-check codes, offer higher encoding rates and reduced resource overhead, but require long-range qubit connectivity and more complex protocols. Despite experimental progress, several challenges remain. Many platforms exhibit biased noise, motivating codes that exploit channel asymmetry. Real-time decoding remains a critical bottleneck, as fault-tolerant computation requires low-latency processing of rapidly generated syndrome data. Fault-tolerant logical state initialization also remains resource-intensive and scales poorly with code distance. Addressing these challenges, this thesis develops a unified framework spanning theory and experiment. It provides precise performance analysis of quantum error-correcting codes in the low physical error-rate regime, introduces codes tailored to biased noise, develops fast low-complexity decoding algorithms for real-time operation, and presents modular and efficient protocols for fault-tolerant state preparation of CSS codes. The latter is demonstrated experimentally through the preparation of a logical zero state of the Golay code on the Quantinuum H2 trapped-ion quantum computer.

•Jun 29, 2026•0 citations

Self-Correcting Quantum Circuits via Entanglement-Based Redundancy

Jincheng Zhang

This paper explores a novel approach to quantum error correction (QEC) centered around the deliberate incorporation of entanglement-based redundancy directly within the design of quantum circuits. Current QEC strategies often rely on external, post-processing correction stages, which introduce significant overhead and complexity. We argue that a more efficient and intrinsically robust solution lies in building self-correcting circuits where redundancy is woven into the circuit's architecture itself, utilizing entangled qubits to detect and mitigate errors in real-time. This approach shifts the paradigm from correction *after* computation to correction *during* computation. The core mechanism involves encoding logical information across multiple physical qubits through carefully designed entangled states, creating a network capable of detecting errors via measurement and then implementing corrective operations through controlled interactions. We present a theoretical framework for designing such circuits, detailing the key considerations for state preparation, entanglement distribution, and error detection/correction protocols. We demonstrate, through mathematical analysis and circuit design principles, that this entanglement-based redundancy can substantially improve the resilience of quantum computations against various noise sources. The proposed method offers a potentially transformative pathway towards fault-tolerant quantum computing, reducing the overall complexity and resource requirements associated with error correction.

•Aug 28, 2026•0 citations

Quantum Communication Protocol Design Based on Quantum Error-Correcting Codes

Jincheng Zhang

This paper presents the design of a communication protocol leveraging quantum error-correcting codes to enhance the reliability of quantum communication. The core idea revolves around encoding quantum information using a specific quantum error-correcting code and subsequently transmitting this encoded information. During transmission, the protocol employs error detection and correction techniques based on the chosen code to mitigate the detrimental effects of noise and decoherence, which are inherent challenges in quantum communication. The proposed protocol aims to significantly improve the robustness of quantum communication channels, a critical step towards realizing practical quantum networks and secure quantum key distribution. The theoretical framework and mathematical formulation of the protocol are presented, detailing the encoding process, error detection, and correction mechanisms. This work contributes to the growing field of quantum communication by providing a concrete design methodology for building more reliable quantum communication systems.

•Sep 2, 2026•0 citations

Hierarchical Decoding for Quantum Error Correction

Xulong Tang, Narges Alavisamani, Joan Camps +18 more

Fault-tolerant quantum computing requires classical decoders that can keep up with syndrome data streams and supply correction information and logical measurement outcomes to the quantum control system. Meeting these requirements at scale requires high throughput while controlling the end-to-end latency from readout to usable correction. In this paper, we organize decoding algorithms, execution strategies, and code constructions using common classifications and examine their performance and trade-offs under the reported evaluation conditions. We distinguish decoder-level hierarchy, where multiple decoding stages or resources cooperate to decode a single code, from code-level hierarchy, where the code construction itself introduces multiple decoding levels. We first review single-code hierarchical decoders and their cascaded predecoding and windowed, streaming, and distributed implementations. We then study hierarchical and concatenated codes, focusing on how decoding is coordinated across code levels through hard decisions, soft reliability information, or syndrome information. We also examine how qubit modalities shape decoding workloads and timing requirements, and review how different decoding platforms meet these requirements, including central processing units (CPUs), graphics processing units (GPUs), field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), and cryogenic platforms. By assessing design trade-offs, this paper clarifies connections across the literature and provides a shared foundation for QEC design exploration. It also identifies gaps in performance reporting and system integration to guide future research toward practical quantum error correction.

arXiv:2611.16271•Nov 12, 2026•0 citations

基于量子纠错码的分布式计算网络

Jincheng Zhang

This paper investigates the application of quantum error correction codes within a distributed computing network to achieve reliable quantum information transmission and computation. Traditional distributed computing networks are inherently vulnerable due to the fragility of quantum states. This research proposes a novel architecture leveraging quantum error correction codes to protect and repair quantum information, thereby enabling robust quantum computation. The core claim is that utilizing quantum error correction codes in distributed networks provides a pathway to scalable quantum computing. The central mechanism involves designing a network structure that exploits the error-correcting capabilities of these codes. This approach addresses the fundamental challenges of decoherence and noise, crucial for realizing practical distributed quantum systems. We explore key concepts such as code distance, syndrome decoding, and network topology optimization to demonstrate the feasibility and potential of this system. This work lays a foundational understanding for future research and development in building resilient and scalable distributed quantum computing infrastructures.

•Aug 28, 2026•0 citations
Abstract Quantum networks are expected to form a foundational infrastructure for quantum communication and distributed quantum computation, and their central challenge is reliable transmission of quantum states across noisy links. In classical networks this reliability is the job of the link layer, a role expected to be more critical for quantum networks, whose states cannot be copied or amplified. While quantum error correction (QEC) offers a powerful theory for protecting quantum information, the protocols that manage errors over quantum links, such as entanglement distillation, encoded-entanglement distribution, and direct encoded transmission, have evolved as separate families, obscuring their common coding structure and limiting cross-level optimization. Here we establish a unified, code-centric framework for error management over quantum network links. We prove that, with noise-free local operations, these protocol families are equivalent realizations of one underlying process: applying a quantum error-correcting code and extracting an error syndrome, differing only in what is encoded and how the syndrome is used. This equivalence induces a design space organized along two orthogonal axes, the encoding paradigm and the error management strategy, which exposes design choices and engineering optimizations, including localized preparation of logical entanglement and pipelined classical signaling. Within this design space, error detection and error correction emerge as two extreme modes of syndrome usage, naturally introducing hybrid error management strategies that interpolate between them. Through circuit-level simulations, we show that hybrid error management can reduce logical error rates by one to two orders of magnitude compared with pure error detection or pure error correction for small surface codes, while enabling explicit trade-offs between logical fidelity and acceptance probability. By reframing quantum-link error management as a quantum error correction problem, this work unifies previously disparate protocols, pushes the boundaries of performance, and lays a principled foundation for the quantum-network link layer.
This paper is a tutorial-style introduction to methods and protocols for reliable transmission of quantum information over noisy quantum links. The exposition is based on a design philosophy that parallels classical link-layer mechanisms such as forward error correction and Automatic Repeat reQuest (ARQ). It starts by drawing analogies and highlights differences between classical and quantum links. Such analogies are used as guiding principles, with explicit attention to where the classical correspondence no longer applies and where non-classical constraints and resources govern the protocol design. The emphasis is on the fact that classical reliability is achieved through fungible and cloneable bits, whereas unknown quantum states cannot be copied or freely retransmitted. In addition, quantum information is subject to stringent physical constraints due to decoherence as well as the need for transduction between stationary and flying qubits. Quantum error correction is presented as the analogue of classical forward error correction, where logical qubits are protected by encoding them into larger entangled code spaces and using syndrome measurements to infer and correct errors without collapsing the encoded state. It then introduces teleportation-based link abstractions, in which transmission of an unknown qubit is realized by consuming shared Bell pairs together with classical messages. Entanglement purification protocols play a role similar to ARQ-style reliability enhancement by converting many noisy entangled pairs into fewer, higher-fidelity pairs at the cost of additional resources. The paper is written from the perspective of classical communication engineering and is intended as a guide for translating the relevant ideas toward reliable quantum links and networks.
Quantum computation promises to revolutionize information processing by exploiting superposition and entanglement, enabling applications such as quantum simulation, combinatorial optimization, and secure quantum communication. Beyond individual processors, the quantum internet aims to connect quantum nodes through entanglement distribution, enabling distributed computation. However, quantum states are fragile: environmental interactions, imperfect gate operations, and measurement errors can quickly degrade encoded information. Reliable quantum computation therefore requires carefully designed quantum error-correcting codes and fault-tolerant protocols. Unlike classical redundancy schemes, quantum error correction must preserve delicate phase relationships and relies on indirect error detection through syndrome extraction with ancillary qubits, enabling error identification without collapsing encoded states. Topological codes, in particular, emerged early as the preferred choice for many architectures due to their planar structure, local interactions, and natural support for fault-tolerant logical operations. Color codes, for instance, allow transversal implementation of all Clifford gates, whereas non-Clifford operations require magic-state injection. More recent constructions, including quantum low-density parity-check codes, offer higher encoding rates and reduced resource overhead, but require long-range qubit connectivity and more complex protocols. Despite experimental progress, several challenges remain. Many platforms exhibit biased noise, motivating codes that exploit channel asymmetry. Real-time decoding remains a critical bottleneck, as fault-tolerant computation requires low-latency processing of rapidly generated syndrome data. Fault-tolerant logical state initialization also remains resource-intensive and scales poorly with code distance. Addressing these challenges, this thesis develops a unified framework spanning theory and experiment. It provides precise performance analysis of quantum error-correcting codes in the low physical error-rate regime, introduces codes tailored to biased noise, develops fast low-complexity decoding algorithms for real-time operation, and presents modular and efficient protocols for fault-tolerant state preparation of CSS codes. The latter is demonstrated experimentally through the preparation of a logical zero state of the Golay code on the Quantinuum H2 trapped-ion quantum computer.
This paper explores a novel approach to quantum error correction (QEC) centered around the deliberate incorporation of entanglement-based redundancy directly within the design of quantum circuits. Current QEC strategies often rely on external, post-processing correction stages, which introduce significant overhead and complexity. We argue that a more efficient and intrinsically robust solution lies in building self-correcting circuits where redundancy is woven into the circuit's architecture itself, utilizing entangled qubits to detect and mitigate errors in real-time. This approach shifts the paradigm from correction *after* computation to correction *during* computation. The core mechanism involves encoding logical information across multiple physical qubits through carefully designed entangled states, creating a network capable of detecting errors via measurement and then implementing corrective operations through controlled interactions. We present a theoretical framework for designing such circuits, detailing the key considerations for state preparation, entanglement distribution, and error detection/correction protocols. We demonstrate, through mathematical analysis and circuit design principles, that this entanglement-based redundancy can substantially improve the resilience of quantum computations against various noise sources. The proposed method offers a potentially transformative pathway towards fault-tolerant quantum computing, reducing the overall complexity and resource requirements associated with error correction.
This paper presents the design of a communication protocol leveraging quantum error-correcting codes to enhance the reliability of quantum communication. The core idea revolves around encoding quantum information using a specific quantum error-correcting code and subsequently transmitting this encoded information. During transmission, the protocol employs error detection and correction techniques based on the chosen code to mitigate the detrimental effects of noise and decoherence, which are inherent challenges in quantum communication. The proposed protocol aims to significantly improve the robustness of quantum communication channels, a critical step towards realizing practical quantum networks and secure quantum key distribution. The theoretical framework and mathematical formulation of the protocol are presented, detailing the encoding process, error detection, and correction mechanisms. This work contributes to the growing field of quantum communication by providing a concrete design methodology for building more reliable quantum communication systems.
Fault-tolerant quantum computing requires classical decoders that can keep up with syndrome data streams and supply correction information and logical measurement outcomes to the quantum control system. Meeting these requirements at scale requires high throughput while controlling the end-to-end latency from readout to usable correction. In this paper, we organize decoding algorithms, execution strategies, and code constructions using common classifications and examine their performance and trade-offs under the reported evaluation conditions. We distinguish decoder-level hierarchy, where multiple decoding stages or resources cooperate to decode a single code, from code-level hierarchy, where the code construction itself introduces multiple decoding levels. We first review single-code hierarchical decoders and their cascaded predecoding and windowed, streaming, and distributed implementations. We then study hierarchical and concatenated codes, focusing on how decoding is coordinated across code levels through hard decisions, soft reliability information, or syndrome information. We also examine how qubit modalities shape decoding workloads and timing requirements, and review how different decoding platforms meet these requirements, including central processing units (CPUs), graphics processing units (GPUs), field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), and cryogenic platforms. By assessing design trade-offs, this paper clarifies connections across the literature and provides a shared foundation for QEC design exploration. It also identifies gaps in performance reporting and system integration to guide future research toward practical quantum error correction.
This paper investigates the application of quantum error correction codes within a distributed computing network to achieve reliable quantum information transmission and computation. Traditional distributed computing networks are inherently vulnerable due to the fragility of quantum states. This research proposes a novel architecture leveraging quantum error correction codes to protect and repair quantum information, thereby enabling robust quantum computation. The core claim is that utilizing quantum error correction codes in distributed networks provides a pathway to scalable quantum computing. The central mechanism involves designing a network structure that exploits the error-correcting capabilities of these codes. This approach addresses the fundamental challenges of decoherence and noise, crucial for realizing practical distributed quantum systems. We explore key concepts such as code distance, syndrome decoding, and network topology optimization to demonstrate the feasibility and potential of this system. This work lays a foundational understanding for future research and development in building resilient and scalable distributed quantum computing infrastructures.